MathDB
2012 DMM Individual Round - Duke Math Meet

Source:

October 6, 2023
DMMalgebrageometrycombinatoricsnumber theory

Problem Statement

p1. Vivek has three letters to send out. Unfortunately, he forgets which letter is which after sealing the envelopes and before putting on the addresses. He puts the addresses on at random sends out the letters anyways. What are the chances that none of the three recipients get their intended letter?
p2. David is a horrible bowler. Luckily, Logan and Christy let him use bumpers. The bowling lane is 22 meters wide, and David's ball travels a total distance of 2424 meters. How many times did David's bowling ball hit the bumpers, if he threw it from the middle of the lane at a 60o60^o degree angle to the horizontal?
p3. Find gcd(212106,106212)\gcd \,(212106, 106212).
p4. Michael has two fair dice, one six-sided (with sides marked 11 through 66) and one eight-sided (with sides marked 181-8). Michael play a game with Alex: Alex calls out a number, and then Michael rolls the dice. If the sum of the dice is equal to Alex's number, Michael gives Alex the amount of the sum. Otherwise Alex wins nothing. What number should Alex call to maximize his expected gain of money?
p5. Suppose that xx is a real number with log5sinx+log5cosx=1\log_5 \sin x + \log_5 \cos x = -1. Find sin2xcosx+cos2xsinx.|\sin^2 x \cos x + \cos^2 x \sin x|.
p6. What is the volume of the largest sphere that FIts inside a regular tetrahedron of side length 66?
p7. An ant is wandering on the edges of a cube. At every second, the ant randomly chooses one of the three edges incident at one vertex and walks along that edge, arriving at the other vertex at the end of the second. What is the probability that the ant is at its starting vertex after exactly 66 seconds?
p8. Determine the smallest positive integer kk such that there exist m,nm, n non-negative integers with m>1m > 1 satisfying k=22m+1n2.k = 2^{2m+1} - n^2.
p9. For A,BZA,B \subset Z with A,BA,B \ne \emptyset, define A+B={a+baA,bB}A + B = \{a + b|a \in A, b \in B\}. Determine the least nn such that there exist sets A,BA,B with A=B=n|A| = |B| = n and A+B={0,1,2,...,2012}A + B = \{0, 1, 2,..., 2012\}.
p10. For positive integers n1n \ge 1, let τ(n)\tau (n) and σ(n)\sigma (n) be, respectively, the number of and sum of the positive integer divisors of nn (including 11 and nn). For example, τ(1)=σ(1)=1\tau (1) = \sigma (1) = 1 and τ(6)=4\tau (6) = 4, σ(6)=12\sigma (6) = 12. Find the number of positive integers n100n \le 100 such that σ(n)(n1)2+τ(n)n.\sigma (n) \le (\sqrt{n} - 1)^2 +\tau (n)\sqrt{n}.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.