keiths Still Proud to be an Ignorant Asshole

keiths, just shut up. Obviously you are just a drooling moron.
Let A = all nonnegative positive even integers
Let B = all positive odd integers
Let C = all nonnegative integers
It is obvious that A + B = C
It is also obvious that neither A nor B = 0. And the equation proves that a does not = C and B does not = C. Yet Cantor sez A=B=C, and you morons bought it!
If cardinality refers to the number of elements in a set, and we add elements to a set, how can the cardinality stay the same?
keiths, just shut up. Obviously you are just a drooling moron.
You insist that {1,2,3,…} is twice as large as {2,4,6,…}. If so, then it should be impossible to set up a onetoone correspondence between them, because the smaller set should run out of elements before the larger one does.LoL! Just cuz you say so! No keiths. The first set will have 2x the elements as the second set FOREVER for infinity.
Yet the mapping F(n) = 2n works just fine, with neither set running out of elements. For every n in {1,2,3,…} there is a 2n in {2,4,6,…}. No leftovers.LoL! Your 2n "mapping" proves my claim you moron. If the first set was not twice as large as the second then you could not use 2n. The fact that it is 2x larger is exemplified by 2n.
Let A = all nonnegative positive even integers
Let B = all positive odd integers
Let C = all nonnegative integers
It is obvious that A + B = C
It is also obvious that neither A nor B = 0. And the equation proves that a does not = C and B does not = C. Yet Cantor sez A=B=C, and you morons bought it!
If cardinality refers to the number of elements in a set, and we add elements to a set, how can the cardinality stay the same?
1 Comments:
At 2:00 AM, Unknown said…
"If cardinality refers to the number of elements in a set, and we add elements to a set, how can the cardinality stay the same?"
You don't understand infinity.
Post a Comment
<< Home