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
During AMC testing, the AoPS Wiki is in read-only mode and no edits can be made.

Difference between revisions of "1990 USAMO Problems/Problem 2"
Line 1: Line 1:
 
==Problem==
 
==Problem==
−
 
+
A sequence of [[function]]s <math>\, \{f_n(x) \} \,</math> is defined [[recursion|recursively]] as follows:
−
A sequence of functions <math>\, \{f_n(x) \} \,</math> is defined recursively as follows:
 
  
 
<math>
 
<math>
Line 8: Line 7:
 
</math>
 
</math>
  
−
(Recall that <math>\sqrt {\makebox[5mm]{}}</math> is understood to represent the positive square root.) For each positive integer <math>n</math>, find all real solutions of the equation <math>\, f_n(x) = 2x \,</math>.
+
(Recall that <math>\sqrt {\makebox[5mm]{}}</math> is understood to represent the positive [[square root]].) For each positive integer <math>n</math>, find all real solutions of the equation <math>\, f_n(x) = 2x \,</math>.
−
 
 
  
 
==Solution==
 
==Solution==
−
 
+
<math>x</math> must be nonnegative, since the natural root of any number is <math>\ge 0</math>. Solving for <math>n=1</math>, we get <math>x=4</math> and only <math>4</math>. We solve for <math>n=2</math>:
−
x must be positive, since if x is negative, we would be taking a negative square root.
 
−
 
 
−
Solving for n=1, we get x=4 and only 4. We solve for n=2:
 
  
 
<math>2x=\sqrt{x^2+6\sqrt{x^2+48}}</math>
 
<math>2x=\sqrt{x^2+6\sqrt{x^2+48}}</math>
Line 27: Line 22:
 
<math>x=4</math>
 
<math>x=4</math>
  
−
We get x=4 again. We can conjecture that x=4 is the only solution.
+
We get <math>x=4</math> again. We can conjecture that <math>x=4</math> is the only solution.
  
−
Plugging 2x=8 into <math>f_n(x)</math>, we get
+
Plugging <math>2x=8</math> into <math>f_n(x)</math>, we get
  
−
<math>f_{n+1}(x)=\sqrt{x^2+48}</math>
+
<cmath>f_{n+1}(x)=\sqrt{x^2+48}</cmath>
  
−
So if 4 is a solution for n=x, it is a solution for n=x+1. From induction, 4 is a solution for all n.
+
So if 4 is a solution for <math>n=x</math>, it is a solution for <math>n=x+1</math>. From [[induction]], 4 is a solution for all n.
  
 
{{solution}}
 
{{solution}}
  
 +
==See also==
 +
{{USAMO box|year=1990|num-b=1|num-a=3}}
  
−
==See Also==
+
[[Category:Olympiad Algebra Problems]]
−
 
 
−
{{USAMO box|year=1990|num-b=1|num-a=3}}
 

Revision as of 17:35, 19 October 2007

Problem

A sequence of functions $\, \{f_n(x) \} \,$ is defined recursively as follows:

$f_1(x) = \sqrt {x^2 + 48}, \quad \mbox{and} \\ f_{n + 1}(x) = \sqrt {x^2 + 6f_n(x)} \quad \mbox{for } n \geq 1.$

(Recall that $\sqrt {\makebox[5mm]{}}$ is understood to represent the positive square root.) For each positive integer $n$, find all real solutions of the equation $\, f_n(x) = 2x \,$.

Solution

$x$ must be nonnegative, since the natural root of any number is $\ge 0$. Solving for $n=1$, we get $x=4$ and only $4$. We solve for $n=2$:

$2x=\sqrt{x^2+6\sqrt{x^2+48}}$

$3x^2=6\sqrt{x^2+48}$

$x^4=4x^2+192$

$x^2=\dfrac{4+28}{2}=16$

$x=4$

We get $x=4$ again. We can conjecture that $x=4$ is the only solution.

Plugging $2x=8$ into $f_n(x)$, we get

\[f_{n+1}(x)=\sqrt{x^2+48}\]

So if 4 is a solution for $n=x$, it is a solution for $n=x+1$. From induction, 4 is a solution for all n.

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

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