Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
I am very fond of Goodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance herehere.
I am very fond of Goodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance here.
I am very fond of Goodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance here.
I am very fond of Goodstein's theoremGoodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance http://en.wikipedia.org/wiki/Goodstein%27s_theoremhere.
I am very fond of Goodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance http://en.wikipedia.org/wiki/Goodstein%27s_theorem.
I am very fond of Goodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance here.
I am very fond of Goodstein's theorem and especially of its proof, using ordinal arithmetic to prove that an integer sequence (which at first sight seems hopelessly increasing) is ultimately zero. See for instance http://en.wikipedia.org/wiki/Goodstein%27s_theorem.
