p1. How many ways can we arrange the elements {1,2,...,n} to a sequence a1,a2,...,an such that there is only exactly one ai, ai+1 such that ai>ai+1?
p2. How many distinct (non-congruent) triangles are there with integer side-lengths and perimeter 2012?
p3. Let ϕ be the Euler totient function, and let S={x∣ϕ(x)x=3}. What is ∑x∈Sx1?
p4. Denote f(N) as the largest odd divisor of N. Compute f(1)+f(2)+f(3)+...+f(29)+f(30).
p5. Triangle ABC has base AC equal to 218 and altitude 100. Squares s1,s2,s3,... are drawn such that s1 has a side on AC and has one point each touching AB and BC, and square sk has a side on square sk−1 and also touches AB and BC exactly once each. What is the sum of the area of these squares?
p6. Let P be a parabola 6x2−28x+10, and F be the focus. A line ℓ passes through F and intersects the parabola twice at points P1=(2,−22), P2. Tangents to the parabola with points at P1,P2 are then drawn, and intersect at a point Q. What is m∠P1QP2?
PS. You had better use hide for answers. algebrageometrycombinatoricsnumber theoryBmtBerkeley Math Tournament