Theorem Jokes / Recent Jokes

Ginsberg's Theorem: 1. You can't win. 2. You can't break even. 3. You can't even quit the game.

The use of a program to prove the 4-color theorem will not change mathematics - it merely demonstrates that the theorem, a challenge for a century, is probably not important to mathematics.

Flugg's Law: When you need to knock on wood is when you realize that the world is composed of vinyl, naugahyde and aluminum.
Fourth Law of Applied Terror: The night before the English History mid-term, your Biology instructor will assign 200 pages on planaria. Corollary: Every instructor assumes that you have nothing else to do except study for that instructor's course.
Fourth Law of Revision: It is usually impractical to worry beforehand about interferences; if you have none, someone will make one for you.
Franklin's Rule: Blessed is the end user who expects nothing, for he/she will not be disappointed.
Freeman's Commentary on Ginsberg's theorem: Every major philosophy that attempts to make life seem meaningful is based on the negation of one part of Ginsberg's Theorem. To wit: 1. Capitalism is based on the assumption that you can win. 2. Socialism is based on the assumption that you can break even. 3. Mysticism is based on the assumption that you can quit the more...

Theorem: 1 = -1Proof: 1 = sqrt(1) = sqrt(-1 * -1) = sqrt(-1) * sqrt(-1) = 1^ = -1Also one can disprove the axiom that things equal to the same thing are equal to each other. 1 = sqrt(1)-1 = sqrt(1)Therefore 1 = -1As an alternative method for solving: Theorem: 1 = -1Proof: x=1x^2=xx^2-1=x-1(x+1)(x-1)=(x-1)(x+1)=(x-1)/(x-1)x+1=1x=00=1=> 0/0=1/1=1

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.

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.

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.