OFFSET
1,1
COMMENTS
Theorem (an analogue of Korselt's criterion).
For a composite number n the following statements are equivalent:
(1) n is a 2-Carmichael number,
(2) for any prime divisor p of n, (p-1)*(p+1) | n*(n-1)*(n+1).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Eugene Karolinsky and Dmytro Seliutin, Carmichael numbers for GL(m), arXiv:2001.10315 [math.NT], 2020.
MATHEMATICA
twoCarmQ[n_] := CompositeQ[n] && AllTrue[FactorInteger[n][[;; , 1]], Divisible[(n - 1)*n*(n + 1), #^2 - 1] &]; Select[Range[360], twoCarmQ] (* Amiram Eldar, Dec 29 2020 *)
PROG
(PARI) is(m) = {my(f=factor(m)[, 1], t=m*(m^2-1)); !isprime(m+(m<2)) && !sum(i=1, #f, t%(f[i]^2-1)); } \\ Jinyuan Wang, Jul 29 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Dmytro Seliutin, Jul 29 2020
EXTENSIONS
More terms from Jinyuan Wang, Jul 29 2020
STATUS
approved