## Generalized Conjecture on the Distribution of Prime Numbers

**Authors:** Réjean Labrie

Abstract: Let N, n and k be integers larger than 1. Then for all N there exists a minimum threshold k such that for n>=N, if we cut the sequence of consecutive integers from 1 to n*(n+k) into n+k slices of length n, we always find at least a prime number in each slice.
It follows that π(n*(n+k)) > π(n*(n+k-1)) > π(n*(n+k-2)) > π(n*(n+k-3))> ...> π(2n)> π(n) where π(n) is the quantity of prime numbers smaller than or equal to n.

**Comments:** 6 Pages.

**Download:** **PDF**

### Submission history

[v1] 2018-02-13 22:51:29

[v2] 2018-02-14 09:08:19

**Unique-IP document downloads:** 23 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.*

*
*