MathDB
2022 DMM Team Round - Duke Math Meet

Source:

August 8, 2023
algebrageometrycombinatoricsnumber theoryDMM

Problem Statement

p1. The serpent of fire and the serpent of ice play a game. Since the serpent of ice loves the lucky number 66, he will roll a fair 66-sided die with faces numbered 11 through 66. The serpent of fire will pay him log10x\log_{10} x, where xx is the number he rolls. The serpent of ice rolls the die 66 times. His expected total amount of winnings across the 66 rounds is kk. Find 10k10^k.
p2. Let a=log35a = \log_3 5, b=log34b = \log_3 4, c=log320c = - \log_3 20, evaluate a2+b2a2+b2+ab+b2+c2b2+c2+bc+c2+a2c2+a2+ca\frac{a^2+b^2}{a^2+b^2+ab} +\frac{b^2+c^2}{b^2+c^2+bc} +\frac{c^2+a^2}{c^2+a^2+ca}.
p3. Let ABC\vartriangle ABC be an isosceles obtuse triangle with AB=ACAB = AC and circumcenter OO. The circle with diameter AOAO meets BCBC at points X,YX, Y , where X is closer to BB. Suppose XB=YC=4XB = Y C = 4, XY=6XY = 6, and the area of ABC\vartriangle ABC is mnm\sqrt{n} for positive integers mm and nn, where nn does not contain any square factors. Find m+nm + n.
p4. Alice is not sure what to have for dinner, so she uses a fair 66-sided die to decide. She keeps rolling, and if she gets all the even numbers (i.e. getting all of 2,4,62, 4, 6) before getting any odd number, she will reward herself with McDonald’s. Find the probability that Alice could have McDonald’s for dinner.
p5. How many distinct ways are there to split 5050 apples, 5050 oranges, 5050 bananas into two boxes, such that the products of the number of apples, oranges, and bananas in each box are nonzero and equal?
p6. Sujay and Rishabh are taking turns marking lattice points within a square board in the Cartesian plane with opposite vertices (1,1)(1, 1),(n,n)(n, n) for some constant nn. Sujay loses when the two-point pattern PP below shows up:https://cdn.artofproblemsolving.com/attachments/1/9/d1fe285294d4146afc0c7a2180b15586b04643.png That is, Sujay loses when there exists a pair of points (x,y)(x, y) and (x+2,y+1)(x + 2, y + 1). He and Rishabh stop marking points when the pattern PP appears on the board. If Rishabh goes first, let SS be the set of all integers 3n1003 \le n \le 100 such that Rishabh has a strategy to always trick Sujay into being the one who creates PP. Find the sum of all elements of SS.
p7. Let aa be the shortest distance between the origin (0,0)(0, 0) and the graph of y3=x(6yx2)8y^3 = x(6y -x^2)-8. Find a2\lfloor a^2 \rfloor . (x\lfloor x\rfloor is the largest integer not exceeding xx)
p8. Find all real solutions to the following equation: 22x2+x1x22=0.2\sqrt2x^2 + x -\sqrt{1 - x^2 } -\sqrt2 = 0.
p9. Given the expression S=(x4x)(x2x3)S = (x^4 - x)(x^2 - x^3) for x=cos2π5+isin2π5x = \cos \frac{2\pi}{5 }+ i\sin \frac{2\pi}{5 }, find the value of S2S^2 .
p10. In a 3232 team single-elimination rock-paper-scissors tournament, the teams are numbered from 11 to 3232. Each team is guaranteed (through incredible rock-paper-scissors skill) to win any match against a team with a higher number than it, and therefore will lose to any team with a lower number. Each round, teams who have not lost yet are randomly paired with other teams, and the losers of each match are eliminated. After the 55 rounds of the tournament, the team that won all 55 rounds is ranked 11st, the team that lost the 5th round is ranked 22nd, and the two teams that lost the 44th round play each other for 33rd and 44th place. What is the probability that the teams numbered 1,2,31, 2, 3, and 44 are ranked 11st, 2nd, 3rd, and 4th respectively? If the probability is mn\frac{m}{n} for relatively prime integers mm and nn, find mm.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.