Pigeonhole principle problem 104 – math.stackexchange.com

How can I show that if 19 distinct integers are chosen from the sequence 1, 4, 7, 10, 13, 16, 19 . . ., 97, 100, there must be two of them whose sum is 104. What evidence is there? I am having a bit ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Google Facebook Twitter More

• Digg
• Linkedin
• Stumbleupon
• Delicious
• Tumblr
• BufferApp
• Pocket
• Evernote

Unknown