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 (wik)
(→‎Solutions)
 
(17 intermediate revisions by 7 users not shown)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 +
(''Titu Andreescu'') Prove that for every [[nonnegative]] [[integer]] <math>n</math>, the number <math>7^{7^n}+1</math> is the [[product]] of at least <math>2n+3</math> (not necessarily distinct) [[prime]]s.
  
−
Prove that for every [[nonnegative]] [[integer]] <math>n</math>, the number <math>7^{7^n}+1</math> is the [[product]] of at least <math>\displaystyle 2n+3</math> (not necessarily distinct) [[prime]]s.
+
==Solutions==
−
 
 
−
__TOC__
 
−
== Solution ==
 
−
We prove the result by induction.
 
−
 
 
−
Let <math>\displaystyle{a_{n}}</math> be <math>7^{7^{n}}+1</math>. The result holds for <math>\displaystyle{n=0}</math> because <math>\displaystyle{a_0 = 2^3}</math> is the product of <math>\displaystyle{3}</math> primes.
 
−
 
 
−
Now we assume the result holds for <math>\displaystyle{n}</math>. Note that <math>\displaystyle{a_{n}}</math> satisfies the [[recursion]]
 
  
 
=== Solution 1 ===
 
=== Solution 1 ===
−
<div style="text-align:center;"><math>\displaystyle{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)</math></div>
+
The proof is by induction. The base is provided by the <math>n = 0</math> case, where <math>7^{7^0} + 1 = 7^1 + 1 = 2^3</math>. To prove the inductive step, it suffices to show that if <math>x = 7^{2m - 1}</math> for some positive integer <math>m</math> then <math>(x^7 + 1)/(x + 1)</math> is composite. As a consequence, <math>x^7 + 1</math> has at least two more prime factors than does <math>x + 1</math>. To confirm that <math>(x^7 + 1)/(x + 1)</math> is composite, observe that
 +
<cmath>\begin{align*}
 +
\frac{x^7 + 1}{x + 1} &= \frac{(x + 1)^7 - ((x + 1)^7 - (x^7 + 1))}{x + 1} \\
 +
&= (x + 1)^6 - \frac{7x(x^5 + 3x^4 + 5x^3 + 5x^2 + 3x + 1)}{x + 1} \\
 +
&= (x + 1)^6 - 7x(x^4 + 2x^3 + 3x^2 + 2x + 1) \\
 +
&= (x + 1)^6 - 7^{2m}(x^2 + x + 1)^2 \\
 +
&= \{(x + 1)^3 - 7^m(x^2 + x + 1)\}\{(x + 1)^3 + 7^m(x^2 + x + 1)\}.
 +
\end{align*}</cmath>
 +
Also each factor exceeds 1. It suffices to check the smaller one; <math>\sqrt{7x}\leq x</math> gives
 +
<cmath>\begin{align*}
 +
(x + 1)^3 - 7^m(x^2 + x + 1) &= (x + 1)^3 - \sqrt{7x}(x^2 + x + 1) \\
 +
&\geq x^3 + 3x^2 + 3x + 1 - x(x^2 + x + 1) \\
 +
&= 2x^2 + 2x + 1\geq 113 > 1.
 +
\end{align*}</cmath>
 +
Hence <math>(x^7 + 1)/(x + 1)</math> is composite and the proof is complete.
  
−
Since <math>\displaystyle{a_n - 1}</math> is an odd power of <math>\displaystyle{7}</math>, <math>\displaystyle{7(a_n-1)}</math> is a perfect square. Therefore <math>\displaystyle{a_{n}^{6}-7(a_{n}-1)(a_{n}^{2}-a_{n}+1)^{2}}</math> is a difference of squares and thus composite, i.e. it is divisible by <math>\displaystyle{2}</math> primes. By assumption, <math>\displaystyle{a_n}</math> is divisible by <math>\displaystyle{2n + 3}</math> primes. Thus <math>\displaystyle{a_{n+1}}</math> is divisible by <math>\displaystyle{2+ (2n + 3) = 2(n+1) + 3}</math> primes as desired.
+
{{alternate solutions}}
  
 
== See also ==
 
== See also ==
 +
* <url>viewtopic.php?t=145849 Discussion on AoPS/MathLinks</url>
 +
 
{{USAMO newbox|year=2007|num-b=4|num-a=6}}
 
{{USAMO newbox|year=2007|num-b=4|num-a=6}}
  
−
[[Category:Olympiad Algebra Problems]]
+
[[Category:Olympiad Number Theory Problems]]
 +
{{MAA Notice}}

Latest revision as of 08:47, 7 August 2014

Problem

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

Solutions

Solution 1

The proof is by induction. The base is provided by the $n = 0$ case, where $7^{7^0} + 1 = 7^1 + 1 = 2^3$. To prove the inductive step, it suffices to show that if $x = 7^{2m - 1}$ for some positive integer $m$ then $(x^7 + 1)/(x + 1)$ is composite. As a consequence, $x^7 + 1$ has at least two more prime factors than does $x + 1$. To confirm that $(x^7 + 1)/(x + 1)$ is composite, observe that \begin{align*} \frac{x^7 + 1}{x + 1} &= \frac{(x + 1)^7 - ((x + 1)^7 - (x^7 + 1))}{x + 1} \\ &= (x + 1)^6 - \frac{7x(x^5 + 3x^4 + 5x^3 + 5x^2 + 3x + 1)}{x + 1} \\ &= (x + 1)^6 - 7x(x^4 + 2x^3 + 3x^2 + 2x + 1) \\ &= (x + 1)^6 - 7^{2m}(x^2 + x + 1)^2 \\ &= \{(x + 1)^3 - 7^m(x^2 + x + 1)\}\{(x + 1)^3 + 7^m(x^2 + x + 1)\}. \end{align*} Also each factor exceeds 1. It suffices to check the smaller one; $\sqrt{7x}\leq x$ gives \begin{align*} (x + 1)^3 - 7^m(x^2 + x + 1) &= (x + 1)^3 - \sqrt{7x}(x^2 + x + 1) \\ &\geq x^3 + 3x^2 + 3x + 1 - x(x^2 + x + 1) \\ &= 2x^2 + 2x + 1\geq 113 > 1. \end{align*} Hence $(x^7 + 1)/(x + 1)$ is composite and the proof is complete.

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

See also

  • <url>viewtopic.php?t=145849 Discussion on AoPS/MathLinks</url>
2007 USAMO (Problems • Resources)
Preceded by
Problem 4 		Followed by
Problem 6
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_USAMO_Problems/Problem_5&oldid=62813"