![]() |
Carmichael Numbers II
A CONJECTURE
Let N = p1p2....pr The necessary and sufficient condition for N, an r-factor composite number, to be a Carmichael Number: (p1-1)(N-1)^(r-2)/ (p2-1)(P3-1)....(pr-1), (p2-1)(N-1)^(r-2)/ (p1-1)(p3-1)... (pr-1), . . . (pr-1)(N-1)^(r-2)/(p1-1)......... (p(r-1)-1) should ALL be integers. A.K. Devaraj |
Carmichael Numbers II
I would be surprised if anyone can show a counter example.
Devaraj |
All times are UTC. The time now is 00:43. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.