I just wanted to know if there was a proof that every prime number greater than 2 was odd. Thanks.
Surely! This is quite a simple one, as well - simply note that any even (not odd) number can be written as $\displaystyle 2n$ for some $\displaystyle n\in \mathbb{N}$. But then 2 divides that number, thus it is not prime.
I just wanted to know if there was a proof that every prime number greater than 2 was odd. Thanks.
Prove by contradiction.
Suppose there was a prime number greater than two that wasn't odd. Then it must be even, and therefore it must have two as a factor and hence is not prime. This contradicts our assumption and so we conclude that all primes greater than 2 are odd.