# 1982 USAMO Problems/Problem 4

## Problem

Prove that there exists a positive integer $k$ such that $k\cdot2^n+1$ is composite for every integer $n$.

## Solution 1

Let $p$ be a prime number that divides $2^y-1$ and $x$ be a whole number less than $y$ such that $$k\equiv -1\cdot2^{y-x}\pmod{p}$$ If $n-x$ is a multiple of $y$, then, for some integer $r$, $$k\cdot2^{n}\equiv-1\cdot2^{y-x}\cdot2^{x+ry}\pmod{p}$$ This simplifies to $$k\cdot2^{n} \equiv -1\pmod{p}$$ This implies that $k\cdot2^{n}+1\equiv 0 \pmod{p}$. Thus we conclude that there exists an integer $k$ such that $k\cdot2^{n}+1$ is composite for all integral $n$.

## Solution 2

I claim that $\boxed{k=2935363331541925531}$ works

Consider the primes $3,5,7,17,257,65537,6700417,641$

Note that $$k\equiv 1\text{ (mod }3,5,7,17,257,65537,6700417)$$ and that $$k\equiv -1\text{ (mod }641)$$

Also, $$\text{ord}_3(2)=2$$$$\text{ord}_5(2)=4$$$$\text{ord}_{17}(2)=8$$$$\text{ord}_{257}(2)=16$$$$\text{ord}_{65537}(2)=32$$$$\text{ord}_{6700417}(2)=\text{ord}_{641}(2)=64$$

Take $m$ to be an odd integer.

It is well known (and not hard to prove) that $2^{\frac{\text{ord}_p(2)}{2}\cdot m}\equiv \left(2^{\frac{\text{ord}_p(2)}{2}}\right)^m\equiv -1^m\equiv -1\text{ (mod }p)$

Consider some cases:

When $n\equiv1\text{ (mod }2)\iff n=m$ we have $2^n\cdot k+1\equiv -k+1\equiv 0 \text{ (mod }3)$

When $n\equiv2\text{ (mod }4)\iff n=2m$ we have $2^n\cdot k+1\equiv -k+1\equiv 0 \text{ (mod }5)$

When $n\equiv4\text{ (mod }8)\iff n=4m$ we have $2^n\cdot k+1\equiv -k+1\equiv 0 \text{ (mod }17)$

When $n\equiv8\text{ (mod }16)\iff n=8m$ we have $2^n\cdot k+1\equiv -k+1\equiv 0 \text{ (mod }257)$

When $n\equiv16\text{ (mod }32)\iff n=16m$ we have $2^n\cdot k+1\equiv -k+1\equiv 0 \text{ (mod }65537)$

When $n\equiv32\text{ (mod }64)\iff n=32m$ we have $2^n\cdot k+1\equiv -k+1\equiv 0 \text{ (mod }6700417)$

When $n\equiv0\text{ (mod }64)\iff64\mid n$ we have $2^n\cdot k+1\equiv k+1\equiv 0 \text{ (mod }641)$, since $2^{64}\equiv 1 \text{ (mod }641)$

And furthermore, $k>>3,5,17,257,65537,6700417,641$ so these numbers need be composite.

But this covers all cases; we are done $\Box$