If, for every , the smooth numbers up to with all prime factors at most have density at least , then for fixed there are only primes with . Apply the variance form of the large sieve to the indicator function of the -smooth numbers up to . For every exceptional prime, all these numbers are nonzero quadratic residues, so half its nonzero residue classes are empty. Their variance contribution is at least one third of the square of the total count. The large sieve bounds the sum of contributions by a constant times times that count. The density assumption with finishes the argument.
Noncongruent primes congruent to three modulo eight Created 2026-10-05 Updated 2026-10-06
For a prime , apply two-isogeny descent to the congruent number elliptic curve and its companion . The first square-class image is exactly , already supplied by 2-torsion. The second has only positive candidates . The quartic covering in a two-isogeny descent equations for and are impossible modulo , because is not a quadratic residue. For the equation is . Coprimality forces odd and ; modulo sixteen this gives , which is impossible. Thus the second image is trivial and the square-class index formula for two-isogeny descent gives rank zero. The same prime-reduction argument bounds its rational torsion by four, and it already has four rational 2-torsion points, so it has no rational point corresponding to a right triangle of area .
If a squarefree positive has a prime divisor , a unit of norm in would give for integers . Modulo this makes a quadratic residue, which is impossible. The obstruction is sufficient, not a full criterion for negative-norm units.
Let be the quadratic character, equivalently the Legendre symbol. Zero is included among the square residue classes. For every integer its square-class indicator is
For a nonzero quadratic residue the right side is one, for a nonresidue it is zero, and for a multiple of it is one. Summing over the interval, the character contribution is by the previous part, while the number of multiples of is . Thus the required count is
This counts the integers in the interval whose residue classes are squares. When the interval exceeds one period, repeated appearances are counted; the displayed main term could not describe a count of distinct residue classes for arbitrary .
For the odd prime , the Fermat-Euler theorem gives . Therefore the residue class obeys . Since a prime number dividing a product divides one of its factors,
If is a quadratic residue, choose with . Then is nonzero modulo , and Fermat's little theorem gives
This proves the quadratic residue direction of Euler's criterion.
For coefficients supported on an interval of length , write and . The variance form of the large sieve states
The constant is absolute. One may take the explicit right side , by orthogonality of roots of unity and the exponential-sum large sieve proved in Question 2.
Take , , and the indicator function of the -smooth numbers up to . Applying the given smooth-number density with parameter gives
with a harmless adjustment of the constant for integer endpoints. If an odd prime has least quadratic nonresidue , then : a quadratic nonresidue always occurs among . Every prime factor of every selected smooth number is thus a nonzero quadratic residue modulo . By the multiplicativity of the Legendre symbol, every selected number is a nonzero quadratic residue modulo .
There are nonzero quadratic nonresidue classes, and on all of them. Their contribution to the variance is at least
If denotes the number of exceptional primes, the variance form of the large sieve, with , yields . Consequently
This is the bounded exceptional primes for least quadratic nonresidues argument. Using an interval of length is what matches the term; an interval of length would not give a bounded exceptional set.