Higher-order Carmichael numbers

DOI10.1090/S0025-5718-00-01225-4zbMATH Open0966.11006DBLPjournals/moc/Howe00arXivmath/9812089WikidataQ56041260 ScholiaQ56041260MaRDI QIDQ4501050FDOQ4501050

Authors: Everett W. Howe 

Publication date: 3 September 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: We define a Carmichael number of order m to be a composite integer n such that nth-power raising defines an endomorphism of every Z/nZ-algebra that can be generated as a Z/nZ-module by m elements. We give a simple criterion to determine whether a number is a Carmichael number of order m, and we give a heuristic argument (based on an argument of Erdos for the usual Carmichael numbers) that indicates that for every m there should be infinitely many Carmichael numbers of order m. The argument suggests a method for finding examples of higher-order Carmichael numbers; we use the method to provide examples of Carmichael numbers of order 2.

Full work available at URL: https://arxiv.org/abs/math/9812089

Recommendations

• scientific article; zbMATH DE number 2112001
• Generalized Carmichael numbers
• scientific article; zbMATH DE number 2219580
• Carmichael numbers for \(\mathrm{GL}(m)\)
• Comments on Carmichael numbers of order \(k\)

zbMATH Keywords

endomorphism\(\mathbb{Z}/n\mathbb{Z}\)-moduleCarmichael number of orderfinite étale algebras

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Étale and flat extensions; Henselization; Artin approximation (13B40) Factorization; primality (11A51) Primality (11Y11)

Cites Work

• Title not available (Why is that?)
• On Carmichael polynomials
• There are infinitely many Carmichael numbers
• Title not available (Why is that?)
• On Numbers Analogous to the Carmichael Numbers
• The Carmichael Numbers up to 10 15
• Lucas Pseudoprimes
• Strong Primality Tests that are Not Sufficient
• Generalizations of the Fibonacci pseudoprimes test
• Some remarks on strong Fibonacci pseudoprimes
• Title not available (Why is that?)
• Frobenius pseudoprimes
• Title not available (Why is that?)
• On generalized Lucas pseudoprimes
• On strong Dickson pseudoprimes
• Title not available (Why is that?)
• Characterizing Pseudoprimes for Third-Order Linear Recurrences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Carmichael numbers in number rings
• An Improved Multi-set Algorithm for the Dense Subset Sum Problem
• Comments on Carmichael numbers of order \(k\)
• Generalized Carmichael numbers
• Title not available (Why is that?)
• Average liar count for degree-\(2\) Frobenius pseudoprimes
• On the Carmichael rings, Carmichael ideals and Carmichael polynomials
• Carmichael numbers for \(\mathrm{GL}(m)\)

This page was built for publication: Higher-order Carmichael numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501050)