Authors: Marius Coman
In a previous paper I noticed that the numbers n*P + R(P) – n respectively P + n*R(P) - n, where P are Poulet numbers having only odd digits, R(P) the reversals of P and n positive integer, are often primes. In this paper I notice that the same is true for primes having only odd digits (see A030096 in OEIS for a list of such primes). Taken thirteen randomly chosen consecutive primes P having nine (odd) digits (from 971111137 to 971111993) I see that for all of them there exist at least a value of n smaller than 15 for which the number n*P + R(P) – n is prime (for 971111591, for instance, there exist four such values of n: 9, 11, 14, 15; for 971111137 three: 2, 4, 7; for 971111551 also three: 1, 2, 6; for 971111959 also three: 1, 9, 10; for 971111993 also three: 5, 6, 14).
Comments: 2 Pages.
[v1] 2018-02-13 02:20:28
Unique-IP document downloads: 6 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.