Higher-order Carmichael numbers

Details Higher-order Carmichael numbers Higher-order Carmichael numbers

1998-12-16

arxiv.org/abs/math/9812089v1

Math. Comp. 69 (2000) 1711--1719.

Mathematics

Number Theory

9 pages, AMS-LaTeX

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Higher-order Carmichael numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Higher-order Carmichael numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Higher-order Carmichael numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122420