Give a proof by contradiction for the following statement.
There is no integer that is both even and odd.
(Of course we know this ==)
Proof: (What?!)
[We take the negation of the statement and suppose it to be true.]
(Isn't it true already? ==)
Suppose there is an integer x that is both even and odd.
(wookay... then?)
By definition of even numbers,
x=2k1, where k1 is an integer
By definition of odd numbers,
x=2k2+1, where k2 is an integer
(But then both are different wor zzz...)
2k1=2k2+1
(k1+k2)=1/2
(k1+k2) is an integer but 1/2 is not an integer.
A subtraction of integer numbers should be integer number.
--> Contradiction happens.
(Like this also can?!)
Therefore there is no integer that is both even and odd.
(... ... ... ... ... ... ... ... ... ...)
This is just one of the sample that is easier to understand by everyone. We had more tak-tau-apa-macam-proof contradictions last semester in Real Analysis. ==

5 comments:
lolx. recall my uni's year of suffering engineering math
rupa rupanya u r a pure math student.
Pek Chek Kia
haha... you guys pro, engineering... we're not pro-ians~ XD
蛋撻兔
no no no... i'm industrial math student... different =p
Should be (K1-K2).. Anyway, I believe this is the way to prove the statement. And I agree that Mathematicians are stubborn and like to "zhuan niu jiao jian". That's why we have our Maths today. Haha.. Cheers
haha~ thanks jie xian jie for the correction~~~
Post a Comment