There are infinitely many Carmichael numbers
From MaRDI portal
Publication:1334322
DOI10.2307/2118576zbMath0816.11005OpenAlexW2330778380WikidataQ55890279 ScholiaQ55890279MaRDI QIDQ1334322
W. R. Alford, Andrew Granville, Carl B. Pomerance
Publication date: 23 July 1995
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d5932f17a1957eef8891b70c2bb75c417bcbb03a
combinatorial group theoryCarmichael numbersdivisors of the form \(p-1\)existence of infinitely many Carmichael numbers
Congruences; primitive roots; residue systems (11A07) Distribution of integers in special residue classes (11N69) Arithmetic functions; related numbers; inversion formulas (11A25) Rate of growth of arithmetic functions (11N56)
Related Items (only showing first 100 items - show all)
On a variant of Giuga numbers ⋮ Carmichael numbers and the sieve ⋮ Carmichael numbers in the sequence $(2^n k+1)_{n\geq 1}$ ⋮ Extremal Sequences for Some Weighted Zero-Sum Constants for Cyclic Groups ⋮ How often is Euler's totient a perfect power? ⋮ On the Carmichael rings, Carmichael ideals and Carmichael polynomials ⋮ DIVISOR‐SUM FIBERS ⋮ Improved error bounds for the Fermat primality test on random inputs ⋮ Arithmetical progressions formed by \(k\) different Lehmer pseudoprimes ⋮ A note on square totients ⋮ Pseudoprimality related to the generalized Lucas sequences ⋮ On the distribution of balanced subgroups ⋮ Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function ⋮ Fermat test with Gaussian base and Gaussian pseudoprimes ⋮ Linear independence of certain Lambert series ⋮ Zero-sum problems in finite Abelian groups: a survey ⋮ An asymptotically tight bound for the Davenport constant ⋮ The complexity of cover graph recognition for some varieties of finite lattices ⋮ Unnamed Item ⋮ On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-$p$ digits ⋮ Unnamed Item ⋮ It is easy to determine whether a given integer is prime ⋮ Tight upper and lower bounds for the reciprocal sum of Proth primes ⋮ The cross number of finite Abelian groups. III ⋮ Building pseudoprimes with a large number of prime factors ⋮ On Korselt's criterion for Carmichael numbers ⋮ The polynomial method in the study of zero-sum theorems ⋮ On Fibonacci numbers which are elliptic Carmichael ⋮ Looking for Fibonacci base-2 pseudoprimes ⋮ General graph pebbling ⋮ THE KORSELT SET OF pq ⋮ Modular hyperbolas ⋮ Note on the Davenport's constant for finite abelian groups with rank three ⋮ The Korselt set of a power of a prime ⋮ Faster \(p\)-adic feasibility for certain multivariate sparse polynomials ⋮ A CONDITIONAL DENSITY FOR CARMICHAEL NUMBERS ⋮ Piatetski-Shapiro primes in arithmetic progressions ⋮ On zero-sum subsequences of restricted size. II. ⋮ A new probabilistic primality test ⋮ Finding strong pseudoprimes to several bases ⋮ Frobenius pseudoprimes ⋮ A new algorithm for constructing large Carmichael numbers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the values of the divisor function ⋮ Carmichael numbers with \(p+1\mid n+1\) ⋮ Weighted Zero-Sums for Some Finite Abelian Groups of Higher Ranks ⋮ Iterated Riesel and Iterated Sierpiński Numbers ⋮ Period of the power generator and small values of Carmichael’s function ⋮ Two zero-sum problems and multiple properties ⋮ KORSELT NUMBERS AND SETS ⋮ PRODUCTS OF SHIFTED PRIMES SIMULTANEOUSLY TAKING PERFECT POWER VALUES ⋮ Density of Carmichael numbers with three prime factors ⋮ Counting curves and their projections ⋮ Carmichael numbers in number rings ⋮ Finding 𝐶₃-strong pseudoprimes ⋮ On primary Carmichael numbers ⋮ ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS ⋮ Carmichael numbers with a totient of the form \(a^2+nb^2\) ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ Smooth values of shifted primes in arithmetic progressions ⋮ There are infinitely many Perrin pseudoprimes ⋮ On the existence and non-existence of elliptic pseudoprimes ⋮ Davenport constant for finite abelian groups ⋮ Two contradictory conjectures concerning Carmichael numbers ⋮ Unification of zero-sum problems, subset sums and covers of ℤ ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Geometric properties of points on modular hyperbolas ⋮ Strongly nonzero points and elliptic pseudoprimes ⋮ Carmichael numbers for $\mathrm{GL}(m)$ ⋮ On sigma‐phi numbers ⋮ A stronger connection between the Erdős-Burgess and Davenport constants ⋮ Arithmetic progressions of Carmichael numbers in a reduced residue class ⋮ Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm ⋮ ON THE METHODOLOGY APPLICATION OF MODERN COMPUTING TECHNOLOGIES IN STUDYING THE THEORY OF NUMBERS ⋮ Complexity of inverting the Euler function ⋮ FACTORS OF CARMICHAEL NUMBERS AND A WEAK -TUPLES CONJECTURE ⋮ Counting Carmichael numbers with small seeds ⋮ On the finiteness of Carmichael numbers with Fermat factors and $L=2^{\alpha}P^2$ ⋮ On Carmichael polynomials ⋮ FIXED AND PERIODIC POINTS OF POLYNOMIALS GENERATED BY MINIMAL POLYNOMIALS OF 2cos(2π/n) ⋮ New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants ⋮ Primality tests, linear recurrent sequences and the Pell equation ⋮ Strengthening the Baillie-PSW primality test ⋮ RADICALLY WEAKENING THE LEHMER AND CARMICHAEL CONDITIONS ⋮ A generalization of Piatetski-Shapiro sequences ⋮ There are no Carmichael numbers of the form \(2^np+1\) with \(p\) prime ⋮ Generalized strong pseudoprime tests and applications ⋮ The Lucas property for linear recurrences of second order ⋮ Values of the Euler function in various sequences ⋮ CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS ⋮ Higher-order Carmichael numbers ⋮ On values taken by the largest prime factor of shifted primes ⋮ Some inverse problems in zero-sum theory ⋮ The set of \(k\)-units modulo \(n\) ⋮ Constructing Carmichael numbers through improved subset-product algorithms ⋮ An asymptotic formula for the number of smooth values of a polynomial ⋮ Integers without large prime factors ⋮ A one-parameter quadratic-base version of the Baillie-PSW probable prime test
This page was built for publication: There are infinitely many Carmichael numbers
