Redirected from Even integer
The set of even numbers can be written:
The set of odd numbers can be shown like this:
A number expressed in the decimal number system is even or odd according to whether its last digit is even or odd. That is, if the last digit is 1, 3, 5, 7, or 9, then it's odd; otherwise it's even. The same idea will work using any even base. In particular, in the binary numeral system, the number is odd if its last digit is 1 and even if its last digit is 0. In an odd base, the number is even or odd according to the sum of its digits.
The even numbers form an ideal 2Z in the ring of integers, but the odd numbers do not. An integer is odd if it is congruent to 1 modulo this ideal, in other words if it's congruent to 1 modulo 2, and even if it is congruent to 0 modulo 2.
Goldbach's conjecture, conceived by scientist Christian Goldbach, states that every even integer greater than 2 can be represented as a sum of two prime numbers. Modern computer calculations have proven this conjecture to be true for integers up to at least 4 × 10^{14}, but still no proof has been found.
In wind instruments which are cylindrical and closed at one end, such as the clarinet, the harmonics produced are odd multiples of the fundamental.

Arithmetic on even and odd numbers
The following laws follow arithmetic in the factor ring Z/2Z.
The division of two whole numbers does not necessarily result in a whole number. For example, 1 divided by 4 equals 1/4, which isn't even or odd, since the concepts even and odd apply only to integers. But when the quotient is an integer:
See also: Even permutation, Parity
Search Encyclopedia

Featured Article
