Number Theory


A Set of Poulet Numbers Defined by an Interesting Relation Between Their Prime Factors

Authors: Marius Coman

In this paper I make the following conjecture on Poulet numbers: There exist an infinity of Poulet numbers P2 obtained from Poulet numbers P1 in the following way: let d1 and dn be the least respectively the largest prime factors of the number P1, where P1 is a Poulet number; than there exist an infinity of Poulet numbers P2 of the form P1 + |P1 – dn^2|*d1, where |P1 – dn^2| is the absolute value of P1 – dn^2. Example: for Poulet number P1 = 1729 = 7*13*19 is obtained through this operation Poulet number P2 = 11305 (1729 – 19^2 = 1368 and 1729 + 1368*7 = 11305). Note that from 11 from the first 30 Poulet numbers (P1) were obtained through this method Poulet numbers (P2).

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2017-11-17 01:34:01

Unique-IP document downloads: 10 times 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. 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.

comments powered by Disqus