The sharp threshold for making squares
Consider a random sequence of $N$ integers, each chosen uniformly and independently from the set $\{1,\dots,x\}$. Motivated by applications to factorisation algorithms such as Dixon's algorithm, the quadratic sieve, and the number field sieve, Pomerance in 1994 posed the following problem: how...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Mathematical Sciences Publishers
2018
|