If there are an infinite number of owls, how many owl eyes are there?
Ah! You should have posted this over in puzzles, rather than here. But at least this gives me the opportunity to do one of my favorite things: disagree with virtually everyone who has posted.
Wrong.
an infinite number.
Wrong.
The same degree of infinity as their are owles. Did I miss the infinite owl part of the commentary?
Wrong.
Have fun with infinity!
infintity * 2 = infintity. Now we divide both sides by infintity.
1 * 2 = 1. Now where is my $1m?
Wrong.
If by "isomorphic" you mean "has the same cardinality as", that's right. The following sets all have the same cardinality...
[snip]
... Which is just a different way of saying what I said, since the set of countable ordinal numbers corresponds exactly to the unique ways of well ordering a countable set.
So on one hand we have the cardinality of the reals 2^(Aleph Null) (commonly referred to as c). We know this is bigger than Aleph Null, but we don't know how big it is....
[snip]...
Without CH there's no guarantee that c=Aleph-One. Aleph-One is still Aleph-One, but it's possible for c to equal (almost) anything strictly greater than Aleph-One: c could be Aleph-Two, Aleph-Three, Aleph-53489527, or much much bigger.
Impressively complicated, but
wrong.
... The well orderings of a countable set are at least of size c.
Take the set of all well orderings of N.
For each element in this set, throw out all members of this well-ordering that don't begin with a 1. You'll be left with something that looks like <11, 103,19157327,1,.......>
Throw away the inital 1 to get <1, 03,9157327,,.......>.
Now glue all these digits together preceded by a '0.' .
In the example I used you'd get 0.1 03 9157327 ....
This mapping from the set of well orderings to [0,1) is obviously onto, as given a [latex] n \in [0,1) [/latex] it is trivial to generate a well ordering which would be mapped onto it. Hence (the number of well orderings on N) is >=c...
Also impressive, and also
wrong.
...
In general, consider a set of cardinality aleph_n. The cardinality of unique ways of well ordering such a set will always be aleph_(n+1).
It looks like you're talking about all the different permutations of N. This is definitely different from talking about the set of different ways of well ordering the natural numbers.
Say we have the following orders on N = {0,1,2,3,...} ...
[snip]
... Some different ways of well ordering the natural numbers:
(1,2,3,...,0)
This is not order isomorphic with the standard ordering because there is one element (0) that is preceded by infinitely many elements. This is not the case in the standard ordering of N.
Another way would be...
[snip]
... More:
(3,4,5,6,7,...,0,1,2)
(1,3,5,7,...,2,4,6,8,10,...) (all the odds (in standard order) followed by all the evens) ...
[snip]
...
These aren't necessarily the same. The continuum hypothesis says 2^(aleph null)=aleph one, but the continuum hypothesis may be false.
What we do know:
Aleph one is the next cardinal immediately after Aleph null. Aleph one is also ... [snip]
Even more complicated, but still
wrong.
Please remember that infinite is not a fixed constant but merely an unapproachable limit. In a lot of calculations you can ... [snip]
Wrong.
All of you are over-looking the obvious and making an unwarranted assumption. No amount of erudite disposition on infinity will change that.
It doesn't matter what kind of infinity we are talking about -- countably infinite, uncountably infinite, aleph null, or whatever. That is because the answer to the question of how many eyes there are in a set of infinite owls is
not infinity.
Now, I will grant that it is
possible for there to be an infinite number of owl eyes on infinite owls. B t that is not the only possibility. It is also possible that there are only a
finite number of eyes. Any finite number you care to name is a possibility -- and, given the lack of information in the puzzle, as reasonable a possibility as an infinite number.
Let me make this simple by taking only one owl to start with. This owl was in a fight in its youth, and one of its two eyes was plucked out. How many eyes does this owl have? I think any reasonable person will answer,
one. It is a one-eyed owl.
You don't even have to be reasonable to know that. Heck, even I would say it has one eye.
Okay, we've established the principle. Now let's consider the actual case I'm interested in. Imagine an owl which had an unfortunate accident (was flying with scissors, despite its mother's warning never to do this) and poked out
both its eyes. How many eyes does this owl have? Answer: if an owl which has lost one of two eyes is a one-eyed owl, then an owl which has lost both of its eyes is a no-eyed owl. The number of eyes it has is zero.
In order for there to be an infinite number of eyes on an infinite number of owls, it is necessary that an infinite number of owls have eyes. But in the problem as stated, there is nothing that requires
any of the owls to have eyes.
If the puzzle stated that each owl has at least one eye, the discussion of an infinite number of eyes would be justified. Or, if it stated that there are only a finite number of owls lacking both eyes, then again talk of infinite eyes would be justified. But that was not stated, and
cannot simply be assumed.
Therefore the correct answer to the question of how many eyes an infinite number of owls have is:
We don't know. There is not enough information.