Constructing Carmichael numbers through improved subset-product algorithms

DOI10.1090/S0025-5718-2013-02737-8zbMath1327.11087arXiv1203.6664OpenAlexW2150146059MaRDI QIDQ2871190

Steven Hayman, Andrew Shallue, Jon Grantham

Publication date: 22 January 2014

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

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

zbMATH Keywords

subset sumCarmichael numbers

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Factorization (11Y05)

Related Items

FACTORS OF CARMICHAEL NUMBERS AND A WEAK -TUPLES CONJECTURE

Uses Software

• NTL

Cites Work

• The extended \(k\)-tree algorithm
• Highly composite numbers. Annotated by Jean-Louis Nicolas and Guy Robin
• There are infinitely many Carmichael numbers
• Building pseudoprimes with a large number of prime factors
• The Carmichael Numbers up to 10 15
• New Generic Algorithms for Hard Knapsacks
• The Pseudoprimes to 25 ⋅10 9
• A new algorithm for constructing large Carmichael numbers
• An Improved Multi-set Algorithm for the Dense Subset Sum Problem
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item