2013 CHMMC Individual - Caltech Harvey Mudd Mathematics Competition
Source:
March 12, 2024
CHMMCalgebracombinatoricsgeometrynumber theory
Problem Statement
p1. Compute
p2. Consider the set . How many distinct -element subsets are there such that the sum of the elements in each subset is divisible by ?
p3. Let and be two integers. Consider the triangle with one vertex at the origin, and the other two at the intersections of the circle with the graph . If the area of the triangle is numerically equal to the radius of the circle, what is this area?
p4. Suppose has roots , and . What is
p5. Lisa has a rectangular box that is units long and units wide. She shines a laser beam into the box through one of the corners such that the beam is at a 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 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 people total?
Express your answer in the form , where , , and are integers, and is prime.
p7. Let Compute the greatest integer less than or equal to .
p8. A prison, housing exactly four hundred prisoners in four hundred cells numbered -, 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 and ending at door . The warden then toggles the lock on every other door starting at door (, , , etc). After he has toggled the lock on every other door, the warden then toggles every third door (doors , , , etc.), then every fourth door, etc., finishing by toggling every th door (consisting of only the th 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 and be fixed points on a -dimensional plane with distance . An ant walks on a straight line from point to some point on the same plane and finds that the distance from itself to always decreases at any time during this walk. Compute the area of the locus of points where point could possibly be located.
p10. A robot starts in the bottom left corner of a 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 , , , and , the equation has four non-real roots. The sum of two of these roots is , and the product of the other two roots is . Find .
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 , what fraction of the cone's volume does the cube take up? Express your answer in simplest radical form.
p13. Let
If can be represented as , where is not divisible by the square of any prime, and the greatest common divisor of and is , find the sum .
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 in the equation where is an integer less than .
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.