p1. Let X,Y,Z be nonzero real numbers such that the quadratic function Xt2−Yt+Z=0 has the unique root t=Y . Find X.
p2. Let ABCD be a kite with AB=BC=1 and CD=AD=2. Given that BD=5, find AC.
p3. Find the number of integers n such that n−2016 divides n2−2016. An integer a divides an integer b if there exists a unique integer k such that ak=b.
p4. The points A(−16,256) and B(20,400) lie on the parabola y=x2 . There exists a point C(a,a2) on the parabola y=x2 such that there exists a point D on the parabola y=−x2 so that ACBD is a parallelogram. Find a.
p5. Figure F0 is a unit square. To create figure F1, divide each side of the square into equal fifths and add two new squares with sidelength 51 to each side, with one of their sides on one of the sides of the larger square. To create figure Fk+1 from Fk , repeat this same process for each open side of the smallest squares created in Fn. Let An be the area of Fn. Find limn→∞An.
https://cdn.artofproblemsolving.com/attachments/8/9/85b764acba2a548ecc61e9ffc29aacf24b4647.png
p6. For a prime p, let Sp be the set of nonnegative integers n less than p for which there exists a nonnegative integer k such that 2016k−n is divisible by p. Find the sum of all p for which p does not divide the sum of the elements of Sp .
p7. Trapezoid ABCD has AB∥CD and AD=AB=BC. Unit circles γ and ω are inscribed in the trapezoid such that circle γ is tangent to CD, AB, and AD, and circle ω is tangent to CD, AB, and BC. If circles γ and ω are externally tangent to each other, find AB.
p8. Let x,y,z be real numbers such that (x+y)2+(y+z)2+(z+x)2=1. Over all triples (x,y,z), find the maximum possible value of y−z.
p9. Triangle △ABC has sidelengths AB=13, BC=14, and CA=15. Let P be a point on segment BC such that CPBP=3, and let I1 and I2 be the incenters of triangles △ABP and △ACP. Suppose that the circumcircle of △I1PI2 intersects segment AP for a second time at a point X=P. Find the length of segment AX.
p10. For 1≤i≤9, let Ai be the answer to problem i from this section. Let (i1,i2,...,i9) be a permutation of (1,2,...,9) such that Ai1<Ai2<...<Ai9. For each ij , put the number ij in the box which is in the jth row from the top and the jth column from the left of the 9×9 grid in the bonus section of the answer sheet. Then, fill in the rest
of the squares with digits 1,2,...,9 such that
∙ each bolded 3×3 grid contains exactly one of each digit from 1 to 9,
∙ each row of the 9×9 grid contains exactly one of each digit from 1 to 9, and
∙ each column of the 9×9 grid contains exactly one of each digit from 1 to 9.
PS. You had better use hide for answers. algebrageometrycombinatoricsnumber theoryLMT