Conjecture 23. A conjecture based on Brocard’s Conjecture

Between P^n and (P+2x)^n where n is equal to the difference of P+2x and P where P and P+2x are both prime , m being greater than zero there is at least P+2x – P primes.

For example suppose P=3 then x=1 and n=2.

Then 3, 3+2(1)=3,5

5-3=2

Now we will find that they are at least two such primes.

3^2=9

5^2=25

The primes are 11,13,17,19, and 23.

Proving that there is at least two primes.

https://en.wikipedia.org/wiki/Brocard%27s_conjecture

http://mathworld.wolfram.com/BrocardsConjecture.html

As always I welcome the readers to prove or disprove this conjecture.

Thank You

Nunghead