Print Story Prospects
Logic & Maths
By damballah (Sat Jan 24, 2004 at 05:40:26 PM EST) (all tags)
Show that if you pick (n+1) numbers between [n, 2n], there are at least 2 numbers that are relatively prime.


The proof is easy enough, it's the result that I find nice.

Been browsing USENET a lot lately. Mostly math and computer security-related stuff. One thing I discovered: my ISP doesn't list linux.kernel, which really sucks.

Grad school prospects seem hopeful. For once, it seems that I have found what potentially interests me: numerical methods. It is a nice field because it combines equal amounts of CS and math geekery. All I need is the top grades, the nice letters of referral, and the funding.

Oh, and I found this interesting guide to insulting a CS major. It's an entertaining read.

< Drunken elephants die by electrocution | BBC White season: 'Rivers of Blood' >
Prospects | 2 comments (2 topical, 0 hidden) | Trackback
How about I punch you in the arm until YOU do it by Rogerborg (6.00 / 3) #1 Sat Jan 24, 2004 at 09:15:39 PM EST
Also, hand over your lunch money.

-
Metus amatores matrum compescit, non clementia.


Do what? by damballah (3.00 / 0) #2 Sun Jan 25, 2004 at 04:02:13 AM EST
The proof? It stems from the pigeonhole principle.

If you pick (n+1) numbers from a total of 2n numbers, there are at least two that are consecutive. Consecutive numbers have no common factor. Hence we are done.

No need to steal my lunch me.

[ Parent ]

Prospects | 2 comments (2 topical, 0 hidden) | Trackback