1979 USAMO Problems/Problem 1: Difference between revisions
No edit summary |
Jerry122805 (talk | contribs) |
||
| Line 5: | Line 5: | ||
Recall that <math>n_i^4\equiv 0,1\bmod{16}</math> for all integers <math>n_i</math>. Thus the sum we have is anything from 0 to 14 modulo 16. But <math>1599\equiv 15\bmod{16}</math>, and thus there are no integral solutions to the given Diophantine equation. | Recall that <math>n_i^4\equiv 0,1\bmod{16}</math> for all integers <math>n_i</math>. Thus the sum we have is anything from 0 to 14 modulo 16. But <math>1599\equiv 15\bmod{16}</math>, and thus there are no integral solutions to the given Diophantine equation. | ||
== Solution 2== | == Solution 2== | ||
In base <math>16</math>, this equation would look like: | In base <math>16</math>, this equation would look like: | ||
Revision as of 17:50, 17 July 2020
Problem
Determine all non-negative integral solutions 
if any, apart from permutations, of the Diophantine Equation 
.
Solution 1
Recall that 
for all integers 
. Thus the sum we have is anything from 0 to 14 modulo 16. But 
, and thus there are no integral solutions to the given Diophantine equation.
Solution 2
In base 
, this equation would look like:
![\[n_1^4+n_2^4+\cdots +n_{14}^4=63F_{16}\]](http://latex.artofproblemsolving.com/4/f/7/4f781cb87004eba8361ae0e450dbdd301bc29832.png)
We notice that the unit digits of the LHS of this equation should equal to 
. In base , the only unit digits of fourth powers are 
and 
. Thus, the maximum of these 
terms is 14 
or 
. Since is less than , there are no integral solutions for this equation.
See Also
| 1979 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America. 
