MathDB

E 7

Source:

May 25, 2007

modular arithmeticEulerpen

Problem Statement

Show that there exists a positive integer

k

such that k \cdot 2^{n} \plus{} 1 is composite for all

n \in \mathbb{N}_{0}