Recent content by dyrich

In order to use the well ordering principal the set must be non-empty. Since the set isn't finite, it can't possibly be empty and thus we can use the well ordering principal. Was this the point?

I originally tried that way (using the well ordering principal), where I got stuck was proving the surjection of f(n)=a_n . That's why I switched to the method that I posted. Any suggestions would be helpful. I know that it would start by saying let a_n \in A for an n \in \mathbb{N} . But...

Homework Statement Every subset of \mathbb{N} is either finite or has the same cardinality as \mathbb{N} Homework Equations N/A The Attempt at a Solution Let A \subseteq \mathbb{N} and A not be finite. \mathbb{N} is countable, trivially, which means there is a bijective...

You can do it the way you suggested (it is logically correct), but I believe it will make more work for yourself (but I didn't look at it because there is a cleaner way). Here are a few hints that should help: Remember that the expected value function is a linear operator so...