![]() |
![]() |
|
![]() |
![]() |
Encyclopedia :
E :
EV :
EVE :
Even & odd numbers |
|
|
Even & odd numbersIn mathematics, any integer (whole number) is either even or odd. If it is a multiple of two, it is an even number; otherwise, it is an odd number. Examples of even numbers are −4, 8, 0, and 70. Examples of odd numbers are −5, 1, and 71. The number zero is even, because it is equal to two multiplied by zero.The set of even numbers can be written:
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, a number expressed in the binary numeral system 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 in the ring of integers, but the odd numbers do not. An integer is even if it is congruent to 0 modulo this ideal, in other words if it is congruent to 0 modulo 2, and odd if it is congruent to 1 modulo 2. All prime numbers are odd, with one exception: the prime number 2. All known perfect numbers are even; it is unknown whether any odd perfect numbers exist. Goldbach's conjecture states that every even integer greater than 2 can be represented as a sum of two prime numbers. In wind instruments which are cylindrical and in effect closed at one end, such as the clarinet at the mouthpiece, the harmonics produced are odd multiples of the fundamental frequency. See harmonic series. Arithmetic on even and odd numbers The following laws can be verified using the properties of divisibility and the fact that 2 is a prime number: Addition and subtraction
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:
The parity of a permutation (as defined in abstract algebra) is the parity (even or odd) of the number of transpositions into which the permutation can be decomposed. For example (ABC) to (BCA) is even because it can be done by swapping A and B then C and A (two transpositions). It can be shown that no permutation can be decomposed both in an even and in an odd number of transpositions. Hence the above is a suitable definition. See the article on even and odd permutations for an elaboration. See also
|
|
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License. |
|
| © 2008 Chamas Enterprises Inc. |