Difference between revisions of "2006 AMC 8 Problems/Problem 23"
Mathgl2018 (talk | contribs) (→Solution 3) |
Mathgl2018 (talk | contribs) m (→Solution 3) |
||
Line 24: | Line 24: | ||
<cmath>g\equiv 4 \pmod{6}</cmath> | <cmath>g\equiv 4 \pmod{6}</cmath> | ||
<cmath>g\equiv 3 \pmod{5}</cmath> | <cmath>g\equiv 3 \pmod{5}</cmath> | ||
− | We can use the division algorithm to say g=6n+4 <math>\Rightarrow</math> <math>6n\equiv 4 \pmod{5}</math> <math>\Rightarrow</math> <math>n\equiv 4 \pmod{5}</math>. If we plug the division algorithm in again, we get <math>n=5q+4</math>. This means that g=30q+28, which means that <math>g\equiv 28 \pmod{30}</math>. From this, we can see that 28 is our smallest possible integer satisfying <math>g\equiv 28 \pmod{30}</math>. 28 <math>\div</math> 7=4, making our remainder 0. This means there are <math>\boxed{\textbf{(A)}\ 0}</math> coins left over when equally divided amongst 7 people. | + | We can use the division algorithm to say g=6n+4 <math>\Rightarrow</math> <math>6n\equiv 4 \pmod{5}</math> <math>\Rightarrow</math> <math>n\equiv 4 \pmod{5}</math>. If we plug the division algorithm in again, we get <math>n=5q+4</math>. This means that <math>g=30q+28</math>, which means that <math>g\equiv 28 \pmod{30}</math>. From this, we can see that 28 is our smallest possible integer satisfying <math>g\equiv 28 \pmod{30}</math>. 28 <math>\div</math> 7=4, making our remainder 0. This means that there are <math>\boxed{\textbf{(A)}\ 0}</math> coins left over when equally divided amongst 7 people. |
~Champion1234 | ~Champion1234 |
Revision as of 15:03, 19 October 2020
Contents
Problem
A box contains gold coins. If the coins are equally divided among six people, four coins are left over. If the coins are equally divided among five people, three coins are left over. If the box holds the smallest number of coins that meets these two conditions, how many coins are left when equally divided among seven people?
Solution
Solution 1
The counting numbers that leave a remainder of 4 when divided by 6 are The counting numbers that leave a remainder of 3 when divided by 5 are So 28 is the smallest possible number of coins that meets both conditions. Because , there are coins left when they are divided among seven people.
Solution 2
If there were two more coins in the box, the number of coins would be divisible by both 6 and 5. The smallest number that is divisible by 6 and 5 is , so the smallest possible number of coins in the box is and the remainder when divided by 7 is .
Solution 3
We can set up a system of modular congruencies: We can use the division algorithm to say g=6n+4 . If we plug the division algorithm in again, we get . This means that , which means that . From this, we can see that 28 is our smallest possible integer satisfying . 28 7=4, making our remainder 0. This means that there are coins left over when equally divided amongst 7 people.
~Champion1234
Video Solution
https://youtu.be/g1PLxYVZE_U -Happytwin
See Also
2006 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 22 |
Followed by Problem 24 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.