2014 CHMMC Individual - Caltech Harvey Mudd Mathematics Competition
Source:
March 12, 2024
CHMMCalgebrageometrycombinatoricsnumber theory
Problem Statement
p1. In the following by grid, are numbers such that the sum of each row is listed at the right and the sum of each column is written below it:
https://cdn.artofproblemsolving.com/attachments/d/9/4f6fd2bc959c25e49add58e6e09a7b7eed9346.png
What is ?
p2. Suppose in your sock drawer of socks there are 5 different colors and different lengths present. One day, you decide you want to wear two socks that have both different colors and different lengths. Given only this information, what is the maximum number of choices you might have?
p3. The population of Arveymuddica is , which is divided into some number of equal groups. During an election, each person votes for one of two candidates, and the person who was voted for by or more of the group wins. When neither candidate gets of the vote, no one wins the group. The person who wins the most groups wins the election. What should the size of the groups be if we want to minimize the minimum total number of votes required to win an election?
p4. A farmer learns that he will die at the end of the year (day , where today is day ) and that he has a number of sheep. He decides that his utility is given by ab where a is the money he makes by selling his sheep (which always have a fixed price) and is the number of days he has left to enjoy the profit; i.e., where is the day. If every day his sheep breed and multiply their numbers by (yes, there are small, fractional sheep), on which day should he sell them all?
p5. Line segments and are tangent to a convex arc and . If , find the length of arc .
p6. Suppose that you start with the number and always have two legal moves:
Square the number
Add one if the number is divisible by or multiply by otherwise
How many sequences of moves are there that return to a multiple of ?
p7. A robot is shuffling a card deck. Being very well machined, it does every shuffle in exactly the same way: it splits the deck into two piles, one containing the cards from the bottom of the deck and the other with the cards from the top. It then interleaves the cards from the two piles, starting with a card from the bottom of the larger pile at the bottom of the new deck, and then alternating cards from the two piles while maintaining the relative order of each pile. The top card of the new deck will be the top card of the bottom pile. The robot repeats this shuffling procedure a total of n times, and notices that the cards are in the same order as they were when it started shuffling. What is the smallest possible value of ?
p8. A secant line incident to a circle at points and intersects the circle's diameter at point with a angle. If the length of is and the length of is , then what is the circle's radius?
p9. If a complex number satisfies , then what is ?
p10. Let be two acute angles where . Find the maximum possible value of .
p11. A pyramid, represented by has parallelogram as base ( is across from ) and vertex . Let the midpoint of edge be . Consider plane where is on edge and is on edge . Find the minimum value and maximum value of where is the volume of pyramid and is the volume of pyramid . Express your answer as an ordered pair .
p12. A grid is missing one of its main diagonals. In how many ways can we place pieces on the grid such that no two pieces share a row or column?
p13. There are cities in a country, some of which have highways connecting them. Each highway goes from one city to another, both ways. There is no way to start in a city, drive along the highways of the country such that you travel through each city exactly once, and return to the same city you started in. What is the maximum number of roads this country could have?
p14. Find the area of the cyclic quadrilateral with side lengths given by the solutions to
p15. Suppose that we know and for all integers , and that
Find .
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.