Introduction
Carmichael numbers are composite integers N satisfying
aN−1≡1(modN)
for every integer a such that gcd(a,N)=1. By Korselt’s criterion, a composite integer N is a Carmichael number if and only if N is squarefree and
p−1∣N−1
for every prime divisor p of $N.
As a particular case of the Lucas sequences of the first kind, the Jacobsthal sequence {Jm}m≥0 is defined by J0=0, J1=1, and the recurrence relation
Jm=Jm−1+2Jm−2,m≥2.
Its Binet formula is given by
Jm=32m−(−1)m.
where 2 and −1 are the roots of the characteristic equation
P(x)=x2−x−2.
For further information on Jacobsthal numbers and their properties, see [7].
The study of Carmichael numbers has a long history. Alford, Granville, and Pomerance proved that there are infinitely many Carmichael numbers [2]. Subsequent research has investigated their distribution and their occurrence in special arithmetic forms. Banks, Finch, Luca, Pomerance, and Stănică studied Sierpiński and Carmichael numbers [3], while Cilleruelo, Luca, and Pizarro examined Carmichael numbers in sequences of the form (2nk+1)n≥1 [4]. Other contributions have addressed the density of related arithmetic sets [5], the distribution of primes in short intervals [8], and the impossibility of certain types of Carmichael numbers [9]. More recently, Alahmadi and Luca proved that no Carmichael number can be of the form 2np+1, where p is prime [1].
Motivated by these investigations, we consider integers constructed from three consecutive terms of the Jacobsthal sequence.
We study integers of the form
N=(2mJn+1)(2mJn+1+1)(2mJn+2+1),
where m,n≥1.
Our main result establishes that, whenever all three factors are prime, their product cannot be a Carmichael number.
Theorem 1. Let
N=(2mJn+1)(2mJn+1+1)(2mJn+2+1),
where
Jk=32k−(−1)k,m,n≥1.
If all three factors are prime, then N is not a Carmichael number.
Preliminaries
The Jacobsthal numbers satisfy
J1=1,J2=1,Jk+2=Jk+1+2Jk.
Lemma 1. For every k≥1, Jk is odd.
Proof. Since 2k is even and (−1)k=±1, the numerator 2k−(−1)k is odd. As 3 is odd, Jk is odd. □
Lemma 2. For every k≥1,
gcd(Jk,Jk+1)=1andgcd(Jk,Jk+2)=1.
Proof. The recurrence Jk+2=Jk+1+2Jk gives
gcd(Jk,Jk+1)=gcd(Jk,Jk+1+2Jk)=gcd(Jk,Jk+2).
Also,
Jk+1=Jk+2Jk−1,
so
gcd(Jk,Jk+1)=gcd(Jk,2Jk−1).
By Lemma 1, Jk is odd, hence
gcd(Jk,Jk+1)=gcd(Jk,Jk−1).
Iterating and using J1=1, we obtain gcd(Jk,Jk+1)=1. Therefore also gcd(Jk,Jk+2)=1. □
Theorem 2 (Korselt’s criterion). [6] A composite integer N is a Carmichael number if and only if N is squarefree and
p−1∣N−1 for every prime divisor p of $N.
Proof of Theorem 1
Applying Korselt’s criterion to the three prime factors of N, we obtain the following necessary divisibility conditions.
Lemma 3. Assume that
N=(2mJt+1)(2mJt+1+1)(2mJt+2+1) is a Carmichael number, where m,t≥1 and the three factors are prime. Then
Jt∣(−1)t2m+2, Jt+1∣3−(−1)t2m, Jt+2∣1−(−1)t2m−1.
Proof. Let
p1=2mJt+1,p2=2mJt+1+1,p3=2mJt+2+1.
Since N is Carmichael, it is squarefree, and Korselt’s criterion gives
pi−1∣N−1(i=1,2,3).
Set
k1=Jt,k2=Jt+1,k3=Jt+2.
Then
N−1=2m(k1+k2+k3)+22m(k1k2+k1k3+k2k3)+23mk1k2k3.
By Lemma 1, each ki is odd. Hence gcd(2m,ki)=1. Therefore ki∣N−1 is equivalent to the condition obtained after dividing by 2m:
k1k2k3∣(k2+k3)+2mk2k3,∣(k1+k3)+2mk1k3,∣(k1+k2)+2mk1k2.
We use the recurrence
Jt+2=Jt+1+2Jt.
First condition:
Modulo Jt, we have Jt+2≡Jt+1. Hence
(Jt+1+Jt+2)+2mJt+1Jt+2≡2Jt+1+2mJt+12=Jt+1(2mJt+1+2)(modJt).
Thus
Jt∣Jt+1(2mJt+1+2).
By Lemma 2, gcd(Jt,Jt+1)=1, so
Jt∣2mJt+1+2.(1)
Second condition:
Modulo Jt+1, the recurrence gives
2Jt=Jt+2−Jt+1≡Jt+2.
Multiplying the second divisibility condition by 2, which preserves divisibility, gives
Jt+1∣2(Jt+Jt+2)+2m+1JtJt+2.
Using 2Jt≡Jt+2(modJt+1), we obtain
2(Jt+Jt+2)+2m+1JtJt+2=3Jt+2+2mJt+22=Jt+2(2mJt+2+3)(modJt+1).
Hence
Jt+1∣Jt+2(2mJt+2+3).
By Lemma 2, gcd(Jt+1,Jt+2)=1, so
Jt+1∣2mJt+2+3.(2)
Third condition:
Modulo Jt+2, the recurrence gives
Jt+1=Jt+2−2Jt≡−2Jt.
Therefore
(Jt+Jt+1)+2mJtJt+1≡Jt−2Jt+2mJt(−2Jt)=−Jt(1+2m+1Jt)(modJt+2).
Thus
Jt+2∣Jt(2m+1Jt+1).
By Lemma 2, gcd(Jt,Jt+2)=1, so
Jt+2∣2m+1Jt+1.(3)
Binet translation:
Let ε=(−1)t. Then
3Jt=2t−ε,3Jt+1=2t+1+ε,3Jt+2=2t+2−ε.
From (1),
Jt∣2mJt+1+2.
Multiplying by 3,
2t−ε∣2m+t+1+ε2m+6.
Since 2t≡ε(mod2t−ε),
2m+t+1+ε2m+6≡ε2m+1+ε2m+6=3(ε2m+2).
Hence
2t−ε∣3(ε2m+2).
Since 2t−ε=3Jt, dividing by 3 gives
Jt∣ε2m+2.(4)
From (2),
Jt+1∣2mJt+2+3.
Multiplying by 3,
2t+1+ε∣2m+t+2−ε2m+9.
Since 2t+1≡−ε, we have 2t+2≡−2ε. Therefore
2m+t+2−ε2m+9≡−3ε2m+9=3(3−ε2m).
Thus
2t+1+ε∣3(3−ε2m).
Since 2t+1+ε=3Jt+1, dividing by 3 gives
Jt+1∣3−ε2m.(5)
From (3),
Jt+2∣2m+1Jt+1.
Multiplying by 3,
2t+2−ε∣2m+t+1−ε2m+1+3.
Since 2t+2≡ε, we have
2m+t+1−ε2m+1+3≡ε2m−1−ε2m+1+3=3(1−ε2m−1).
Thus
2t+2−ε∣3(1−ε2m−1).
Since 2t+2−ε=3Jt+2, dividing by 3 gives
Jt+2∣1−ε2m−1.(6)
This proves the lemma. □
We are now ready to prove Theorem 1.
Suppose, for contradiction, that N is a Carmichael number. By Lemma 3, with t=n and ε=(−1)n, we have
Jn∣ε2m+2,(7)
Jn+1∣3−ε2m,(8)
Jn+2∣1−ε2m−1.(9)
We first show that n≤4. Assume n≥5, and write
m=qn+r,0≤r<n.
First divisibility
By the first divisibility condition (7),
Jn∣ε2m+2,ε=(−1)n.
Since
3Jn=2n−ε,
we obtain
2n−ε∣3(ε2m+2).
Write
m=qn+r,q≥0,0≤r<n,
and set
σ=εq+1∈{−1,1}.
As 2n≡ε(mod2n−ε), we have
2m≡εq2r(mod2n−ε).
Consequently,
2n−ε∣3(σ2r+2).
Furthermore,
∣3(σ2r+2)∣≤3(2r+2)≤3(2n−1+2)<2(2n−ε),
for n≥5. Hence there exists δ∈{−1,0,1} such that
3(σ2r+2)=δ(2n−ε).(10)
If r=0, then
3(σ+2)∈{3,9},
whereas 2n−ε≥31. This contradicts (1). Therefore r≥1.
We next prove that δ=±1. Suppose first that δ=1. Then
3(σ2r+2)=2n−ε.
If σ=1, we obtain
3⋅2r+6=2n−ε,
and thus
2r(2n−r−3)=6+ε.
This is impossible because the left-hand side is even, whereas 6+ε∈{5,7} is odd.
If σ=−1, then
6−3⋅2r=2n−ε,
which gives
2r(3+2n−r)=6+ε.
Again, the left-hand side is even and the right-hand side is odd, a contradiction.
Suppose now that δ=−1. Equation (1) becomes
3(σ2r+2)=−(2n−ε).
If σ=1, the left-hand side is positive and the right-hand side is negative, which is impossible.
If σ=−1, we have
6−3⋅2r=−2n+ε,
so
2r(3−2n−r)=6−ε.
This is impossible because the left-hand side is even, whereas 6−ε∈{5,7} is odd.
Therefore δ=0. Equation (1) reduces to
σ2r+2=0.
Since r≥1 and σ∈{−1,1}, it follows that
r=1,σ=−1.
Finally, σ=εq+1=−1 implies ε=−1. Hence n is odd.
Second divisibility
Because n is odd, ε=−1. Thus (8) becomes
Jn+1∣3+2m.
Since n is odd,
3Jn+1=2n+1−1.
Multiplying by 3, we get
2n+1−1∣3(3+2m).
Write
m=q′(n+1)+s,0≤s≤n.
Since 2n+1≡1(mod2n+1−1), we have 2m≡2s. Hence
2n+1−1∣3(3+2s).(11)
Now
0<3(3+2s)≤3(3+2n)<2(2n+1−1)
for n≥5. Therefore the quotient in (11) is a positive integer strictly smaller than 2, hence equal to 1. Thus
3(3+2s)=2n+1−1,
or equivalently,
2n+1=3⋅2s+10.(12)
We show that (12) is impossible.
If s=0, then 2n+1=13, impossible.
If s=1, then 2n+1=16, so n=3, contradicting n≥5.
If s≥2, then
3⋅2s+10≡2(mod4), whereas
2n+1≡0(mod4), impossible.
Therefore n≤4.
Small cases
It remains to check n=1,2,3,4.
Case n=1
We have
J1=1,J2=1.
Hence the first two factors of N are equal:
2mJ1+1=2mJ2+1.
Thus N is not squarefree, contradicting the fact that every Carmichael number is squarefree.
Case n=2
Here ε=1, and (8) gives
J3=3∣3−2m.
But
3−2m=−2m=0(mod3),
since 3∤2m. Contradiction.
Case n=3
Here ε=−1. From (7),
J3=3∣−2m+2,
so
2m≡2(mod3).
Hence m is odd.
From (9),
J5=11∣1+2m−1.
Thus
2m−1≡−1(mod11).
Since ord11(2)=10 and 25≡−1(mod11), we get
m−1≡5(mod10).
Therefore
m≡6(mod10),
so m is even, contradicting that m is odd.
Case n=4
Here ε=1. From (7),
J4=5∣2m+2,
so
2m≡3(mod5).
Since ord5(2)=4 and 23≡3(mod5), we get
m≡3(mod4).
In particular, m is odd.
From (8),
J5=11∣3−2m,
so
2m≡3(mod11).
Since ord11(2)=10 and 28≡3(mod11), we get
m≡8(mod10).
In particular, m is even, contradicting that m is odd.
All cases lead to a contradiction. Therefore no integer N of the stated form, with m,n≥1 and all three factors prime, is a Carmichael number.
Declarations
The author declares that there are no conflicts of interest.