Find the smallest positive integer that leaves remainder 3 when divided by 7 and remainder 4 when divided by 9.
Note
Testing numbers congruent to 3 modulo 7, the first one also congruent to 4 modulo 9 is 31.
Find the smallest positive integer that leaves remainder 3 when divided by 7 and remainder 4 when divided by 9.
Testing numbers congruent to 3 modulo 7, the first one also congruent to 4 modulo 9 is 31.