The 68th annual Putnam Math Contest

all mah putnam niggas throw ya grinz up!

B1 was da shizzl'.

I got pwnt, lol.

I got 4 solutions for A1, but couldn't throw out the 2 extraneous ones in time.

B1 was a lot easier than it seems.

B3 was insane; I didn't get it.  One of my genius friends saw the solution, but couldn't prove it, or put it in closed form.  After getting home, I rearranged his solution into closed form, and now that I have access to mathematica, I was able to show that he was right.

Now that the fun's over, I need to get back to graduate apps/hating life.

B1 was easy. First I proved the 'if'. Then I proved the 'only if'.

>>2

What closed form for B3 did your friend get?

I changed his answer to a closed form.

(1/2 + 1/sqrt(5))[(3+sqrt(5))ⁿ]+(1/2 - 1/sqrt(5))[(3-sqrt(5))ⁿ]

With the problem's specifications, n = 2007

Anybody got a link to the paper?

NO FUCKING PAPER? NO WONDER YOU AMERICAN TWATS ARE SO TERRIBLE AT THE IMO. FUCK YOU GUYS.

I liked I think it was A3, the one about arranging the 3k+1 integers.

>>9
The solution to that was actually pretty simple; too bad I didn't figure it out in time :(

>>9 here:

I love combinatorics. For a long time I thought I was gonna be more applied, but I really really like combinatorics, and am pretty good at it too.

PAPER PLEASE.