Advertisement - Members don't see this ad
if N >0 and integer, how many consecutive integers following N are needed to insure that at least one of the integers is divisible by another positive integer m?
this is from kbb and the answer is m-1....
could anyone can help me out how to solve this?
Thanks
this is from kbb and the answer is m-1....
could anyone can help me out how to solve this?
Thanks