Constructing Carmichael numbers through improved subset-product algorithms
From MaRDI portal
Publication:2871190
DOI10.1090/S0025-5718-2013-02737-8zbMATH Open1327.11087arXiv1203.6664OpenAlexW2150146059MaRDI QIDQ2871190
Author name not available (Why is that?)
Publication date: 22 January 2014
Published in: (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1203.6664
No records found.
No records found.
This page was built for publication: Constructing Carmichael numbers through improved subset-product algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871190)
