An unusual operation on a set of Poulet numbers which conducts to another set of Poulet numbers
Marius Coman
Abstract
Marius Coman
Abstract
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, d2, ..., dn be the (not distinct) prime factors of the number P1 – 1, where P1 is a Poulet number; than there exist an infinity of Poulet numbers P2 of the form (d1 + 1)*(d2 + 1)*...*(dn + 1) + 1. Example: for Poulet number P1 = 645 is obtained through this operation Poulet number P2 = 1729 (644 = 2*2*7*23 and 3*3*8*24 + 1 = 1729). Note that from more than one Poulet number P1 can be obtained the same Poulet number P2 (from both 1729 and 6601 is obtained 46657).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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, d2, ..., dn be the (not distinct) prime factors of the number P1 – 1, where P1 is a Poulet number; than there exist an infinity of Poulet numbers P2 of the form (d1 + 1)*(d2 + 1)*...*(dn + 1) + 1. Example: for Poulet number P1 = 645 is obtained through this operation Poulet number P2 = 1729 (644 = 2*2*7*23 and 3*3*8*24 + 1 = 1729). Note that from more than one Poulet number P1 can be obtained the same Poulet number P2 (from both 1729 and 6601 is obtained 46657).
Key concepts: Mathematics, Infinity, Number theory, Set (abstract data type), Combinatorics, Computer science, Programming language, Mathematical analysis