Odd means not divisible by two. Prime means a positive integer greater than one with exactly two positive divisors. Only the prime 2 is even.
Ask two different questions
Parity asks whether an integer is divisible by two. Primality asks whether a positive integer greater than one has any positive divisors besides one and itself. These properties overlap, but one does not replace the other.
The elementary definitions and the exceptional even prime 2 are covered in OpenStax’s introduction to whole numbers. A quick comparison makes the distinction concrete:
| Number | Parity | Prime status |
|---|---|---|
| 1 | Odd | Neither prime nor composite |
| 2 | Even | Prime |
| 3 | Odd | Prime |
| 9 | Odd | Composite: 3 × 3 |
| 14 | Even | Composite: 2 × 7 |
| 25 | Odd | Composite: 5 × 5 |
Why every prime above two is odd
Suppose a positive even integer is greater than two. It has 1 and itself as divisors, and it also has 2 as a divisor. Because the number is greater than two, that divisor is different from both 1 and the number itself.
It therefore has more than two positive divisors and cannot be prime. The only even integer left as a possible prime is 2, whose positive divisors are exactly 1 and 2.
This proves that being odd is necessary for a prime greater than two. It does not prove that being odd is sufficient. The integer 21 passes the odd test but factors as 3 × 7.
Why one is not prime
The positive divisors of 1 form the one-element set {1}. The definition requires exactly two distinct positive divisors, so 1 is not prime. It is not composite either under the usual definition, which applies to positive integers greater than one.
Zero and negative integers are also outside that elementary prime/composite classification. They still have ordinary parity: zero is even, and −11 is odd. There is no conflict because the two classifications have different starting conditions.
Parity is a useful first filter
To investigate whether 143 is prime, first notice that it is odd, so it is not divisible by two. That removes one possible divisor but leaves others. In fact, 143 = 11 × 13, so it is composite.
For a positive candidate greater than two, an even result settles the question immediately: composite. An odd result means further work is needed. A primality algorithm may test other divisors or use a more advanced method.
The calculator answers the parity question only. If it calls an integer odd, it has not certified the integer prime. Review odd-number rules to see why multiplying odd factors produces so many odd composite numbers.