MathDB
2021 SMT Team Round - Stanford Math Tournament

Source:

February 6, 2022
algebrageometrycombinatoricsnumber theoryStanford Math TournamentSMT

Problem Statement

p1. What is the length of the longest string of consecutive prime numbers that divide 224444220224444220?
p2. Two circles of radius rr are spaced so their centers are 2r2r apart. If A(r)A(r) is the area of the smallest square containing both circles, what is A(r)r2\frac{A(r)}{r^2} ?
p3. Define e0=1e_0 = 1 and ek=eek1e_k = e^{e_{k-1}} for k1k \ge 1. Compute e4e61x(lnx)(lnlnx)(lnlnlnx)dx\int^{e_6}_{e_4} \frac{1}{x(\ln x)(\ln \ln x)(\ln \ln \ln x)}dx.
p4. Compute n=02020k=02020(12020)k(2021)n\prod_{n=0}^{2020}\sum_{k=0}^{2020}\left( \frac{1}{2020}\right)^{k(2021)^n}
p5. A potter makes a bowl, beginning with a sphere of clay and then cutting away the top and bottom of the sphere with two parallel cuts that are equidistant from the center. Finally, he hollows out the remaining shape, leaving a base at one end. Assume that the thickness of the bowl is negligible. If the potter wants the bowl to hold a volume that is 1327\frac{13}{27} of the volume of the sphere he started with, the distance from the center at which he makes his cuts should be what fraction of the radius?
p6. Let ABAB be a line segment with length 2+22 + \sqrt2. A circle ω\omega with radius 11 is drawn such that it passes through the end point BB of the line segment and its center OO lies on the line segment ABAB. Let CC be a point on circle ω\omega such that AC=BCAC = BC. What is the size of angle CABCAB in degrees?
p7. Find all possible values of sinx\sin x such that 4sin(6x)=5sin(2x)4 \sin(6x) = 5 \sin(2x).
p8. Frank the frog sits on the first lily pad in an infinite line of lily pads. Each lily pad besides the one first one is randomly assigned a real number from 00 to 11. Franks starting lily pad is assigned 00. Frank will jump forward to the next lily pad as long as the next pad’s number is greater than his current pad’s number. For example, if the first few lily pads including Frank’s are numbered 00, .4.4, .72.72, .314.314, Frank will jump forward twice, visiting a total of 33 lily pads. What is the expected number of lily pads that Frank will visit?
p9. For positive integers nn and kk with knk \le n, let f(n,k)=j=0k1j(k1j)(nk+1kj).f(n, k) = \sum^{k-1}_{j=0} j {{k -1} \choose j}{{n - k + 1} \choose {k - j}}. Compute the sum of the prime factors of f(4,4)+f(5,4)+f(6,4)+...+f(2021,4)f(4, 4) + f(5, 4) + f(6, 4) + ... + f(2021, 4).
p10. ABC\vartriangle ABC has side lengths AB=5AB = 5, AC=10AC = 10, and BC=9BC = 9. The median of ABC\vartriangle ABC from AA intersects the circumcircle of the triangle again at point DD. What is BD+CDBD + CD?
p11. A subset of five distinct positive integers is chosen uniformly at random from the set {1,2,...,11}\{1, 2, ... , 11\}. The probability that the subset does not contain three consecutive integers can be written as m/nm/n , where mm and nn are relatively prime positive integers. Find m+nm + n.
p12. Compute 11(x2+x+1x2)2dx\int_{-1}^{1} (x^2 + x +\sqrt{1 - x^2})^2dx.
p13. Three friends, Xander, Yulia, and Zoe, have each planned to visit the same cafe one day. If each person arrives at the cafe at a random time between 22 PM and 33 PM and stays for 1515 minutes, what is the probability that all three friends will be there at the same time at some point?
p14. Jim the Carpenter starts with a wooden rod of length 11 unit. Jim will cut the middle 13\frac13 of the rod and remove it, creating 22 smaller rods of length 13\frac13. He repeats this process, randomly choosing a rod to split into 22 smaller rods. Thus, after two such splits, Jim will have 33 rods of length 13\frac13, 19\frac19, and 19\frac19. After 33 splits, Jim will either have 44 rods of lengths 19\frac19, 19\frac19, 19\frac19,19\frac19 or 13\frac13, 19\frac19, 127\frac{1}{27},127\frac{1}{27}. , What is the expected value of the total length of the rods after 55 splits?
p15. Robin is at an archery range. There are 1010 targets, each of varying difficulty. If Robin spends tt seconds concentrating on target nn where 1n101 \le n \le 10, he has a probability p=1et/np = 1 - e^{-t/n} of hitting the target. Hitting target nn gives him nn points and he is alloted a total of 6060 seconds. If he has at most one attempt on each target, and he allots time to concentrate on each target optimally to maximize his point total, what is the expected value of the number of points Robin will get? (Assume no time is wasted between shots).
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.