Who else is taking the Putnam Competition and how high were last year's scores?

[gravenewworld]

I can't believe I am going to get up at 830 later today and get ready to take the putnam exam. Test is from 10-1 and 3-6. I hope to get at least 1 question right if I am going to spend 6 hours on a test (I probably could have taken the MCAT for fun instead). I haven't studied for it or anything (which I don't think you should do). So is anyone else a sucker for S&M like myself and taking the exam as well? Does anyone know how how high the highest scores were last year? I heard that if the scores for a year go above 100, the exam makers make the exam impossible the next year so the highest scores are only in the 80s. I hope this year we get an easy test.

 

[BerkMath]

Best of luck to you Graveneworld! Let us know how it went, and if you can bring us some of the questions. My Algebra teacher at Berkeley, Bjorn Poonen, took first place in that competition 4 years in a row! SO INSANE!

 

[neurocomp2003]

your lucky your test starts at 10 when i wrote it it started at 8am BUT free lunch at the expense of the math dept is great.

In my last year the test was easiest... I hated it when you could solve a question only hours after sitting through the 6 hours scratching your head, I swear they need to make those competitions in coffee houses.
Good Luck and remmeber probability and induction.

 

[amcavoy]

When do the results come out (Putnam fellows, winning teams, etc.)? I'm interested to see how a lot of the former IMO medalists do.

 

[abelian]

I don't think you should be posting any of the problems now; there are sunday test-takers also.

 

[gravenewworld]

Are you sure? The website says everyone has to take it today. If anyone in a different country is taking it on Sunday, it is because it is already suday there. It is 1:52 pm right now (east coast US). So i think I am ok to post problems from the 1st half since everyone already has done them.

 

[gravenewworld]

Heres the problem I spent all my time on- Let p(z) be a polynomial with roots having modulus =1 in the complex plane. Let g(z)=P(z)/z^n/2. Prove g'(z)=0 has solutions that have modulus 1.

 

[gravenewworld]

I looked again, and I think it should definitely be safe to post questions. The competition is only for people in Canada and the US, so everyone has already finished the 1st half.

 

[amcavoy]

Heres the problem I spent all my time on- Let p(z) be a polynomial with roots having modulus =1 in the complex plane. Let g(z)=P(z)/z^n/2. Prove g'(z)=0 has solutions that have modulus 1.

I thought these were supposed to be questions that didn't require mathematics knowledge beyond calculus...

 

[gravenewworld]

I thought these were supposed to be questions that didn't require mathematics knowledge beyond calculus...

There is always a lot of advanced stuff on the test. The only basic calculus one was evalute the intergral from 0 to 1 of ln(x+1)/X^2+1 dx.

 

[Archon]

Heres the problem I spent all my time on- Let p(z) be a polynomial with roots having modulus =1 in the complex plane. Let g(z)=P(z)/z^n/2. Prove g'(z)=0 has solutions that have modulus 1.

Two questions:
1) Do "with roots" and "has solutions" mean some roots/solutions or all roots/solutions have modulus 1?
2) Is it g(z)=(P(z)/z^n)/(2) or g(z)=P(z)/(z^n/2)?

 

[amcavoy]

There is always a lot of advanced stuff on the test. The only basic calculus one was evalute the intergral from 0 to 1 of ln(x+1)/X^2+1 dx.

$$\int_{0}^{1}\frac{\ln{\left(x+1\right)}}{x^{2}+1}\,dx$$

Hmm... The only thing I can think of is to rewrite the integrand as:

$$\ln{\left(x+1\right)}\sum_{n=0}^{\infty}\left(-1\right)^nx^{2n}$$

..but that's just throwing it out there; I'm not sure if it's even the right idea. Did anyone actually get this one?

 

[2099]

I got the integral by decomposing the integrand into partial fractions like:
[log(1-i)/(-2i)]/(x+i) + [log(1+i)/(2i)]/(x-i)
(this may not be exactly correct, but it's easy to understand)
from there it is simply knowing the logarithm of a complex number and complex multiplication.
It turns out that the answer is (PI*log 2)/8

 

[amcavoy]

I got the integral by decomposing the integrand into partial fractions like:
[log(1-i)/(-2i)]/(x+i) + [log(1+i)/(2i)]/(x-i)
(this may not be exactly correct, but it's easy to understand)
from there it is simply knowing the logarithm of a complex number and complex multiplication.
It turns out that the answer is (PI*log 2)/8

Interesting. Do you remember any other problems from the exam?

 

[gravenewworld]

Two questions:
1) Do "with roots" and "has solutions" mean some roots/solutions or all roots/solutions have modulus 1?
2) Is it g(z)=(P(z)/z^n)/(2) or g(z)=P(z)/(z^n/2)?

1) If I remember the question correctly, all roots/solution have mod 1
2.) g(z)=P(z)/(z^n/2)


Here are some questions from the second half that I remember.

Let m,n be positive integers. Consider the n-tuple (x1,x2,...,xn) (x1,x2,..,xn are any integers). Let the n-tuples have the property |x1|+...+|xn|<=m. If f(m,n) is the amount of n-tuples that satisfies this property, show that f(m,n)=f(n,m).


Find all intergers n,k1,k2,...,kn such that k1+k2+...+kn=5n-4
and 1/k1 + 1/k2 +...+1/kn=1


Find a polynomial f(x,y) such that f([a],[2a])=0 for any real number a.
[ ] is supposed to be the floor function.

 

[gravenewworld]

Consider a nxn matrix having only entries +/-1. Each row in the matrix is orthogonal to the other. Prove that there is a axb submatrix consisting of only 1s, such that ab<=n. (I'm not sure if i remembered exactly what the question was, so you may not want to rack your brain over this one.)

 

[rachmaninoff]

Consider a nxn matrix having only entries +/-1. Each row in the matrix is orthogonal to the other. Prove that there is a axb submatrix consisting of only 1s, such that ab<=n. (I'm not sure if i remembered exactly what the question was, so you may not want to rack your brain over this one.)

Let a=b=1. :tongue2:

 

[Archon]

Find a polynomial f(x,y) such that f([a],[2a])=0 for any real number a.
[ ] is supposed to be the floor function.

In the same vein as Rachmaninoff's...

f(x,y)=0



I'll actually work on them later...must do homework right now.

 

[gravenewworld]

They probably have to be nontrivial solutions. Again, I probably didn't remember all the details correctly.

 

[abelian]

Putnam questions can be found here (compiled by Valentin of Mathlinks/AoPS). Some of answers can be found here.

 

[shaner-baner]

the polynomial has to be non-zero, let f(x,y)=(y-2x)*(y-2x-1);
the matrix question asks about the largest possible submatrix of all ones given that the rows are all orthogonal with entries plus or minus 1. specifically for every axb submatrix of 1's, prove ab<=n (nxn matrix). The thing is any 2 rows must differ in n/2 places. Following this argument leads to the conclusion that ab<=n, which is what you have to show.

 

[CRGreathouse]

Bernstein has the problems and solutions for many years of the Putnam (including all of 2005):
http://cr.yp.to/mathmisc.html#putnam2005

 

[tongos]

"find all integers n, k1,k2,k3...kn such that k1+k2...+kn=5n-4 and 1/k1+1/k2+...+1/kn=1"

1/k1+1/k2+...+1/kn is minimized when k1=k2=k3=k4...=kn= (5n-4)/n

1/k1=1/k2=...=n/(5n-4)

1/k1+1/k2+...+1/kn= (n^2)/(5n-4)
this is the minimum value so for this to work, we need (n^2)/(5n-4)<1
when n^2<5n-4 when n=1,2,3,4; n^2> 5n-4 when n=(5,6...)
when n=4, k1=k2=k3=k4=4, one solution
now we only need to deal with when n=(1,2,3)