2015 DMM Individual Round - Duke Math Meet
Source:
October 6, 2023
DMMalgebrageometrycombinatoricsnumber theory
Problem Statement
p1. Find the minimum value of , where x can be any real number.
p2. A type of digit-lock has digits, each digit chosen from . How many different passwords are there that have an odd number of 's?
p3. Tony is a really good Ping Pong player, or at least that is what he claims. For him, ping pong balls are very important and he can feel very easily when a ping pong ball is good and when it is not. The Ping Pong club just ordered new balls. They usually order form either PPB company or MIO company. Tony knows that PPB balls have chance to be good balls and MIO balls have chance to be good balls. I know you are thinking why would anyone order MIO balls, but they are way cheaper than PPB balls. When the box full with balls arrives (huge number of balls), Tony tries the first ball in the box and realizes it is a good ball. Given that the Ping Pong club usually orders half of the time from PPB and half of the time from MIO, what is the probability that the second ball is a good ball?
p4. What is the smallest positive integer that is one-ninth of its reverse?
p5. When Michael wakes up in the morning he is usually late for class so he has to get dressed very quickly. He has to put on a short sleeved shirt, a sweater, pants, two socks and two shoes. People usually put the sweater on after they put the short sleeved shirt on, but Michael has a different style, so he can do it both ways. Given that he puts on a shoe on a foot after he put on a sock on that foot, in how many dierent orders can Michael get dressed?
p6. The numbers are written on a blackboard. At each step we choose two numbers and replace them with their nonnegative difference. We stop when we have only one number. How many possibilities are there for this last number?
p7. Let and be two numbers written in base . If the sum of the base- digits of is congruent to (mod ) and the sum of the base digits of is congruent to (mod ). Then if (mod ) and , what is ? (you can write in base )
p8. What is the sum of the medians of all nonempty subsets of ?
p9. Tony is moving on a straight line for minutes{classic Tony. Several finitely many observers are watching him because, let's face it, you can't really trust Tony. In fact, they must watch him very closely{ so closely that he must never remain unattended for any second. But since the observers are lazy, they only watch Tony uninterruptedly for exactly one minute, and during this minute, Tony covers exactly one meter. What is the sum of the minimal and maximal possible distance Tony can walk during the six minutes?
p10. Find the number of nonnegative integer triplets that satisfy
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.