Read Mode
Number Theory
A heap of coconuts is divided into groups of 2, 3, and 5, and each time one coconut is left over. The least number of coconuts in the heap is __________?
Explanation and memory cue
The problem asks for the smallest number that leaves a remainder of 1 when divided by 2, 3, and 5. This means the number is one more than a common multiple of 2, 3, and 5. The least common multiple (LCM) of 2, 3, and 5 is 30, so the smallest such number is 30 + 1 = 31.