MathDB
2021 MMATHS Mathathon Rounds 6-7 Math Majors of America Tournament for HS

Source:

August 10, 2023
MMATHSalgebrageometrycombinatoricsnumber theory

Problem Statement

Round 6
p16. Let ABCABC be a triangle with AB=3AB = 3, BC=4BC = 4, and CA=5CA = 5. There exist two possible points XX on CACA such that if YY and ZZ are the feet of the perpendiculars from XX to ABAB and BC,BC, respectively, then the area of triangle XYZXY Z is 11. If the distance between those two possible points can be expressed as abc\frac{a\sqrt{b}}{c} for positive integers aa, bb, and cc with bb squarefree and gcd(a,c)=1gcd(a, c) = 1, then find a+b+ca +b+ c.
p17. Let f(n)f(n) be the number of orderings of 1,2,...,n1,2, ... ,n such that each number is as most twice the number preceding it. Find the number of integers kk between 11 and 5050, inclusive, such that f(k)f (k) is a perfect square.
p18. Suppose that ff is a function on the positive integers such that f(p)=pf(p) = p for any prime p, and that f(xy)=f(x)+f(y)f (xy) = f(x) + f(y) for any positive integers xx and yy. Define g(n)=knf(k)g(n) = \sum_{k|n} f (k); that is, g(n)g(n) is the sum of all f(k)f(k) such that kk is a factor of nn. For example, g(6)=f(1)+1(2)+f(3)+f(6)g(6) = f(1) + 1(2) + f(3) + f(6). Find the sum of all composite nn between 5050 and 100100, inclusive, such that g(n)=ng(n) = n.
Round 7
p19. AJ is standing in the center of an equilateral triangle with vertices labelled AA, BB, and CC. They begin by moving to one of the vertices and recording its label; afterwards, each minute, they move to a different vertex and record its label. Suppose that they record 2121 labels in total, including the initial one. Find the number of distinct possible ordered triples (a,b,c)(a, b, c), where a is the number of AA's they recorded, b is the number of BB's they recorded, and c is the number of CC's they recorded.
p20. Let S=n=1(1{(2+3)n})S = \sum_{n=1}^{\infty} (1- \{(2 + \sqrt3)^n\}), where {x}=xx\{x\} = x - \lfloor x\rfloor , the fractional part of xx. If S=abcS =\frac{\sqrt{a} -b}{c} for positive integers a,b,ca, b, c with aa squarefree, find a+b+ca + b + c.
p21. Misaka likes coloring. For each square of a 1×81\times 8 grid, she flips a fair coin and colors in the square if it lands on heads. Afterwards, Misaka places as many 1×21 \times 2 dominos on the grid as possible such that both parts of each domino lie on uncolored squares and no dominos overlap. Given that the expected number of dominos that she places can be written as ab\frac{a}{b}, for positive integers aa and bb with gcd(a,b)=1gcd(a, b) = 1, find a+ba + b.
PS. You should use hide for answers. Rounds 1-3 have been posted [url=https://artofproblemsolving.com/community/c4h3131401p28368159]here and 4-5 [url=https://artofproblemsolving.com/community/c4h3131422p28368457]here. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.