Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


A new method for producing large Carmichael numbers

Author: H. Dubner
Journal: Math. Comp. 53 (1989), 411-414
MSC: Primary 11A51; Secondary 11Y11
MathSciNet review: 969484
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A new method for producing large three-component Carmichael numbers is derived. Only two primes must be found simultaneously instead of three as in the "standard" method. For each set of two primes many third primes can be found. Several Carmichael numbers with more than 3000 digits are shown, with the largest having 3710 digits.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11A51, 11Y11

Retrieve articles in all journals with MSC: 11A51, 11Y11

Additional Information

PII: S 0025-5718(1989)0969484-8
Article copyright: © Copyright 1989 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia