Indexed metadata

On Carmichael Numbers Constructed from Consecutive Jacobsthal Numbers

Hayat Bensella

Source record

Source: arXiv

Published: Oct 19, 2026

arXiv: 2610.26065

Open original source ↗

Source abstract

We prove that no Carmichael number has the form N=(2mJn+1)(2mJn+1+1)(2mJn+2+1), N=(2^mJ_n+1)(2^mJ_{n+1}+1)(2^mJ_{n+2}+1), where Jn=2n−(−1)n3 J_n=\frac{2^n-(-1)^n}{3} is the Jacobsthal sequence, m,n≥1m,n\ge1, and all three factors are prime. Assuming that such an NN is Carmichael, Korselt's criterion yields divisibility conditions relating consecutive Jacobsthal numbers to powers of two. Combining these conditions with the Binet formula and a finite case analysis for n≤4n\le4, we obtain a contradiction. Consequently, this family contains no Carmichael numbers.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.