Okay, we've all seen the proofs that 1=2, and generally, the reason is because the proof makes unobtrusive use of dividing by 0 or squares of i
Anyway, Let's prove that *every* counting number
(i.e. 1, 2, 3, 4, . . .)
*every* counting number can be uniquely described by 13 words or less.
Now, obviously this isn't true, because there are a finite number of words and an infinite number of counting numbers. i.e. if there are 1 million words, then there are (only) 1 million ^13th power unique combinations of 13 words, 1 million^12 unique combinations of 12 words, . . . A huge number, but a finite number nonetheless.
Proof anyway:
1. Lets assume that there *are* counting numbers that can't be uniquely described by 13 words or less.
2. Then, there must be a smallest such counting number that cannot be described in 13 words or less. Lets call it x
3. But now, x is "the smallest counting number which cannot be described in thirteen words or less" [count them... 13 words]
4. This is a contradiction. Therefore, the assumption in statement one must be incorrect. Thus, all counting numbers must be able to be uniquely described.
No googling, find the error.
Anyway, Let's prove that *every* counting number
(i.e. 1, 2, 3, 4, . . .)
*every* counting number can be uniquely described by 13 words or less.
Now, obviously this isn't true, because there are a finite number of words and an infinite number of counting numbers. i.e. if there are 1 million words, then there are (only) 1 million ^13th power unique combinations of 13 words, 1 million^12 unique combinations of 12 words, . . . A huge number, but a finite number nonetheless.
Proof anyway:
1. Lets assume that there *are* counting numbers that can't be uniquely described by 13 words or less.
2. Then, there must be a smallest such counting number that cannot be described in 13 words or less. Lets call it x
3. But now, x is "the smallest counting number which cannot be described in thirteen words or less" [count them... 13 words]
4. This is a contradiction. Therefore, the assumption in statement one must be incorrect. Thus, all counting numbers must be able to be uniquely described.
