- #1
Math100
- 797
- 221
- Homework Statement
- Solve the puzzle-problem below:
Yen Kung, 1372. We have an unknown number of coins. If you make 77 strings of them, you are 50 coins short; but if you make 78 strings, it is exact. How many coins are there?
[Hint: If N is the number of coins, then N=77x+27=78y for integers x and y.]
- Relevant Equations
- None.
Proof: Let N be the number of coins.
From the hint, we get the following Diophantine equation:
N=77x+27=78y for integers x and y.
Applying the Euclidean Algorithm produces:
78=1(77)+1
77=77(1)+0.
Now we have gcd(77, 78)=1.
Note that 1##\mid##27.
Since 1##\mid##27, it follows that the Diophantine equation
77x+27=78y can be solved.
Then we have 1=78-1(77).
This means 27=27[78-1(77)]
=27(78)-27(77)
=27(78)+27(-77).
Thus, xo=27 and yo=27.
Substituting xo=27 and yo=27 into the Diophantine equation
77x+27=78y, we get 77(27)+27=78(27)=2106.
Therefore, there are 2106 coins.
Is this the right/correct answer? I couldn't find the answer from my textbook because it didn't provide any. Can someone please review/confirm my work for this problem and see if this is the correct answer? Thank you.
From the hint, we get the following Diophantine equation:
N=77x+27=78y for integers x and y.
Applying the Euclidean Algorithm produces:
78=1(77)+1
77=77(1)+0.
Now we have gcd(77, 78)=1.
Note that 1##\mid##27.
Since 1##\mid##27, it follows that the Diophantine equation
77x+27=78y can be solved.
Then we have 1=78-1(77).
This means 27=27[78-1(77)]
=27(78)-27(77)
=27(78)+27(-77).
Thus, xo=27 and yo=27.
Substituting xo=27 and yo=27 into the Diophantine equation
77x+27=78y, we get 77(27)+27=78(27)=2106.
Therefore, there are 2106 coins.
Is this the right/correct answer? I couldn't find the answer from my textbook because it didn't provide any. Can someone please review/confirm my work for this problem and see if this is the correct answer? Thank you.