There exists infinitely many solutions to the problem. Let the required number be x: By Euclid's Division Lemma we have x = 9q + 1(Since dividend is 9 and remainder is 1) Put any value of q(q must be...
A number divided by 2 its reminder is 1, A number divided by 3 its reminder is 2, A number divided by 4 its reminder is 3, A number divided by 5 its reminder is 4, A number divided by 6 its reminder...