2012 Fall CHMMC Mixer Round - Caltech Harvey Mudd Mathematics Competition
Source:
February 29, 2024
CHMMCalgebrageometrycombinatoricsnumber theory
Problem Statement
p1. Prove that is the only real number satisfying .
p2. Show that is an integer.
p3. Two players and play a game on a round table. Each time they take turn placing a round coin on the table. The coin has a uniform size, and this size is at least times smaller than the table size. They cannot place the coin on top of any part of other coins, and the whole coin must be on the table. If a player cannot place a coin, he loses. Suppose starts first. If both of them plan their moves wisely, there will be one person who will always win. Determine whether or will win, and then determine his winning strategy.
p4. Suppose you are given pegs arranged in a square on a board. A “move” consists of picking up a peg, reflecting it through any other peg, and placing it down on the board. For how many integers is it possible to arrange the pegs into a larger square using exactly moves? Justify your answers.
p5. Find smallest positive integer that has a remainder of when divided by , a remainder of when divided by , a remainder of when divided by , and a remainder of when divided by .
p6. Find the value of
where means is divisible by .
p7. What is the value of
p8. An -term sequence will be called sweet if, for each , is the number of times that the number appears in the sequence. For example, is a sweet sequence with terms. Given that , , , is a sweet sequence, find the value of
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.