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 time was developed by Peter Shor. RSA encryption relies on the difficulty of performing this task for large integers. 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■
ANSWER: integer factorization [or word forms like factoring; accept prime factorization]
<Editors, Other Science>
= Average correct buzz position
Buzzes
Summary
| Tournament | Edition | TUH | Conv. % | Neg % | Average Buzz |
|---|---|---|---|---|---|
| Northern California | US | 4 | 100% | 50% | 82.00 |
| Southern California | US | 7 | 100% | 71% | 82.00 |
| Eastern Canada (1) | US | 4 | 100% | 25% | 71.50 |
| Eastern Canada (2) | US | 9 | 100% | 22% | 73.78 |
| Florida | US | 4 | 100% | 50% | 90.00 |
| Great Lakes | US | 10 | 90% | 10% | 60.22 |
| Lower Mid-Atlantic | US | 9 | 89% | 22% | 84.25 |
| Upper Mid-Atlantic | US | 9 | 100% | 44% | 81.44 |
| Midwest | US | 9 | 89% | 44% | 77.13 |
| North | US | 4 | 100% | 25% | 68.50 |
| Northeast | US | 11 | 91% | 45% | 87.70 |
| Pacific | US | 8 | 88% | 38% | 71.00 |
| Southeast | US | 12 | 83% | 50% | 86.70 |
| Upstate NY | US | 5 | 100% | 80% | 107.20 |