A Korselt Characterization of Carmichael Numbers of the Form (aCn+1)(aCn+1+1)(aCn+2+1)
Hayat Bensella
Abstract
We study products \[ N=(aCn+1)(aCn+1+1)(aCn+2+1), \] where (Cn) is the Lucas--balancing sequence. Under the assumption that all three factors are prime, we give a necessary and sufficient condition for N to be a Carmichael number: this happens precisely when n is even and a=kCn+1 for a positive integer k satisfying \[ 48k 7CnCn+2. \] We derive further congruence restrictions, an explicit parametrization of the integer solutions of the resulting congruence, a lower bound for k, 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.
Create a lesson
Related papers
Rational points on loxodromic K3 surfaces and complex dynamics
Damián Gvirtz-Chen, Zhizhong Huang, Zhuchao Ji et al.
Ramanujan-type congruences for the smallest parts function
Larry Rolen
Some instances of modularity for residually reducible representations in the mixed case
Luis V. Dieulefait
Classification of torsion of elliptic curves over sextic fields
Filip Najman
A generalization of the Dirichlet approximation theorem for affine actions on the real line
Mohammad Javaheri
On ill-distributed B3 and B4 sets
André Hisatsuga, Rafael Miyazaki, Cosmin Pohoata