Computational Number Theory

In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The best known problem in the field is integer factorization.

Famous quotes containing the words number and/or theory:

    If matrimony be really beneficial to society, the custom that ... married women alone are allowed any claim to place, is as useful a piece of policy as ever was invented.... The ridicule fixed on the appellation of old maid hath, I doubt not, frightened a very large number into the bonds of wedlock.
    Sarah Fielding (1710–1768)

    The theory seems to be that so long as a man is a failure he is one of God’s chillun, but that as soon as he has any luck he owes it to the Devil.
    —H.L. (Henry Lewis)