Carmichael numbers

2019 ◽  
pp. 549-554
Keyword(s):  
2008 ◽  
Vol 128 (4) ◽  
pp. 910-917 ◽  
Author(s):  
G. Ander Steele
Keyword(s):  

2010 ◽  
Vol 80 (273) ◽  
pp. 437-442
Author(s):  
Zhenxiang Zhang
Keyword(s):  

1977 ◽  
Vol 20 (1) ◽  
pp. 133-143 ◽  
Author(s):  
H. C. Williams

A base a pseudoprime is an integer n such that1A Carmichael number is a composite integer n such that (1) is true for all a such that (a, n ) = l. It was shown by Carmichael [1] that, if n is a Carmichael number, then n is the product of k(>2) distinct primes P1,P2,P3, … Pk, and Pi-1|n-1(i=1, 2, 3, …, k).


2009 ◽  
Vol 52 (1) ◽  
pp. 3-8 ◽  
Author(s):  
W. D. Banks

AbstractLet φ denote the Euler function. In this paper, we show that for all large x there are more than x0.33 Carmichael numbers n ⩽ x with the property that φ(n) is a perfect square. We also obtain similar results for higher powers.


2012 ◽  
Vol 92 (1) ◽  
pp. 45-60 ◽  
Author(s):  
AARON EKSTROM ◽  
CARL POMERANCE ◽  
DINESH S. THAKUR

AbstractIn 1987, Gordon gave an integer primality condition similar to the familiar test based on Fermat’s little theorem, but based instead on the arithmetic of elliptic curves with complex multiplication. We prove the existence of infinitely many composite numbers simultaneously passing all elliptic curve primality tests assuming a weak form of a standard conjecture on the bound on the least prime in (special) arithmetic progressions. Our results are somewhat more general than both the 1999 dissertation of the first author (written under the direction of the third author) and a 2010 paper on Carmichael numbers in a residue class written by Banks and the second author.


Sign in / Sign up

Export Citation Format

Share Document