1982 USAMO Problems/Problem 4: Difference between revisions
Created page with "== Problem == Prove that there exists a positive integer <math>k</math> such that <math>k\cdot2^n+1</math> is composite for every integer <math>n</math>. == Solution == {{soluti..." |
No edit summary |
||
| Line 7: | Line 7: | ||
== See Also == | == See Also == | ||
{{USAMO box|year=1982|num-b=3|num-a=5}} | {{USAMO box|year=1982|num-b=3|num-a=5}} | ||
{{MAA Notice}} | |||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
Revision as of 18:13, 3 July 2013
Problem
Prove that there exists a positive integer 
such that 
is composite for every integer 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1982 USAMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America. 
