Detailed Explanation
We want a number that gives remainder 2 on dividing by 3, remainder 3 on dividing by 4, and remainder 4 on dividing by 5. The trick is to look at the pattern of the remainders. Notice that in each case the remainder is exactly 1 less than the divisor: dividing by 3 gives 2 (which is \( 3 - 1 \)), dividing by 4 gives 3 (which is \( 4 - 1 \)), dividing by 5 gives 4 (which is \( 5 - 1 \)). This means our number is always 1 short of a full division. If we add 1 to our number, it would divide exactly by 3, by 4 and by 5 with no remainder. So the number plus 1 must be a common multiple of 3, 4 and 5. To get the smallest such number, we use the smallest common multiple, which is the LCM of 3, 4 and 5.
Formula Used
Required number \( = (\text{LCM of } 3, 4, 5) - 1 \)
Solution
- Step 1: Spot the pattern in the remainders. Divisor 3 leaves remainder 2, divisor 4 leaves remainder 3, and divisor 5 leaves remainder 4. In every case the remainder is 1 less than the divisor.
- Step 2: Since each remainder is 1 short of the divisor, adding 1 to our number will make it divide exactly by all three. So the number plus 1 must be a common multiple of 3, 4 and 5.
- Step 3: Find the LCM of 3, 4 and 5. Since these numbers share no common factor, the LCM is their product: \[ \text{LCM} = 3 \times 4 \times 5 = 60 \]
- Step 4: The smallest common multiple is 60. Subtract 1 to get our number: \[ 60 - 1 = 59 \]
- Step 5: Check the answer. Dividing 59 by 3 gives 19 remainder 2. Dividing 59 by 4 gives 14 remainder 3. Dividing 59 by 5 gives 11 remainder 4. All conditions are satisfied.
- Step 6: Why is 59 the smallest? Any valid number must be 1 less than a common multiple of 3, 4 and 5. The common multiples are 60, 120, 180, and so on, giving numbers 59, 119, 179, and so on. Since 60 is the smallest common multiple, \( 60 - 1 = 59 \) is the smallest possible number.
Final Answer
The smallest such number is \( 59 \).
Common Mistake
A common mistake is to try adding up or averaging the remainders, or to add the divisors themselves. The correct idea is to notice that each remainder is 1 less than its divisor, so the number plus 1 must be the LCM of the divisors.