This action might not be possible to undo. Are you sure you want to continue?

Moutaoikil-Ripà’s conjecture on Prime Numbers: ∀ p0≥7, p0=2∙p1+p2

**Marco Ripà (July 2013)
**

sPIqr Society, Rome, Italy Email: marcokrt1984@yahoo.it

Abstract

An original result about prime numbers and unproved conjectures. We show that, if the Goldbach conjecture is true, every prime number greater than 7 can be expressed as the sum of an odd prime plus twice another (different) odd prime. A computational analysis shows that the conjecture is true (at least) for primes below 7465626013.

1. Introduction

A few days ago, we discovered a quite strange, new, conjecture involving prime numbers [http://vixra.org/pdf/1307.0081v1.pdf]. It remembered us the very famous Goldbach’s conjecture (by Christian Goldbach and Leonard Euler). The statement is as follows: Moutaoikil-Ripà’s Conjecture. For every prime number p0≥7, we have that p0=2∙p1+p2 (where p1 and p2 are both primes and p1≠p2).

2

**2. An incomplete proof (assuming Goldbach’s strong conjecture as true)
**

Let us consider a base 10 scenario and let us assume Goldbach’s strong conjecture as true, we can see that we have just two cases to analyze (p1=2 or p1>2). In fact, p0=2∙n+1 2∙p1+p2 is odd only if p2 is odd (p1 is the only prime which can be 2). Let us assume p1≠2, we would like to show that, assuming Goldbach’s conjecture as true, the new conjecture is true as well (for any p0≥11). It is trivial that, if p0=7, there is only one possible solution (but there is one!) and it is 7:=2∙2+3.

We have the following constraints:

{

min[p1+p2]=3+5=8 min[2∙n]=8 min[n]=4.

Thus p0-p1≥8 min[p0] such that p1=2 min[p0]=11 (because 11=8+3). p0=2∙p1+p2 p0-p1=p1+p2. But Goldbach said that 2∙n=p1+p2, where (in our case) n is an element } and p1+p2≥8. of ℕ\{ The new relation we have to “prove” is easy now: p0-p1 is the difference between two odd primes it is even (p0-p1≥8), as we have already shown… and, on the other side of the “=”, there is the sum of two distinct primes? Goldbach? Unfortunately, not. We still need to prove that, ∀p0>5, there } set from the new conjecture and { } is (at least) one common element between the { from the strong Goldbach conjecture. Moreover, we need to point out that we are searching for p1≠p2 solutions only. With specific regard to the last point, we can see that, for every value of n we are considering (n≥4), the partition number of 2∙n is ≥2 (so we have at least one solution of the form p1≠p2).

3

3. A computational analysis

Emanuele Dalmasso wrote a specific program to test the new conjecture for “small” values of p0: the test has shown that the conjecture is right for any 7≤p0≤746562601 (746562601=2∙7+746562587). p0 can be written in many different ways (for 11≤p0): you can see this just looking at the figure below (the number of ways such that p0:=2∙p1+p2 is shown on the vertical axis).

4. Conclusion

Moutaoikil-Ripà’s conjecture mainly differs from Lemoine’s one for the additional constraint p1≠p2. A corollary of the “proof” of the new conjecture is that, for every p0≥11, p0=2∙p1+p2, where p1>2 (p1≠p2 are both odd primes). Lemoine’s conjecture involves any odd number above 3, while Moutaoikil-Ripà’s conjecture concerns only odd primes above 5. This is an important difference: for example, considering n=7 2∙n+1=15, we can see that the corollary stated above would be wrong. In fact, the following constraints would be taken into account: p1≠p2 and p1≠2. Therefore 15 cannot be written as 2∙2+11, nor 2∙5+5. Thus, there is no solution for n=7 and a corollary of the Moutaoikil-Ripà’s conjecture could not be satisfied.

4

Appendix

Basing on the Lemoine-Levy partition number development [http://arxiv.org/pdf/0901.3102v2.pdf], my second conjecture is as follows (a stronger version on the Lemoine’s conjecture): Ripà’s Conjecture. For every odd number 2∙n+1≥17 (∀ 8≤n ∈ ℕ), there is (at least) a couple of odd primes, p1≠p2, such that 2∙n+1=2∙p1+p2. A sufficient but not necessary condition to prove this conjecture is that the partition number can be proved to be (strictly) greater than 2, for every n≥8.

- Tesina Esame di Stato - Marco Ripà
- ENSDT 20 - OFFICIAL IQ TEST (by Marco Ripà)
- Congetture risolte
- ENSDT Prototype Untimed Second Norm
- Second Interview for the Chilean World Intelligence Network (Marco Ripà, May 31 2013).
- Massimo punteggio possibile a 2048 (popolare gioco creato da Gabriele Cirulli)
- 2048
- IQF Rating
- ENSDT Prototype Untimed First Norm
- ENSDT IQ Test Untimed
- ENSDT Prototype (Timed) Norm
- ENSDT Free Preview
- Best Upper Bound Currently Discovered for the 4x4x4 Points Puzzle and for the 5x5x5 Points One
- 4 points, 3 lines... how many patterns?
- Soluzioni per le congetture A1, A3 ed F1 del libro di quesiti aperti
- Arrows
- ARROWS
- Best upper bound currently available for the 5x5x5 points problem.
- The Rectangular Spiral Solution for n1Xn2X(Strict Final)
- X-Test (the IQ test for the high range) Finally Revealed
- Il Nine Dots Puzzle Esteso a n1 X n2 X ... X nk Punti (Lower Bound e Soluzione Completa)
- Nine Dots Puzzle Extended to nXnX…Xn Points
- Appendice 5 paper sui puntini...
- Il Nine Dots Puzzle Esteso a nXnXn(v)

Every prime number above 5 can be written as the sum of a prime and the double of another (different) prime.
If Goldbach's conjecture is true, the new conjecture should be true as well.

Every prime number above 5 can be written as the sum of a prime and the double of another (different) prime.

If Goldbach's conjecture is true, the new conjecture should be true as well.

If Goldbach's conjecture is true, the new conjecture should be true as well.

- IQF Rating
- Best upper bound currently available for the 5x5x5 points problem.
- On prime factors in old and new sequences of integers
- ENSDT IQ Test Untimed
- Extended 9 Dots Puzzle to nxnx...xn Dots
- Retro-analitical Reasoning IQ tests for the High Range.
- My Personal IQ Profile
- X-Test (the IQ test for the high range) Finally Revealed
- ENNDT
- Number Series Problem
- Form 1 - Chapter 2
- THE SEMILATTICE WITH CONSISTENT RETURN
- List of Perfect Numbers
- Reasoning Odd One Out 2 Kanishk@Mail
- Smarandache Concatenated Magic Squares
- Cool Trick
- Mathematical Mysteries
- factors and multiples. class VI
- Problems
- Generalized Andrica Conjecture
- Smarandache Factors and Reverse Factors
- Dong Report
- Primality Testing
- slides23-lazy1.pdf
- Exercises - Set Theory - Answer Key
- 4 – Math Homework 10.28– 11.01.2013 Original & Modified
- Elmo Benedetto
- saadsa.txt
- THE PROBLEM OF LIPSCHITZ CONDITION
- The Landau's prime numbers and the Legendre's conjecture
- Moutaoikil/Ripà's conjecture on prime numbers

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd