additive number theory
5 matching pages
§27.13(i) Introduction… ►The subsections that follow describe problems from additive number theory. … ►
§27.13(ii) Goldbach Conjecture… ►
§27.13(iii) Waring’s Problem… ►
§27.13(iv) Representation by Squares…
§27.14(iv) Relation to Modular Functions… ►
§27.14(v) Divisibility Properties… ►
§27.14(vi) Ramanujan’s Tau Function… ►
Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below . Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard , and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.
For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).
Number Theory Web. References and links to software for factorization and primality testing.