divisibility independence – mathoverflow.net

The following is a standard combinatorics question: Any set of $n+1$ numbers from $1, \dotsc, 2n$ contains a pair of numbers $a, b$ where $a \left| b \right.$ The argument is by pigeonhole ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Google Facebook Twitter More

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

Unknown