2007-08-20 18:17:45 · 7 answers · asked by Anonymous in Science & Mathematics ➔ Mathematics
Yes.
An odd number leaves the remainder 1 when divided by 2.
A number divisible by 2 leaves the remainder 0 when divided by 2.
When the remainder is 1, it cannot be 0, therefore there is no odd number divisible by 2.
2007-08-21 01:16:37 · answer #1 · answered by Anonymous · 0⤊ 0⤋
By definition, an odd number is made by the following equation: 2n+1, whereas an even number, is made by just 2n. Also by definition, an even number is multiple of two, and if the converse were true, then an odd number would be an even number. And therefore, a number divisible by 2 must be an even number, which means it cannot be an odd number, because there are only two ways to categorize them.
2007-08-20 18:28:11 · answer #2 · answered by Brian 4 · 0⤊ 1⤋
odd number is in the sequence of 1, 3, 5, 7, 9, etc...
which means its function is (2n + 1) where n is 1,2,3,4,5,....
so, separate the 2n + 1 ;
2n / 2 = n......which means it is always divisible by 2.
but 1 / 2 = 0.5.....which means it is not divisible by 2.
therefore, there is no odd number divisible by 2!
2007-08-20 18:31:01 · answer #3 · answered by Kentz 1 · 0⤊ 0⤋
any no. multiplied by 2 is surely an even no.
so even + 1 = odd no.
any no. which is 2n is always divisible be 2 but +1 is 1 more that is 1 is the remainder .
2007-08-20 18:27:16 · answer #4 · answered by sv1973 2 · 0⤊ 1⤋
Sure.
The definition of "odd integer" is "an integer which is not divisible by 2."
Therefore, by the definition of an odd integer, there is no odd integer which is divisible by 2.
2007-08-20 19:56:06 · answer #5 · answered by Anonymous · 1⤊ 0⤋
No. This is a definition.
2007-08-20 18:28:10 · answer #6 · answered by Helmut 7 · 1⤊ 0⤋
i don't know, but i will diffidently ask my math teacher
2007-08-20 18:24:32 · answer #7 · answered by Anonymous · 0⤊ 2⤋