Difference between revisions of "1979 USAMO Problems/Problem 1"
Viperstrike (talk | contribs) (→Solution 2) |
Viperstrike (talk | contribs) (→Solution 2) |
||
| Line 6: | Line 6: | ||
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. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
== See also == | == See also == | ||
Revision as of 13:52, 12 August 2012
Problem
Determine all non-negative integral solutions 
if any, apart from permutations, of the Diophantine Equation 
.
Solution 1
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
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.
See also
| 1979 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
