**Authors:** Marius Coman

In this paper I make the following conjecture: For any pair of consecutive primes [p1, p2], p2 > p1 > 43, p1 and p2 having the same number of digits, there exist a prime q, 5 < q < p1, such that the number n obtained concatenating (from the left to the right) q with p2, then with p1, then again with q is prime. Example: for [p1, p2] = [961748941, 961748947] there exist q = 19 such that n = 1996174894796174894119 is prime. Note that the least values of q that satisfy this conjecture for twenty consecutive pairs of consecutive primes with 9 digits are 19, 17, 107, 23, 131, 47, 83, 79, 61, 277, 163, 7, 41, 13, 181, 19, 7, 37, 29 and 23 (all twenty primes lower than 300!), the corresponding primes n obtained having 20 to 24 digits! This method appears to be a good way to obtain big primes with a high degree of ease and certainty.

**Comments:** 4 Pages.

**Download:** **PDF**

[v1] 2017-01-08 11:02:17

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

**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. *