No Chinese Remainder Theorem at this time!
Number Theory
Level
3
Find the least positive integer that leaves remainders of 1, 2, and 3 when divided by 3, 5,and 7, respectively.
42
52
62
72
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
It shouldn't be a mcq question. It makes it just an observation task