Authors: Marius Coman
In this paper I make the following observation: the number n = p – q, where p and q are Poulet numbers, needs very few iterations of “reverse and add” to reach a palindrome. For instance, taking q = 1729 and p = 999986341201, it can be seen that only 3 iterations are needed to reach a palindrome: n = 999986341201 – 1729 = 999986339472 and we have: 999986339472 + 274933689999 = 1274920029471; 1274920029471 + 1749200294721 = 3024120324192 and 3024120324192 + 2914230214203 = 5938350538395, a palindromic number. So, relying on this, I conjecture that there exist an infinity of n, even considering q and p successive, that need just one such iteration to reach a palindrome (see sequence A015976 in OEIS for these numbers) and I also conjecture that there is no a difference between two Poulet numbers to be a Lychrel number.
Comments: 2 Pages.
[v1] 2018-01-07 17:15:09
Unique-IP document downloads: 8 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.