Articles

• B

  • Bounding the sum by an integral

• C

  • Computational number theory front page

• I

  • Irrationality and transcendence front page

• P

  • Partial summation

• T

  • To establish that n is composite, show that Fermat's little theorem does not hold for n
  • To factorize n, find a non-trivial square root of 1 mod n
  • To find a factor of n, find some m such that (m,n) is not 1
  • To find a rational with low denominator near a given real, use continued fractions
  • To prove that a number is irrational, show that it is almost rational
  • To work out powers mod n, use repeated squaring