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 "2007 USAMO Problems/Problem 5"

m (→‎Solution 1: {})
m (→‎Solution 2)
Line 24: Line 24:
 
<div style="text-align:center;"><math>\frac{7^{7^{k+1}}+1}{7^{7^{k}}+1} = \frac{x^7 + 1}{x + 1}</math></div>
 
<div style="text-align:center;"><math>\frac{7^{7^{k+1}}+1}{7^{7^{k}}+1} = \frac{x^7 + 1}{x + 1}</math></div>
  
−
which is the shortened form of the [[geometric series]] <math>\displaystyle x^{6}-x^{5}+x^{4}-x^3 + x^2 - x+1</math>. This can be [[factor]]ed as <math>\displaystyle (x^{3}+3x^{2}+3x+1)^{2}-7x(x^{2}+x+1)^{2}</math>
+
which is the shortened form of the [[geometric series]] <math>x^{6}-x^{5}+x^{4}-x^3 + x^2 - x+1</math>. This can be [[factor]]ed as <math>(x^{3}+3x^{2}+3x+1)^{2}-7x(x^{2}+x+1)^{2}</math>.
  
−
Since <math>x</math> is an odd power of <math>7</math>, <math>\displaystyle 7x</math> is a [[perfect square]], and so we can factor this by difference of squares. Therefore, it is composite.
+
Since <math>x</math> is an odd power of <math>7</math>, <math>7x</math> is a [[perfect square]], and so we can factor this by difference of squares. Therefore, it is composite.
  
 
== See also ==
 
== See also ==

Revision as of 12:41, 16 October 2007

Problem

Prove that for every nonnegative integer $n$, the number $7^{7^n}+1$ is the product of at least $\displaystyle 2n+3$ (not necessarily distinct) primes.

Solution

Solution 1

We proceed by induction.

Let ${a_{n}}$ be $7^{7^{n}}+1$. The result holds for ${n=0}$ because ${a_0 = 2^3}$ is the product of $3$ primes.

Now we assume the result holds for ${n}$. Note that ${a_{n}}$ satisfies the recursion

${a_{n+1}= (a_{n}-1)^{7}+1} = a_{n}\left(a_{n}^{6}-7(a_{n}-1)(a_{n}^{2}-a_{n}+1)^{2}\right)$.

Since ${a_n - 1}$ is an odd power of ${7}$, ${7(a_n-1)}$ is a perfect square. Therefore ${a_{n}^{6}-7(a_{n}-1)(a_{n}^{2}-a_{n}+1)^{2}}$ is a difference of squares and thus composite, i.e. it is divisible by ${2}$ primes. By assumption, ${a_n}$ is divisible by ${2n + 3}$ primes. Thus ${a_{n+1}}$ is divisible by ${2+ (2n + 3) = 2(n+1) + 3}$ primes as desired.

Solution 2

Notice that $7^{{7}^{k+1}}+1=(7+1) \frac{7^{7}+1}{7+1} \cdot \frac{7^{7^2} + 1}{7^{7^1} + 1} \cdots \frac{7^{7^{k+1}}+1}{7^{7^{k}}+1}$. Therefore it suffices to show that $\frac{7^{7^{k+1}}+1}{7^{7^{k}}+1}$ is composite.

Let $x=7^{7^{k}}$. The expression becomes

$\frac{7^{7^{k+1}}+1}{7^{7^{k}}+1} = \frac{x^7 + 1}{x + 1}$

which is the shortened form of the geometric series $x^{6}-x^{5}+x^{4}-x^3 + x^2 - x+1$. This can be factored as $(x^{3}+3x^{2}+3x+1)^{2}-7x(x^{2}+x+1)^{2}$.

Since $x$ is an odd power of $7$, $7x$ is a perfect square, and so we can factor this by difference of squares. Therefore, it is composite.

See also

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