cls input "enter a no"; num if num mod 14= num then print "no is divisible" else print "not divisible" end if end
All multiples of 49 are divisible by it. Ex: 49, 98, 147 etc
The reason is that 49 is divisible with numbers other than 1 and itself. 49 is divisible by 1, 7 and 49.
It is divisible by: 1 7 49 343 and 2401
No, but 98 is divisible by 298/2 = 49
Numbers:2 Num-bers
here 9273482784727490
cls input "enter a no"; num if num mod 14= num then print "no is divisible" else print "not divisible" end if end
for(unsigned num=1; num<0xffffffff; ++num) if(num%5==0 && num%6==0) std::cout<<num" is divisible by 5 and 6"<<std::endl;
Positive integers. Or non-negative integers. No point in arguing, simply ask your teacher which one they mean.
No. 49 is only divisible by 1, 7 and 49.
Besides 49 & 98? The numbers divisible by 49 are infinite.
Rounding numbers is easy because their are two rules to rounding numbers. 1) a </= 4 then a = 0 2) a >/= 5 then a = 10
All multiples of 49 are divisible by it. Ex: 49, 98, 147 etc
49 is divisible by 1, 7 and 49
The reason is that 49 is divisible with numbers other than 1 and itself. 49 is divisible by 1, 7 and 49.
No, 49 is not divisible by 14.