Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 AMC 8 Problems/Problem 23"

(→‎Video Solution)
(→‎Video Solution)
 
(8 intermediate revisions by 5 users not shown)
Line 10: Line 10:
 
<math>4, 10, 16, 22, 28, 34, \cdots</math> The counting numbers that leave a remainder of <math>3</math> when
 
<math>4, 10, 16, 22, 28, 34, \cdots</math> The counting numbers that leave a remainder of <math>3</math> when
 
divided by <math>5</math> are <math>3,8,13,18,23,28,33, \cdots</math> So <math>28</math> is the smallest possible number
 
divided by <math>5</math> are <math>3,8,13,18,23,28,33, \cdots</math> So <math>28</math> is the smallest possible number
−
of coins that meets both conditions. Because <math>4\cdot 7 = 28</math>, there are <math>\boxed{\textbf{(A)}\ 0}</math> coins left
+
of coins that meets both conditions. Because 28 is divisible by 7, there are <math>\boxed{\textbf{(A)}\ 0}</math> coins left
 
when they are divided among seven people.
 
when they are divided among seven people.
  
Line 19: Line 19:
 
smallest possible number of coins in the box is <math>28</math> and the remainder when divided by <math>7</math> is <math>\boxed{\textbf{(A)}\ 0}</math>.
 
smallest possible number of coins in the box is <math>28</math> and the remainder when divided by <math>7</math> is <math>\boxed{\textbf{(A)}\ 0}</math>.
  
−
===Solution 3===
+
==Video Solution==
−
 
 
−
We can set up a system of modular congruencies:
 
−
<cmath>g\equiv 4 \pmod{6}</cmath>
 
−
<cmath>g\equiv 3 \pmod{5}</cmath>
 
−
We can use the division algorithm to say <math>g=6n+4</math> <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 <math>28</math> is our smallest possible integer satisfying <math>g\equiv 28 \pmod{30}</math>. <math>28</math> <math>\div</math> <math>7=4</math>, making our remainder <math>0</math>. This means that there are <math>\boxed{\textbf{(A)}\ 0}</math> coins left over when equally divided amongst <math>7</math> people.
 
−
 
 
−
~Champion1234
 
  
 
==Video Solution==
 
==Video Solution==
−
 
+
https://www.youtube.com/watch?v=dQw4w9WgXcQ
−
https://youtu.be/g1PLxYVZE_U
 
 
-Happytwin
 
-Happytwin
  
−
https://www.youtube.com/watch?v=uMBev3FUoTs
+
https://www.youtube.com/watch?v=uMBev3FUoTs   ~David
  
 
==See Also==
 
==See Also==
 
{{AMC8 box|year=2006|n=II|num-b=22|num-a=24}}
 
{{AMC8 box|year=2006|n=II|num-b=22|num-a=24}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 08:23, 18 June 2024

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?

$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 5$

Solution

Solution 1

The counting numbers that leave a remainder of $4$ when divided by $6$ are $4, 10, 16, 22, 28, 34, \cdots$ The counting numbers that leave a remainder of $3$ when divided by $5$ are $3,8,13,18,23,28,33, \cdots$ So $28$ is the smallest possible number of coins that meets both conditions. Because 28 is divisible by 7, there are $\boxed{\textbf{(A)}\ 0}$ 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 $30$, so the smallest possible number of coins in the box is $28$ and the remainder when divided by $7$ is $\boxed{\textbf{(A)}\ 0}$.

Video Solution

Video Solution

https://www.youtube.com/watch?v=dQw4w9WgXcQ -Happytwin

https://www.youtube.com/watch?v=uMBev3FUoTs ~David

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_AMC_8_Problems/Problem_23&oldid=220708"