What is an Even Number?
An even number is any integer that is exactly divisible by 2, meaning it leaves no remainder when divided by 2. Mathematically, a number n is even if and only if n = 2k for some integer k. The sequence of even numbers is: 0, 2, 4, 6, 8, 10, 12, and so on. Even numbers and odd numbers alternate on the number line, forming the two fundamental parity classes of integers.
Even numbers include both positive and negative integers. For example, −4, −2, 0, 2, 4 are all even. Zero is considered even because 0 = 2 × 0, and it satisfies all the properties of even numbers (it is divisible by 2 with no remainder). This is sometimes a source of confusion, but mathematically, zero’s evenness is well-established and universally agreed upon.
Properties of Even Numbers
Even numbers have several important arithmetic properties. The sum of two even numbers is always even (e.g., 4 + 6 = 10). The sum of two odd numbers is also even (e.g., 3 + 5 = 8). The sum of an even and an odd number is always odd (e.g., 4 + 3 = 7). The product of any integer and an even number is always even. These simple rules are the foundation of parity arguments, a powerful technique in mathematical proofs.
In binary representation, even numbers always end in 0, while odd numbers end in 1. This makes checking parity in computer programs extremely efficient — a single bitwise AND operation (n & 1) reveals whether a number is even or odd. This operation takes just one CPU clock cycle, making it one of the fastest possible computations.
Even Numbers in Mathematics
Even numbers play a central role in number theory and algebra. The only even prime number is 2 — every other even number is divisible by 2 and therefore composite. Goldbach’s conjecture, one of the oldest unsolved problems in mathematics, states that every even integer greater than 2 can be expressed as the sum of two primes. This has been verified computationally for all even numbers up to 4 × 1018.
In group theory, the even integers form a subgroup of the integers under addition. In combinatorics, the parity of permutations (whether a permutation is even or odd) determines the sign of a determinant and is fundamental to understanding symmetric and alternating groups.