MathDB

2021 Stanford Mathematics Tournament

Part of Stanford Mathematics Tournament

Subcontests

(20)

2021 SMT Guts Round 9 - final- p33-36 - Stanford Math Tournament

p33. Lines 1\ell_1 and 2\ell_2 have slopes m1m_1 and m2m_2 such that 0<m2<m10 < m_2 < m_1. 1\ell'_1 and 2\ell'_2 are the reflections of 1\ell_1 and 2\ell_2 about the line 3\ell_3 defined by y=xy = x. Let A=12=(5,4)A = \ell_1 \cap \ell_2 = (5, 4), B=13B = \ell_1 \cap \ell_3, C=12C = \ell'_1 \cap \ell'_2 and D=23D = \ell_2 \cap \ell_3. If 45m154m1=m2\frac{4-5m_1}{-5-4m_1} = m_2 and (1+m12)(1+m22)(1m1)2(1m2)2=41\frac{(1+m^2_1)(1+m^2_2)}{(1-m_1)^2(1-m_2)^2} = 41, compute the area of quadrilateral ABCDABCD.
p34. Suppose S(m,n)=i=1m(1)iinS(m, n) = \sum^m_{i=1}(-1)^ii^n. Compute the remainder when S(2020,4)S(2020, 4) is divided by S(1010,2)S(1010, 2).
p35. Let NN be the number of ways to place the numbers 1,2,...,121, 2, ..., 12 on a circle such that every pair of adjacent numbers has greatest common divisor 11. What is N/144N/144? (Arrangements that can be rotated to yield each other are the same).
p36. Compute the series n=1(1)n1(2n2)=1(22)1(42)+1(62)1(82)1(102)+1(122)+...\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{{2n \choose 2}} =\frac{1}{{2 \choose 2}} - \frac{1}{{4 \choose 2}} +\frac{1}{{6 \choose 2}} -\frac{1}{{8 \choose 2}} -\frac{1}{{10 \choose 2}}+\frac{1}{{12 \choose 2}} +...
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.

2021 SMT Guts Round 3 p9-12 - Stanford Math Tournament

p9. The frozen yogurt machine outputs yogurt at a rate of 55 froyo3^3/second. If the bowl is described by z=x2+y2z = x^2+y^2 and has height 55 froyos, how long does it take to fill the bowl with frozen yogurt?
p10. Prankster Pete and Good Neighbor George visit a street of 20212021 houses (each with individual mailboxes) on alternate nights, such that Prankster Pete visits on night 11 and Good Neighbor George visits on night 22, and so on. On each night nn that Prankster Pete visits, he drops a packet of glitter in the mailbox of every nthn^{th} house. On each night mm that Good Neighbor George visits, he checks the mailbox of every mthm^{th} house, and if there is a packet of glitter there, he takes it home and uses it to complete his art project. After the 2021th2021^{th} night, Prankster Pete becomes enraged that none of the houses have yet checked their mail. He then picks three mailboxes at random and takes out a single packet of glitter to dump on George’s head, but notices that all of the mailboxes he visited had an odd number of glitter packets before he took one. In how many ways could he have picked these three glitter packets? Assume that each of these three was from a different house, and that he can only visit houses in increasing numerical order.
p11. The taxi-cab length of a line segment with endpoints (x1,y1)(x_1, y_1) and (x2,y2)(x_2, y_2) is x1x2+y1y2|x_1 - x_2| + |y_1- y_2|. Given a series of straight line segments connected head-to-tail, the taxi-cab length of this path is the sum of the taxi-cab lengths of its line segments. A goat is on a rope of taxi-cab length 72\frac72 tied to the origin, and it can’t enter the house, which is the three unit squares enclosed by (2,0)(-2, 0),(0,0)(0, 0),(0,2)(0, -2),(1,2)(-1, -2),(1,1)(-1, -1),(2,1)(-2, -1). What is the area of the region the goat can reach? (Note: the rope can’t ”curve smoothly”-it must bend into several straight line segments.)
p12. Parabola PP, y=ax2+cy = ax^2 + c has a>0a > 0 and c<0c < 0. Circle CC, which is centered at the origin and lies tangent to PP at PP’s vertex, intersects PP at only the vertex. What is the maximum value of a, possibly in terms of cc?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.

2021 SMT Guts Round 1 p1-4 - Stanford Math Tournament

p1. A rectangular pool has diagonal 1717 units and area 120120 units2^2. Joey and Rachel start on opposite sides of the pool when Rachel starts chasing Joey. If Rachel runs 55 units/sec faster than Joey, how long does it take for her to catch him?
p2. Alice plays a game with her standard deck of 5252 cards. She gives all of the cards number values where Aces are 11’s, royal cards are 1010’s and all other cards are assigned their face value. Every turn she flips over the top card from her deck and creates a new pile. If the flipped card has value vv, she places 12v12 - v cards on top of the flipped card. For example: if she flips the 33 of diamonds then she places 99 cards on top. Alice continues creating piles until she can no longer create a new pile. If the number of leftover cards is 44 and there are 55 piles, what is the sum of the flipped over cards?
p3. There are 55 people standing at (0,0)(0, 0), (3,0)(3, 0), (0,3)(0, 3), (3,0)(-3, 0), and (3,0)(-3, 0) on a coordinate grid at a time t=0t = 0 seconds. Each second, every person on the grid moves exactly 11 unit up, down, left, or right. The person at the origin is infected with covid-1919, and if someone who is not infected is at the same lattice point as a person who is infected, at any point in time, they will be infected from that point in time onwards. (Note that this means that if two people run into each other at a non-lattice point, such as (0,1.5)(0, 1.5), they will not infect each other.) What is the maximum possible number of infected people after t=7t = 7 seconds?
p4. Kara gives Kaylie a ring with a circular diamond inscribed in a gold hexagon. The diameter of the diamond is 22 mm. If diamonds cost $100/mm2\$100/ mm ^2 and gold costs $50/mm2\$50 /mm ^2 , what is the cost of the ring?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.
1

2021 SMT Team Round - Stanford Math Tournament

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.