Abstract
We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several examples of colorings of the integers which do not have computable witnesses to Hindman's Theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have