Find link

language:

Find link is a tool written by Edward Betts.

searching for Fermat number 8 found (45 total)

Rational sieve (915 words) [view diff] case mismatch in snippet view article find links to article

, M. S. Manasse, and J. M. Pollard, The Factorization of the Ninth Fermat Number, Math. Comp. 61 (1993), 319-349. Available at [2]. A. K. Lenstra, H

4,294,967,295 (814 words) [view diff] exact match in snippet view article find links to article

least 2233+1 (approximately 102585827973), because every intervening Fermat number is known to be composite. The number 4,294,967,295, equivalent to the

Special number field sieve (1,427 words) [view diff] case mismatch in snippet view article find links to article

Manasse, M. S. & Pollard, J. M. (1993), "The Factorization of the Ninth Fermat Number", Mathematics of Computation, 61 (203): 319–349, Bibcode:1993MaCom.

Discrete Fourier transform over a ring (3,993 words) [view diff] case mismatch in snippet view article find links to article

exists. Special cases of the number theoretic transform such as the Fermat Number Transform (m = 2k+1), used by the Schönhage–Strassen algorithm, or Mersenne

Constructible polygon (2,191 words) [view diff] exact match in snippet view article find links to article

Sierpiński triangle.) This pattern breaks down after this, as the next Fermat number is composite (4294967297 = 641 × 6700417), so the following rows do

Henri Nussbaumer (339 words) [view diff] case mismatch in snippet view article find links to article

Development: 498–504. Nussbaumer, Henri J. (1976). "Complex Convolutions via Fermat Number Transforms". IBM Journal of Research and Development: 282–284. Nussbaumer

Lenstra elliptic-curve factorization (4,511 words) [view diff] exact match in snippet view article find links to article

OCLC 256778332. Brent, Richard P. (1999). "Factorization of the tenth Fermat number". Mathematics of Computation. 68 (225): 429–451. Bibcode:1999MaCom.

1000 (number) (24,094 words) [view diff] exact match in snippet view article

with edge-length 19 1947 = k such that 5·2k + 1 is a prime factor of a Fermat number 22m + 1 for some m 1948 = number of strict solid partitions of 20 1949