科研之友
微信
新浪微博
Facebook
分享链接
摘要
We give a short, explicit proof of Hindman%26apos;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%26apos;s Theorem.
- 出版日期2012
