Part proof of Goldbach Conjecture

This post is a trannslate of my old post.

Part proof.

Let we take a prime p towards a primorial mPn♯.

（ｐ、ｍPｎ♯）＝１
ｐ－ｍPｎ♯＜０
ｍ is not multiple of a P（ｎ＋１）

Here,

pーmPn♯＝－A is inside of the abolute value of  (P（ｎ＋１）)^2,

Then ーA is prime.

Proof

If this is not prime,then  a composite.

Because,ーA inside of (P（ｎ＋１)）＾２

ーA has a prime factor ,which 2,3,5,7,・・・Pn.

We transpose mPn♯,p became composite,

This is a contradiction

So p is prime.

Then,

p＋A＝mPn♯.