Abstract
In the fastestperforming integer factoring algorithms, one creates a sequence of integers (in a pseudorandom way) and wishes to rapidly determine a subsequence whose product is a square. In 1994 Pomerance stated the following problem which encapsulates all of the key issues: Select integers $a_1,a_2,\dots,$ at random from the interval $[1,x]$, until some (nonempty) subsequence has product equal to a square. Find a good estimate for the expected stopping time of this process. A good solution should allow one to determine the optimal choice of parameters in many factoring algorithms.
Pomerance (1994), using an idea of Schroeppel (1985), showed that with probability $1o(1)$ the first subsequence whose product equals a square occurs after at least $J_0^{1o(1)}$ integers have been selected, but no more than $J_0$, for an appropriate (explicitly determined) $J_0=J_0(x)$. We tighten Pomerance’s interval to $$ [ (\pi/4)(e^{\gamma} – o(1))J_0, (e^{\gamma} + o(1)) J_0], $$ where $\gamma = 0.577…$ is the EulerMascheroni constant, and believe that the correct interval is $[ (e^{\gamma} – o(1))J_0, (e^{\gamma} + o(1)) J_0]$, a “sharp threshold”. In our proof we confirm the wellestablished belief that, typically, none of the integers in the square product have large prime factors.
The heart of the proof of our upper bound lies in delicate calculations in probabilistic graph theory, supported by comparative estimates on smooth numbers using precise information on saddle points.

[AS] Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Abramowitz, M. and Stegun, I. A., Eds., New York: Dover Publications, 1965.
@book{AS, EDITOR={Abramowitz, M. and Stegun, I. A.},
TITLE={Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables},
PUBLISHER={Dover Publications},
ADDRESS={New York},
YEAR={1965},
} 
[buhler] J. P. Buhler, H. W. Lenstra Jr., and C. Pomerance, "Factoring integers with the number field sieve," in The Development of the Number Field Sieve, New York: SpringerVerlag, 1993, vol. 1554, pp. 5094.
@incollection {buhler, MRKEY = {1321221},
AUTHOR = {Buhler, J. P. and Lenstra, Jr., H. W. and Pomerance, Carl},
TITLE = {Factoring integers with the number field sieve},
BOOKTITLE = {The Development of the Number Field Sieve},
SERIES = {Lecture Notes in Math.},
VOLUME = {1554},
PAGES = {5094},
PUBLISHER = {SpringerVerlag},
ADDRESS = {New York},
YEAR = {1993},
MRCLASS = {11Y05 (11N36 11Y40)},
MRNUMBER = {1321221},
DOI = {10.1007/BFb0091539},
ZBLNUMBER = {0806.11067},
} 
[Calkin] N. J. Calkin, "Dependent sets of constant weight binary vectors," Combin. Probab. Comput., vol. 6, iss. 3, pp. 263271, 1997.
@article {Calkin, MRKEY = {1464565},
AUTHOR = {Calkin, Neil J.},
TITLE = {Dependent sets of constant weight binary vectors},
JOURNAL = {Combin. Probab. Comput.},
FJOURNAL = {Combinatorics, Probability and Computing},
VOLUME = {6},
YEAR = {1997},
NUMBER = {3},
PAGES = {263271},
ISSN = {09635483},
MRCLASS = {60C05},
MRNUMBER = {1464565},
MRREVIEWER = {Nikolai Volodin},
DOI = {10.1017/S0963548397003040},
ZBLNUMBER = {0887.60015},
} 
[CP] R. Crandall and C. Pomerance, Prime Numbers; A Computational Perspective, Second ed., New York: SpringerVerlag, 2005.
@book {CP, MRKEY = {2156291},
AUTHOR = {Crandall, Richard and Pomerance, Carl},
TITLE = {Prime Numbers; A Computational Perspective},
EDITION = {Second},
PUBLISHER = {SpringerVerlag},
ADDRESS = {New York},
YEAR = {2005},
PAGES = {xvi+597},
ISBN = {9780387252827; 0387252827},
MRCLASS = {11A41 (11A51 11Y05 11Y11 11Y35)},
MRNUMBER = {2156291},
MRREVIEWER = {Robert Juricevic},
ZBLNUMBER = {1088.11001},
} 
[CGPT] E. Croot, A. Granville, R. Pemantle, and P. Tetali, "Running time predictions for factoring algorithms," in Algorithmic Number Theory, New York: SpringerVerlag, 2008, vol. 5011, pp. 136.
@incollection {CGPT, MRKEY = {2467835},
AUTHOR = {Croot, Ernie and Granville, Andrew and Pemantle, Robin and Tetali, Prasad},
TITLE = {Running time predictions for factoring algorithms},
BOOKTITLE = {Algorithmic Number Theory},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {5011},
PAGES = {136},
PUBLISHER = {SpringerVerlag},
ADDRESS = {New York},
YEAR = {2008},
MRCLASS = {11Y05 (11Y16 68W40)},
MRNUMBER = {2467835},
MRREVIEWER = {S. V. Nagaraj},
DOI = {10.1007/9783540794561_1},
ZBLNUMBER = {1205.11132},
} 
[dixon] J. D. Dixon, "Asymptotically fast factorization of integers," Math. Comp., vol. 36, iss. 153, pp. 255260, 1981.
@article {dixon, MRKEY = {0595059},
AUTHOR = {Dixon, John D.},
TITLE = {Asymptotically fast factorization of integers},
JOURNAL = {Math. Comp.},
FJOURNAL = {Mathematics of Computation},
VOLUME = {36},
YEAR = {1981},
NUMBER = {153},
PAGES = {255260},
ISSN = {00255718},
CODEN = {MCMPAF},
MRCLASS = {10A30 (10A25)},
MRNUMBER = {0595059},
MRREVIEWER = {H. L. Abbott},
DOI = {10.2307/2007743},
ZBLNUMBER = {0452.10010},
} 
[poisson] R. Durrett, Probability. Theory and Examples, Pacific Grove, CA: Wadsworth & Brooks/Cole Advanced Books & Software, 1991.
@book {poisson, MRKEY = {1068527},
AUTHOR = {Durrett, Richard},
TITLE = {Probability. Theory and Examples},
SERIES = {The Wadsworth \& Brooks/Cole Statistics/Probability Series},
PUBLISHER = {Wadsworth \& Brooks/Cole Advanced Books \& Software},
ADDRESS = {Pacific Grove, CA},
YEAR = {1991},
PAGES = {x+453},
ISBN = {0534132065},
MRCLASS = {6001},
MRNUMBER = {1068527},
MRREVIEWER = {George L. O'Brien},
ZBLNUMBER = {0709.60002},
} 
[friedgut] E. Friedgut, "Sharp thresholds of graph properties, and the $k$sat problem," J. Amer. Math. Soc., vol. 12, iss. 4, pp. 10171054, 1999.
@article {friedgut, MRKEY = {1678031},
AUTHOR = {Friedgut, Ehud},
TITLE = {Sharp thresholds of graph properties, and the {$k$}sat problem},
JOURNAL = {J. Amer. Math. Soc.},
FJOURNAL = {Journal of the American Mathematical Society},
VOLUME = {12},
YEAR = {1999},
NUMBER = {4},
PAGES = {10171054},
ISSN = {08940347},
MRCLASS = {05C80 (42C10)},
MRNUMBER = {1678031},
MRREVIEWER = {Mark R. Jerrum},
DOI = {10.1090/S0894034799003057},
ZBLNUMBER = {0932.05084},
} 
[GS] A. Granville and K. Soundararajan, "Large character sums," J. Amer. Math. Soc., vol. 14, iss. 2, pp. 365397, 2001.
@article {GS, MRKEY = {1815216},
AUTHOR = {Granville, Andrew and Soundararajan, K.},
TITLE = {Large character sums},
JOURNAL = {J. Amer. Math. Soc.},
FJOURNAL = {Journal of the American Mathematical Society},
VOLUME = {14},
YEAR = {2001},
NUMBER = {2},
PAGES = {365397},
ISSN = {08940347},
MRCLASS = {11L40 (11N25)},
MRNUMBER = {1815216},
MRREVIEWER = {S. W. Graham},
DOI = {10.1090/S089403470000357X},
ZBLNUMBER = {0983.11053},
} 
[hild] A. Hildebrand and G. Tenenbaum, "On integers free of large prime factors," Trans. Amer. Math. Soc., vol. 296, iss. 1, pp. 265290, 1986.
@article {hild, MRKEY = {0837811},
AUTHOR = {Hildebrand, Adolf and Tenenbaum, G{é}rald},
TITLE = {On integers free of large prime factors},
JOURNAL = {Trans. Amer. Math. Soc.},
FJOURNAL = {Transactions of the American Mathematical Society},
VOLUME = {296},
YEAR = {1986},
NUMBER = {1},
PAGES = {265290},
ISSN = {00029947},
CODEN = {TAMTAM},
MRCLASS = {11N25},
MRNUMBER = {0837811},
MRREVIEWER = {Aleksandar Ivi{ć}},
DOI = {10.2307/2000573},
ZBLNUMBER = {0601.10028},
} 
[pierre] P. Leroux, "Enumerative Problems Inspired by Mayer’s Theory of Cluster Integrals," Electron. J. Combin., 2004.
@article{pierre,
author={Leroux, P.},
TITLE={Enumerative Problems Inspired by {M}ayer's Theory of Cluster Integrals},
JOURNAL={Electron. J. Combin.},
NOTE={paper R32, May 14},
YEAR={2004},
} 
[pom0] C. Pomerance, "The quadratic sieve factoring algorithm," in Advances in Cryptology, New York: SpringerVerlag, 1985, vol. 209, pp. 169182.
@incollection {pom0, MRKEY = {0825590},
AUTHOR = {Pomerance, Carl},
TITLE = {The quadratic sieve factoring algorithm},
BOOKTITLE = {Advances in Cryptology},
VENUE={{P}aris, 1984},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {209},
PAGES = {169182},
PUBLISHER = {SpringerVerlag},
ADDRESS = {New York},
YEAR = {1985},
MRCLASS = {11Y05 (68Q25 68R05 94A60)},
MRNUMBER = {0825590},
MRREVIEWER = {ClausPeter Schnorr},
DOI = {10.1007/3540397574_17},
ZBLNUMBER = {0596.10006},
} 
[pom4] C. Pomerance, "The number field sieve," in Mathematics of Computation 1943–1993: a HalfCentury of Computational Mathematics, Providence, RI: Amer. Math. Soc., 1994, vol. 48, pp. 465480.
@incollection {pom4, MRKEY = {1314884},
AUTHOR = {Pomerance, Carl},
TITLE = {The number field sieve},
BOOKTITLE = {Mathematics of {C}omputation 19431993: a HalfCentury of Computational Mathematics},
VENUE={{V}ancouver, {BC},
1993},
SERIES = {Proc. Sympos. Appl. Math.},
VOLUME = {48},
PAGES = {465480},
PUBLISHER = {Amer. Math. Soc.},
ADDRESS = {Providence, RI},
YEAR = {1994},
MRCLASS = {11Y05 (11N35)},
MRNUMBER = {1314884},
MRREVIEWER = {Michael Filaseta},
ZBLNUMBER = {0821.11064},
} 
[pom1] C. Pomerance, "The role of smooth numbers in numbertheoretic algorithms," in Proceedings of the International Congress of Mathematicians, Vol. 1, 2, Basel, 1995, pp. 411422.
@inproceedings {pom1, MRKEY = {1403941},
AUTHOR = {Pomerance, Carl},
TITLE = {The role of smooth numbers in numbertheoretic algorithms},
BOOKTITLE = {Proceedings of the {I}nternational {C}ongress of {M}athematicians, {V}ol. 1, 2},
VENUE={{Z}ürich, 1994},
PAGES = {411422},
PUBLISHER = {Birkhäuser},
ADDRESS = {Basel},
YEAR = {1995},
MRCLASS = {11Y05 (11A51 11Y16)},
MRNUMBER = {1403941},
MRREVIEWER = {Oliver Schirokauer},
ZBLNUMBER = {0854.11047},
} 
[pom2] C. Pomerance, "Multiplicative independence for random integers," in Analytic Number Theory, Vol. 2, Boston, MA: Birkhäuser, 1996, vol. 139, pp. 703711.
@incollection {pom2, MRKEY = {1409387},
AUTHOR = {Pomerance, Carl},
TITLE = {Multiplicative independence for random integers},
BOOKTITLE = {Analytic Number Theory, {V}ol. 2},
VENUE={{A}llerton {P}ark, {IL},
1995},
SERIES = {Progr. Math.},
VOLUME = {139},
PAGES = {703711},
PUBLISHER = {Birkhäuser},
ADDRESS = {Boston, MA},
YEAR = {1996},
MRCLASS = {11Y16 (11N25 11Y05 68Q25)},
MRNUMBER = {1409387},
MRREVIEWER = {Joe P. Buhler},
ZBLNUMBER = {0865.11085},
} 
[pom3] C. Pomerance, "Smooth numbers and the quadratic sieve," in Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, Cambridge: Cambridge Univ. Press, 2008, vol. 44, pp. 6981.
@incollection {pom3, MRKEY = {2467543},
AUTHOR = {Pomerance, Carl},
TITLE = {Smooth numbers and the quadratic sieve},
BOOKTITLE = {Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography},
SERIES = {Math. Sci. Res. Inst. Publ.},
VOLUME = {44},
PAGES = {6981},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {2008},
MRCLASS = {11Y05 (1101 11N35 11Y16)},
MRNUMBER = {2467543},
MRREVIEWER = {Samuel S. Wagstaff, Jr.},
ZBLNUMBER = {1188.11065},
} 
[silverman] R. D. Silverman, "The multiple polynomial quadratic sieve," Math. Comp., vol. 48, iss. 177, pp. 329339, 1987.
@article {silverman, MRKEY = {0866119},
AUTHOR = {Silverman, Robert D.},
TITLE = {The multiple polynomial quadratic sieve},
JOURNAL = {Math. Comp.},
FJOURNAL = {Mathematics of Computation},
VOLUME = {48},
YEAR = {1987},
NUMBER = {177},
PAGES = {329339},
ISSN = {00255718},
CODEN = {MCMPAF},
MRCLASS = {11Y05},
MRNUMBER = {0866119},
MRREVIEWER = {Torleiv Kløve},
DOI = {10.2307/2007894},
ZBLNUMBER = {0608.10004},
} 
[tenen] G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge: Cambridge Univ. Press, 1995, vol. 46.
@book {tenen, MRKEY = {1342300},
AUTHOR = {Tenenbaum, G{é}rald},
TITLE = {Introduction to Analytic and Probabilistic Number Theory},
SERIES = {Cambridge Stud. Adv. Math.},
VOLUME = {46},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {1995},
PAGES = {xvi+448},
ISBN = {0521412617},
MRCLASS = {1102 (11Kxx 11Mxx 11Nxx)},
MRNUMBER = {1342300},
MRREVIEWER = {H. G. Diamond},
ZBLNUMBER = {0880.11001},
ZBLNUMBER = {0831.11001},
}