how many positive integer between 50 and 100 ,
(a) divisible by 7
(b) divisible by 11
(c) divisible by 7 and 11 ?
people generally answer this question as
(a) lowershield [((100-50)-1 )/7] = 7 , yess its true the no is 56 , 63 , 70, 84, 91 , 98
(b) lowershield [((100-50)-1 )/11] = 4 , oops its not true the no is 55,66,77,88,99
(c) lowershield [((100-50)-1 )/lcm(7,11)] = 0 , oops its not true the no is 77
if u will say to take uppershield then lets come
(a) uppershield[((100-50)-1)/7]=7 , yess its true
(b) uppershield[((100-50)-1)/11]=5 , yess its true
(c) uppershield[((100-50)-1)/lcm(7,11)]=1 , yess its true
now come to another question
how many no is divisible between 5 to 31 is divisible by 4 ?
case1 : loweshield [((31-5)-1)/4]=6 , yess its true 8,12,16,20,24,28
case 2 : uppershierld [((31-5)-1/4)]=7 , oops its wrong
how can we remove this ambiguity ?
if u will argue that check the no ? but we have to check for large no like 50 to 300000 then how can u count ?
my doubt is , is any way to remove this ambiguity ?