MathDB
2014 CHMMC Mixer Round - Caltech Harvey Mudd Mathematics Competition

Source:

February 29, 2024
CHMMCalgebrageometrycombinatoricsnumber theory

Problem Statement

Fermi Questions
p1. What is sin(1000)\sin (1000)? (note: that's 10001000 radians, not degrees)
p2. In liters, what is the volume of 1010 million US dollars' worth of gold?
p3. How many trees are there on Earth?
p4. How many prime numbers are there between 10810^8 and 10910^9?
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 365365, where today is day 00) and that he has 100100 sheep. He decides to sell all his sheep on one day, and that his utility is given by abab where aa is the money he makes by selling the sheep (which always have a fixed price) and bb is the number of days he has left to enjoy the profit; i.e., 365k365 - k where kk is the day number. If every day his sheep breed and multiply their numbers by (421+b)/421(421 + b)/421 (yes, there are small, fractional sheep), on which day should he sell out?
p10. Suppose in your sock drawer of 1414 socks there are 55 different colors and 33 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 st\frac{s}{t} be the answer of problem 1313, written in lowest terms. Let pq\frac{p}{q} be the answer of problem 1212, written in lowest terms. If player 11 wins in problem 1111, let n=qn = q. Otherwise, let n=pn = p. Two players play a game on a connected graph with nn vertices and tt 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 st\frac{s}{t} be the answer of problem 1313, written in lowest terms. If player 11 wins in problem 1111, let n=tn = t. Otherwise, let n=sn = s. Find the maximum value of xn1+12x+14x2+...+122nx2n\frac{x^n}{1 + \frac12 x + \frac14 x^2 + ...+ \frac{1}{2^{2n}} x^{2n}} for x>0x > 0.
p13. Let pq\frac{p}{q} be the answer of problem 1212, written in lowest terms. Let yy be the largest integer such that 2y2^y divides pp. If player 11 wins in problem 1111, let z=qz = q. Otherwise, let z=pz = p. Suppose that a1=1a_1 = 1 and an+1=anzn+2+2zn+1zna_{n+1} = a_n -\frac{z}{n + 2}+\frac{2z}{n + 1}-\frac{z}{n} What is aya_y?
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.