p1. Compute
(63+112+175)(−63+112+175)(63−112+175)(63+112−175)
p2. Consider the set S={0,1,2,3,4,5,6,7,8,9}. How many distinct 3-element subsets are there such that the sum of the elements in each subset is divisible by 3?
p3. Let a2 and b2 be two integers. Consider the triangle with one vertex at the origin, and the other two at the intersections of the circle x2+y2=a2+b2 with the graph ay=b∣x∣. If the area of the triangle is numerically equal to the radius of the circle, what is this area?
p4. Suppose f(x)=x3+x−1 has roots a, b and c. What is 1−aa3+1−bb3+1−cc3?
p5. Lisa has a 2D rectangular box that is 48 units long and 126 units wide. She shines a laser beam into the box through one of the corners such that the beam is at a 45o angle with respect to the sides of the box. Whenever the laser beam hits a side of the box, it is reflected perfectly, again at a 45o angle. Compute the distance the laser beam travels until it hits one of the four corners of the box.
p6. How many ways can we form a group with an odd number of members (plural) from 99 people total?
Express your answer in the form ab+c, where a, b, and c are integers, and a is prime.
p7. Let S=log29log316log425...log9991000000. Compute the greatest integer less than or equal to log2S.
p8. A prison, housing exactly four hundred prisoners in four hundred cells numbered 1-400, has a really messed-up warden. One night, when all the prisoners are asleep and all of their doors are locked, the warden toggles the locks on all of their doors (that is, if the door is locked, he unlocks the door, and if the door is unlocked, he locks it again), starting at door 1 and ending at door 400. The warden then toggles the lock on every other door starting at door 2 (2, 4, 6, etc). After he has toggled the lock on every other door, the warden then toggles every third door (doors 3, 6, 9, etc.), then every fourth door, etc., finishing by toggling every 400th door (consisting of only the 400th door). He then collapses in exhaustion.
Compute the number of prisoners who go free (that is, the number of unlocked doors) when they wake up the next morning.
p9. Let A and B be fixed points on a 2-dimensional plane with distance AB=1. An ant walks on a straight line from point A to some point C on the same plane and finds that the distance from itself to B always decreases at any time during this walk. Compute the area of the locus of points where point C could possibly be located.
p10. A robot starts in the bottom left corner of a 4×4 grid of squares. How many ways can it travel to each square exactly once and then return to its start if it is only allowed to move to an adjacent (not diagonal) square at each step?
p11. Assuming real values for p, q, r, and s, the equation x4+px3+qx2+rx+s has four non-real roots. The sum of two of these roots is 4+7i, and the product of the other two roots is 3−4i. Find q.
p12. A cube is inscribed in a right circular cone such that one face of the cube lies on the base of the cone. If the ratio of the height of the cone to the radius of the cone is 2:1, what fraction of the cone's volume does the cube take up? Express your answer in simplest radical form.
p13. Let y=1+9+5+9+5+...11111
If y can be represented as dab+c, where b is not divisible by the square of any prime, and the greatest common divisor of a and d is 1, find the sum a+b+c+d.
p14. Alice wants to paint each face of an octahedron either red or blue. She can paint any number of faces a particular color, including zero. Compute the number of ways in which she can do this. Two ways of painting the octahedron are considered the same if you can rotate the octahedron to get from one to the other.
p15. Find n in the equation 1335+1105+845+275=n5, where n is an integer less than 170.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here. CHMMCalgebracombinatoricsgeometrynumber theory