The twenty-fourth Fermat number is composite

DOI10.1090/S0025-5718-02-01479-5zbMath1035.11066MaRDI QIDQ4806407

Jason S. Papadopoulos, Ernst W. Mayer, Richard E. Crandall

Publication date: 14 May 2003

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Primality (11Y11)

Related Items (7)

Rapid multiplication modulo the sum and difference of highly composite numbers ⋮ Expect at most one billionth of a new Ferma\textit{t} prime! ⋮ Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Some properties of the factors of Fermat numbers ⋮ The complexity of membership problems for circuits over sets of integers ⋮ Unnamed Item ⋮ On upper bounds for the count of elite primes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A segmented FFT algorithm for vector computers
• Fast Fourier transform and convolution algorithms
• Prime numbers and computer methods for factorization.
• The composite character of the twenty-second Fermat number
• Fast multiplication of large numbers
• Irregular Primes and Cyclotomic Invariants to Four Million
• The Twentieth Fermat Number is Composite
• Irregular Primes to One Million
• Discrete Weighted Transforms and Large-Integer Arithmetic
• Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
• The Twenty-Second Fermat Number is Composite
• Fermat Numbers and Mersenne Numbers

This page was built for publication: The twenty-fourth Fermat number is composite