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 "1976 USAMO Problems/Problem 3"

m (→‎Solution)
m
Line 5: Line 5:
 
{{alternate solutions}}
 
{{alternate solutions}}
  
−
We have the trivial solution, <math>(a,b,c)=(0,0,0)</math>. Now WLOG, let the variables be positive.
+
Either <math>a^2=0</math> or <math>a^2>0</math>. If <math>a^2=0</math>, then <math>b^2=c^2=0</math>. Symmetry applies for <math>b</math> as well. If <math>a^2,b^2\neq 0</math>, then <math>c^2\neq 0</math>. Now we look at <math>a^2\bmod{4}</math>:
  
 +
<math>a^2\equiv 0\bmod{4}</math>: Since a square is either 1 or 0 mod 4, then all the other squares are 0 mod 4. Let <math>a=2a_1</math>, <math>b=2b_1</math>, and <math>c=2c_1</math>. Thus <math>a_1^2+b_1^2+c_1^2=4a_1^2b_1^2</math>. Since the LHS is divisible by four, all the variables are divisible by 4, and we must do this over and over again, and from infinite descent, there are no non-zero solutions when <math>a^2\equiv 0\bmod{4}</math>.
  
−
* Case 1: <math>3|a</math>
+
<math>a^2\equiv 1\bmod{4}</math>: Since <math>b^2\neq 0\bmod{4}</math>, <math>b^2\equiv 1\bmod{4}</math>, and <math>2+c^2\equiv 1\bmod{4}</math>. But for this to be true, <math>c^2\equiv 3\bmod{4}</math>, which is an impossibility. Thus there are no non-zero solutions when <math>a^2\equiv 1\bmod{4}</math>.
−
Thus the RHS is a multiple of 3, and <math>b</math> and <math>c</math> are also multiples of 3. Let <math>a=3a_1</math>, <math>b=3b_1</math>, and <math>c=3c_1</math>. Thus <math>a_1^2+b_1^2+c_1^2=9a_1^2b_1^2</math>. Thus the new variables are all multiples of 3, and we continue like this indefinitely, and thus there are no solutions with <math>3|a</math>.
 
  
−
*Case 2: 3 is not a divisor of <math>a</math>.
+
Thus the only solution is the solution above: <math>(a,b,c)=0</math>.
−
Thus <math>a^2\equiv b^2\equiv 1\bmod{3}</math>, but for <math>a^2+b^2+c^2</math> to be a quadratic residue, <math>c^2\equiv 1\bmod{3}</math>, and we have that a multiple of 3 equals something that isn't a multiple of 3, which is a contradiction.
 
−
 
 
−
 
 
−
 
 
−
Thus after both cases, the only solution is the trivial solution stated above.
 
  
 
== See also ==
 
== See also ==

Revision as of 09:26, 24 October 2008

Problem

Determine all integral solutions of $a^2+b^2+c^2=a^2b^2$.

Solution

Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

Either $a^2=0$ or $a^2>0$. If $a^2=0$, then $b^2=c^2=0$. Symmetry applies for $b$ as well. If $a^2,b^2\neq 0$, then $c^2\neq 0$. Now we look at $a^2\bmod{4}$:

$a^2\equiv 0\bmod{4}$: Since a square is either 1 or 0 mod 4, then all the other squares are 0 mod 4. Let $a=2a_1$, $b=2b_1$, and $c=2c_1$. Thus $a_1^2+b_1^2+c_1^2=4a_1^2b_1^2$. Since the LHS is divisible by four, all the variables are divisible by 4, and we must do this over and over again, and from infinite descent, there are no non-zero solutions when $a^2\equiv 0\bmod{4}$.

$a^2\equiv 1\bmod{4}$: Since $b^2\neq 0\bmod{4}$, $b^2\equiv 1\bmod{4}$, and $2+c^2\equiv 1\bmod{4}$. But for this to be true, $c^2\equiv 3\bmod{4}$, which is an impossibility. Thus there are no non-zero solutions when $a^2\equiv 1\bmod{4}$.

Thus the only solution is the solution above: $(a,b,c)=0$.

See also

1976 USAMO (Problems • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
1 • 2 • 3 • 4 • 5
All USAMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1976_USAMO_Problems/Problem_3&oldid=28239"