An odd prime is a prime number that is an odd integer. The only even number that is a prime number is 2, since every other positive even number has 2 as a proper divisor. Thus every prime number greater than 2 is an odd prime. There are infinitely many odd primes, by Euclid's theorem.
Ancestors (5)
Incoming links (48)
- Complete Legendre-symbol sum
- Computing Legendre symbols by quadratic reciprocity
- Discriminant criterion for a quadratic congruence modulo an odd prime
- Discriminant criterion for prime representation by a binary quadratic form
- Euclid proof for infinitely many primes congruent to seven modulo eight
- Euler pseudoprime
- Euler's criterion
- Euler witness
- Gauss's lemma (number theory)
- Generalized repunit pseudoprime construction
- Lattice-point count for quadratic reciprocity
- Least quadratic nonresidue
- Legendre symbol
- Lifting a primitive root to odd prime powers
- Multiplicativity of the Legendre symbol
- Number of consecutive nonzero quadratic residues modulo an odd prime
- Past exam of the mathematics course of the University of Cambridge / 2001 / ia / Paper 4 / 5E / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2001 / ia / Paper 4 / 7E / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 29 / 2 / iv / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / ii / Paper 2 / 18H / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / ii / Paper 2 / 1H / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / ia / Paper 4 / 6E / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 27 / 1 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 27 / 4 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 119 / 6 / Solution
- Past exam of the options II course of the University of Oxford / 2012 / C / C2 / a / iii / Solution
- Past exam of the options II course of the University of Oxford / 2012 / C / C2 / a / i / Solution
- Past exam of the options II course of the University of Oxford / 2012 / C / C2 / b / Solution
- Past exam of the options II course of the University of Oxford / 2013 / C2 / a / i / Solution
- Past exam of the options II course of the University of Oxford / 2013 / C2 / a / v / Solution
- Past exam of the options II for mathematics and philosophy course of the University of Oxford / 2013 / C2 / a / i / Solution
- Past exam of the options II for mathematics and philosophy course of the University of Oxford / 2013 / C2 / a / v / Solution
- Past exam of the short options course of the University of Oxford / 2014 / 1 / a / ii / Solution
- Past exam of the short options course of the University of Oxford / 2014 / 1 / a / i / Solution
- Past exam of the short options course of the University of Oxford / 2017 / 1 / a / Solution
- Past exam of the short options course of the University of Oxford / 2017 / 1 / b / Solution
- Primitive-root lifting criterion
- Primitive-root modulus classification
- Quadratic Gauss sum
- Quadratic Legendre-symbol correlation
- Quadratic nonresidue
- Quadratic reciprocity
- Quadratic residue
- Second supplementary law for quadratic reciprocity
- Square root of minus one modulo a prime
- Transported addition on the multiplicative natural-number monoid
- Two distinguished classes of discriminant minus eight q
- Weighted complete Legendre-symbol sum
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.