## Elementary Proof Grimm's Conjecture

**Authors:** Stephen Marshall

In mathematics, and in particular number theory, Grimm's Conjecture (named after Karl Albert Grimm) states that to each element of a set of consecutive composite numbers one can assign a distinct prime that divides it. It was first published in American Mathematical Monthly, 76(1969) 1126-1128.
The Formal statement defining Grimm’s Conjecture, still unproved, is as follows:
Suppose n + 1, n + 2, …, n + k are all composite numbers, then there are k distinct primes pi such that pi divides n + i for 1 ≤ i ≤ k.

**Comments:** 3 Pages.

**Download:** **PDF**

### Submission history

[v1] 2017-02-22 16:09:30

**Unique-IP document downloads:** 76 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary.
In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution.
Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*