73 pages matching prime factorization in this book
Results 1-3 of 73
What people are saying - Write a review
We haven't found any reviews in the usual places.
Intractable Problems will cover the following topics
Fundamentals of Number Theory
9 other sections not shown
algebraic number algorithmic number arithmetic Assume ERH asymptotic Bach Berlekamp binary bit complexity bit operations bound Carmichael numbers Chapter Chinese remainder theorem coefficients composite numbers compute congruences conjecture constant continued fraction corollary cyclic D. H. Lehmer defined denote the number deterministic polynomial discussed element equation estimate Euclidean algorithm Euler example Exercise Fermat finite fields formula gcd(a given greatest common divisor H. W. Lenstra Hence heuristic induction input irreducible polynomial lemma linear machine Math Mersenne method modulo monic polynomial multiplication nonzero number field number of primes number theory polynomial of degree polynomial-time Pomerance positive integers primality testing prime factorization prime number theorem primitive root probabilistic problem proof pseudoprime quadratic nonresidue randomized algorithm reader relatively prime result Riemann hypothesis ring root of unity running Shallit Show sieve solution square roots squarefree steps subgroup Suppose tt(x zeroes zeta function