Krushna gave yash a number nn and challenged him to find the number of distinct remainder when nn is divided by all the numbers from 11 to nn .
Answers
Answered by
0
Step-by-step explanation:
gives any help to find the box with more ... always consecutive numbers whose sum is divisible by m ... don't have a 0, the remainders can be (m-1) values. ... contains p or lesser number of pigeons.
Similar questions