... prime1
Terms in bold are included in the glossary.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... bits2
Since $n = \log _{2}N$, so that such a runtime is logarithmic in $N$, this is often referred to as logarithmic, resulting in a certain amount of confusion.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... published3
He did however refer to it several times. See p 172 of [S].
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... reduced4
As described in Theorem 1, the conditions are: $0<Q_i<2\sqrt{N}$, $0<P_{i-1}<\sqrt{N}$, and $\sqrt{N}-P_{i-1} < Q_i$.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... obtain5
Due to the change from $Q_0 = 1$ to $Q_0 = 2$, the general form for the quadratic form is now $(Q_{i-1}/2,P_i,-Q_i/2)$
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... integers6
Integers $N$ such that $N \equiv 1\pmod 4$, but such that $-1$ is not a quadratic residue compose at least $1/4$ of the non-prime odd integers.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.