Constructing Carmichael numbers through improved subset-product algorithms

Details Constructing Carmichael numbers through improved subset-product algorithms Constructing Carmichael numbers through improved subset-product algorithms

2012-03-29

arxiv.org/abs/1203.6664v1

Mathematics

Number Theory

Scientific paper

We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes p with the property that p-1 divides a highly composite \Lambda.

Affiliated with

Also associated with

No associations

Rating

Constructing Carmichael numbers through improved subset-product algorithms 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 Constructing Carmichael numbers through improved subset-product algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing Carmichael numbers through improved subset-product algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63590