MathDB

E 37

Source:

May 25, 2007

inductionfloor function

Problem Statement

It's known that there is always a prime between

n

and

2n-7

for all

n \ge 10

. Prove that, with the exception of

1

,

4

, and

6

, every natural number can be written as the sum of distinct primes.