Tossup

Hendrik Lenstra developed an algorithm for performing this task using elliptic curves, whose two-stage variant is analogous to one named after Pollard. Dixon’s method for performing this task forms the basis of an algorithm for performing this task using continued fractions. In 1994, a quantum algorithm for performing this task in polynomial (-5[1])time was developed by Peter Shor. (-5[1])RSA encryption relies on the difficulty of performing this task for (10[1])large integers. (10[1])For an integer n, a brute force method for performing this task checks all the integers from 1 to the square root of n. For 10 points, name this task that decomposes an integer into a product of smaller integers. ■END■ (10[2])

ANSWER: integer factorization [or word forms like factoring; accept prime factorization]
<Editors, Other Science>
= Average correct buzz position

Back to tossups

Buzzes


Summary

TournamentEditionTUHConv. %Neg %Average Buzz
Northern CaliforniaUS4100%50%82.00
Southern CaliforniaUS7100%71%82.00
Eastern Canada (1)US4100%25%71.50
Eastern Canada (2)US9100%22%73.78
FloridaUS4100%50%90.00
Great LakesUS1090%10%60.22
Lower Mid-AtlanticUS989%22%84.25
Upper Mid-AtlanticUS9100%44%81.44
MidwestUS989%44%77.13
NorthUS4100%25%68.50
NortheastUS1191%45%87.70
PacificUS888%38%71.00
SoutheastUS1283%50%86.70
Upstate NYUS5100%80%107.20