Odd Sums of Consecutive Odds | The Everything Seminar

]]>Furthermore instead of coin toss It could be a random element generator from any set. For example each person could Have a ordinal number.

]]>D-module Basics I | The Everything Seminar

]]>Odd Sums of Consecutive Odds | The Everything Seminar

]]>Odd Sums of Consecutive Odds | The Everything Seminar

]]>Odd Sums of Consecutive Odds | The Everything Seminar

]]>Odd Sums of Consecutive Odds | The Everything Seminar

]]>So say you have set a that contains a countable infinite number of sets of countable infinities, creating the set of all sets that have one member of each of those is possible, right?

I can see a possible difficulty as you get to higher ordinals, but intuition tells me that if you can solve it for the first few ordinals, the rest would come inductively.

]]>