Proof E equal to one
Theorem: e=1
Proof:
2*e = f
2^(2*pi*i)e^(2*pi*i) = f^(2*pi*i)
e^(2*pi*i) = 1
Therefore:
2^(2*pi*i) = f^(2*pi*i)
2=f
Thus:
e=1
Theorem: e=1
Proof:
2*e = f
2^(2*pi*i)e^(2*pi*i) = f^(2*pi*i)
e^(2*pi*i) = 1
Therefore:
2^(2*pi*i) = f^(2*pi*i)
2=f
Thus:
e=1
Theorem: log(-1) = 0
Proof:
a. log[(-1)^2] = 2 * log(-1)
On the other hand:
b. log[(-1)^2] = log(1) = 0
Combining a) and b) gives:
2* log(-1) = 0
Divide both sides by 2:
log(-1) = 0
Theorem: All numbers are equal.
Proof: Choose arbitrary a and b, and let t = a + b. Then
a + b = t
(a + b)(a – b) = t(a – b)
a^2 – b^2 = ta – tb
a^2 – ta = b^2 – tb
a^2 – ta + (t^2)/4 = b^2 – tb + (t^2)/4
(a – t/2)^2 = (b – t/2)^2
a – t/2 = b – t/2
a = b
So all numbers are the same, and math is pointless.
Theorem: 4 = 5
Proof:
-20 = -20
16 – 36 = 25 – 45
4^2 – 9*4 = 5^2 – 9*5
4^2 – 9*4 + 81/4 = 5^2 – 9*5 + 81/4
(4 – 9/2)^2 = (5 – 9/2)^2
4 – 9/2 = 5 – 9/2
4 = 5
Theorem: 1 + 1 = 2
Proof:
n(2n – 2) = n(2n – 2)
n(2n – 2) – n(2n – 2) = 0
(n – n)(2n – 2) = 0
2n(n – n) – 2(n – n) = 0
2n – 2 = 0
2n = 2
n + n = 2
or setting n = 1
1 + 1 = 2
Theorem: 1$ = 10 cent
Proof:
We know that $1 = 100 cents
Divide both sides by 100
$ 1/100 = 100/100 cents
=> $ 1/100 = 1 cent
Take square root both side
=> squr($1/100) = squr (1 cent)
=> $ 1/10 = 1 cent
Multiply both side by 10
=> $1 = 10 cent
Theorem: All positive integers are equal.
Proof: Sufficient to show that for any two positive integers, A and B, A = B.
Further, it is sufficient to show that for all N > 0, if A and B (positive integers) satisfy (MAX(A, B) = N) then A = B.
Proceed by induction.
If N = 1, then A and B, being positive integers, must both be 1. So A = B.
Assume that the theorem is true for some value k. Take A and B with MAX(A, B) = k+1. Then MAX((A-1), (B-1)) = k. And hence (A-1) = (B-1). Consequently, A = B.