Find the smallest positive integer that leaves remainder 5 when divided by 6 and remainder 1 when divided by 7.
Note
Testing numbers congruent to 5 modulo 6, the first one also congruent to 1 modulo 7 is 29.
Find the smallest positive integer that leaves remainder 5 when divided by 6 and remainder 1 when divided by 7.
Testing numbers congruent to 5 modulo 6, the first one also congruent to 1 modulo 7 is 29.