2014 CHMMC Mixer Round - Caltech Harvey Mudd Mathematics Competition
Source:
February 29, 2024
CHMMCalgebrageometrycombinatoricsnumber theory
Problem Statement
Fermi Questions
p1. What is ? (note: that's radians, not degrees)p2. In liters, what is the volume of million US dollars' worth of gold?p3. How many trees are there on Earth?p4. How many prime numbers are there between and ?p5. What is the total amount of time spent by humans in spaceflight?p6. What is the global domestic product (total monetary value of all goods and services produced in a country's borders in a year) of Bangladesh in US dollars?p7. How much time does the average American spend eating during their lifetime, in hours?p8. How many CHMMC-related emails did the directors receive or send in the last month?
Suspiciously Familiar. . .
p9. Suppose a farmer learns that he will die at the end of the year (day , where today is day ) and that he has sheep. He decides to sell all his sheep on one day, and that his utility is given by where is the money he makes by selling the 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 number. If every day his sheep breed and multiply their numbers by (yes, there are small, fractional sheep), on which day should he sell out?
p10. Suppose in your sock drawer of socks there are different colors and different lengths present. One day, you decide you want to wear two socks that have either different colors or different lengths but not both. Given only this information, what is the maximum number of choices you might have?
I'm So Meta Even This Acronym
p11. Let be the answer of problem , written in lowest terms. Let be the answer of problem , written in lowest terms.
If player wins in problem , let . Otherwise, let .
Two players play a game on a connected graph with vertices and edges. On each player's turn, they remove one edge of the graph, and lose if this causes the graph to become disconnected. Which player (first or second) wins?
p12. Let be the answer of problem , written in lowest terms.
If player wins in problem , let . Otherwise, let .
Find the maximum value of
for .
p13. Let be the answer of problem , written in lowest terms.
Let be the largest integer such that divides .
If player wins in problem , let . Otherwise, let .
Suppose that and
What is ?
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.