Generalizations of Carmichael numbers I
Romeo Me\v{s}trovi\'c

TL;DR
This paper introduces weak Carmichael numbers, explores their properties, provides computational data, and discusses their implications for primality testing and related conjectures.
Contribution
It characterizes weak Carmichael numbers, establishes their relation to Carmichael numbers, and presents computational results and conjectures about their properties.
Findings
Weak Carmichael numbers satisfy p-1 | n-1 for all prime divisors p.
All Carmichael numbers are also weak Carmichael numbers.
Computationally identified all non-prime power weak Carmichael numbers less than 2 million.
Abstract
A composite positive integer is said to be a {\it weak Carmichael number} if It is proved that a composite positive integer is a weak Carmichael number if and only if for every prime divisor of . This together with Korselt's criterion yields the fact that every Carmichael number is also a weak Carmichael number. In this paper we mainly investigate arithmetic properties of weak Carmichael numbers. Motivated by the investigations of Carmichael numbers in the last hundred years, here we establish several related results, notions, examples and computatinoal searches for weak Carmichael numbers and numbers closely related to weak Carmichael numbers. Furthermore, using the software {\tt Mathematica 8}, we present the table containing all non-prime powers weak Carmichael…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · History and Theory of Mathematics
