WorksMathematics
A Korselt Characterization of Carmichael Numbers of the Form
Abstract
We study products where is the Lucas–balancing sequence. Under the assumption that all three factors are prime, we give a necessary and sufficient condition for to be a Carmichael number: this happens precisely when is even and for a positive integer satisfying We derive further congruence restrictions, an explicit parametrization of the integer solutions of the resulting congruence, a lower bound for , and a divisibility relation involving the middle prime factor. The characterization is conditional on the primality of the three factors and does not assert that such prime triples exist for infinitely many parameters.
Introduction
A composite positive integer is called a Carmichael number if
for every integer relatively prime to . We use Korselt’s criterion: a composite positive integer is a Carmichael number if and only if it is square-free and for every prime divisor of .
The Lucas–balancing numbers were introduced by Panda [11] in terms of the balancing numbers , originally studied by Behera and Panda [4]. They are defined by and satisfy the recurrence
Carmichael numbers have been studied since the early works of Korselt [8] and Carmichael [5]. Erdős and Odlyzko [7] investigated the density of odd integers related to primes and powers of 2. A major breakthrough came with Alford, Granville, and Pomerance [2], who proved that infinitely many Carmichael numbers exist. Subsequent studies have addressed their distribution and arithmetic properties. Harman [9] investigated their counting function, while Wright [12] established nonexistence results for certain classes of Carmichael numbers. Further contributions include the work of Banks et al. [3] and Cilleruelo, Luca, and Pizarro [6]. More recently, Alahmadi and Luca [1] proved that no Carmichael number can be of the form , where is prime. Advances in computational enumeration were reported by Shallue and Webster [10].
In this paper, we apply Korselt’s criterion to products of three consecutive terms of the Lucas–balancing sequence. Throughout, we consider
assuming that all three factors are prime. Our main result gives an exact characterization of when is a Carmichael number.
Theorem 1. Let , and suppose that
are prime. Then
is a Carmichael number if and only if is even and there exists an integer such that
In particular, odd indices are impossible under the three-prime assumption.
Elementary identities
We establish several elementary properties of the sequence.
Lemma 1. The sequence consists of positive odd integers and is strictly increasing.
Proof. The initial terms satisfy . If , then
Positivity and strict increase follow by induction. Both initial terms are odd, and the recurrence shows that every subsequent term is odd. □
Lemma 2. For every ,
and
Proof. The recurrence gives
Since , the first assertion follows.
For the second assertion, put
Using , we obtain
Hence is constant. Since ,
Lemma 3. For every ,
Moreover,
Proof. Modulo 3, the recurrence becomes
Starting from and , we obtain
By Lemma 2,
Since every is odd, the claimed formula follows. □
Lemma 4. For every ,
Proof. The assertions hold for , since and . Assume that
Then, using the recurrence,
and
The result follows by induction. □
Proof of the main theorem
We apply Korselt’s criterion. Since
by Lemma 1, and since , the three assumed prime factors of are distinct. Hence is square-free.
Since the three factors of are distinct primes, is a Carmichael number if and only if
Expanding and collecting terms according to powers of , we obtain
Hence,
For convenience, define
Thus
Since and , Korselt’s criterion is equivalent to
We now derive these divisibility conditions explicitly.
Step 1: The condition involving .
Reducing modulo gives
By the recurrence relation,
so that
It follows that
The consecutive terms are coprime:
Hence
Therefore, the middle divisibility condition in (1) is equivalent to the existence of an integer such that
Step 2: The conditions involving and .
Reducing modulo , all terms containing vanish, and we obtain
Since
we get
As , this yields
Similarly, reducing modulo gives
Using
we obtain
Since , it follows that
Combining (3) and (4), the two outer divisibility conditions are equivalent to
Step 3: The parity of .
The sequence satisfies the identity
Indeed, this identity is Lemma 2.
Substituting from (2) into (5), we find
By (6),
Therefore, (5) is equivalent to
We now show that must be even. By Lemma 3,
If were odd, then both and would be divisible by 3. By (7), this would imply
But
which is impossible. Hence
Step 4: Combining the two congruences.
For even , both and are odd. By Lemma 2,
Since their greatest common divisor is odd, we conclude that
Consequently, the two divisibilities in (7) are equivalent to
This proves the necessity of all the stated conditions.
Step 5: Sufficiency.
Conversely, suppose that is even and that
for some integer .
We prove that all three divisibilities in (1) hold. First, since , the calculation in Step 1 gives
Thus
Next, the congruence in (9), together with identity (6), gives
In particular,
By the equivalences established in Step 2, we obtain
Therefore,
Since , it follows that
The three factors of are distinct primes by hypothesis, so is square-free. Korselt’s criterion now implies that is a Carmichael number. The proof is complete.
Further arithmetic consequences
Lemma 5. For every ,
In particular, for every even ,
Proof. We prove the residue pattern by induction on . For ,
Assume that
where . Then
Thus gives , while gives . Moreover,
because implies . Hence, by induction,
For even , the residues of and are 1 and 17 in some order. Their product is therefore congruent to 17 modulo 48. □
Theorem 2. Under the hypotheses of Theorem 1, if is Carmichael, then
Proof. By Theorem 1, is even, for some integer , and
is an integer. Since , we have ; also . Hence is a positive integer.
By Lemma 5,
Since , we get
As , multiplication by 17 yields
□
Theorem 3 (Divisibility restriction on the middle prime). Under the hypotheses of Theorem 1, suppose that is Carmichael. Put
where . Then
and
In particular, the quotient on the left is a positive integer.
Proof. By Theorem 1, we have
The identity
gives
Since , we obtain . Dividing the displayed identity by yields
The quotient is positive because and .
Corollary 1. Under the hypotheses of Theorem 2,
and
Proof. By Theorem 2, the integer
is positive and congruent to 25 modulo 48. Hence . Thus
Rearranging gives the first inequality; the second follows from .
Theorem 4. Fix an even integer and put
Every positive integer satisfying
has the form
Among these values, is even if and only if
Proof. By Lemma 5, . Hence
so
is a positive integer. Moreover,
If , then
for some integer . Reducing modulo shows that , so for an integer . It follows that
Since , positivity of is equivalent to .
Finally, is odd, so
Thus is even if and only if , as claimed. This parametrizes the positive integer solutions of the congruence only; the primality of the three corresponding factors must still be checked separately.
Proposition 1 (Further congruence restrictions). If is Carmichael under the hypotheses of Theorem 1, then its prime factors satisfy
and the two outer factors satisfy
Proof. Theorem 1 gives with even. By Lemma 3, , so . Also, must be even: if it were odd, then each would be an even integer greater than 2, contradicting primality. Thus and
Since is even, Lemma 4 gives . Therefore
Corollary 2. Under the three-prime assumption, if is a positive power of 2, then is not Carmichael.
Proof. Theorem 1 requires . But is odd and greater than 1 for , so it cannot divide a power of 2. □
An explicit example
Take . Then
and
The congruence is equivalent to
Since must be even, we may write
Taking gives
The corresponding factors are
For this example, the divisibility quotient is
and , as required by Theorem 2. The primality of the three displayed factors is verified in Appendix § 6. This computation concerns only the particular example and is not used in the proof of Theorem 1.
Verification of the example
For reproducibility, the primality of the three factors in § 5 can be checked using the following Python/SymPy commands:
from sympy import isprime
p0 = 12010312117
p1 = 69942405853
p2 = 407644122997
assert isprime(p0)
assert isprime(p1)
assert isprime(p2)
This verifies the primality claims in the displayed example. It does not form part of the proof of the main theorem.
Declarations
Conflict of interest. The author declares that there is no conflict of interest.
References
- [1]A. Alahmadi and F. Luca, “There are no Carmichael numbers of the form 2^n p + 1 with p prime,” Comptes Rendus Mathématique, vol. 360, pp. 1177–1181, 2022.DOI
- [2]W. R. Alford, A. Granville, and C. Pomerance, “There are infinitely many Carmichael numbers,” Annals of Mathematics, vol. 139, no. 3, pp. 703–722, 1994.DOI
- [3]W. D. Banks, C. Finch, F. Luca, C. Pomerance, and P. Stănică, “Sierpiński and Carmichael numbers,” Transactions of the American Mathematical Society, vol. 367, no. 1, pp. 355–376, 2015.DOI
- [4]A. Behera and G. K. Panda, “On the square roots of triangular numbers,” The Fibonacci Quarterly, vol. 37, no. 2, pp. 98–105, 1999.
- [5]R. D. Carmichael, “Note on a new number theory function,” Bulletin of the American Mathematical Society, vol. 16, no. 5, pp. 232–238, 1910.DOI
- [6]J. Cilleruelo, F. Luca, and A. Pizarro, “Carmichael numbers in the sequence (2^k + 1)n≥1,” Mathematics of Computation, vol. 85, no. 297, pp. 357–377, 2016.
- [7]P. Erdős and A. M. Odlyzko, “On the density of odd integers of the form (p − 1)2−n and related questions,” Journal of Number Theory, vol. 11, pp. 257–263, 1979.DOI
- [8]A. Korselt, “Problème chinois,” L’Intermédiaire des Mathématiciens, vol. 6, pp. 142–143, 1899.
- [9]G. Harman, “On the number of Carmichael numbers up to x,” Bulletin of the London Mathematical Society, vol. 37, no. 5, pp. 641–650, 2005.DOI
- [10]A. Shallue and J. Webster, “Advances in tabulating Carmichael numbers,” Research in Number Theory, vol. 11, no. 1, article 8, 2025. doi: 10.1007/s40993-024-00598-3.DOI
- [11]G. K. Panda, “Some fascinating properties of balancing numbers,” Proceedings of the Eleventh International Conference on Fibonacci Numbers and Their Applications, pp. 185–189, 2009.
- [12]T. Wright, “The impossibility of certain types of Carmichael numbers,” Integers, vol. 12, no. 5, pp. 951–964, 2012.DOI