Subcontests
(32)2021 Team P15
Adam has a circle of radius 1 centered at the origin. - First, he draws 6 segments from the origin to the boundary of the circle, which splits the upper (positive y) semicircle into 7 equal pieces.
- Next, starting from each point where a segment hit the circle, he draws an altitude to the x-axis.
- Finally, starting from each point where an altitude hit the x-axis, he draws a segment directly away from the bottommost point of the circle (0,−1), stopping when he reaches the boundary of the circle.
What is the product of the lengths of all 18 segments Adam drew?https://cdn.discordapp.com/attachments/813077401265242143/816190774257516594/circle2.pngProposed by Adam Bertelli 2021 Team P14
Let S be the set of lattice points (x,y)∈Z2 such that −10≤x,y≤10. Let the point (0,0) be O. Let Scotty the Dog's position be point P, where initially P=(0,1). At every second, consider all pairs of points C,D∈S such that neither C nor D lies on line OP, and the area of quadrilateral OCPD (with the points going clockwise in that order) is 1. Scotty finds the pair C,D maximizing the sum of the y coordinates of C and D, and randomly jumps to one of them, setting that as the new point P. After 50 such moves, Scotty ends up at point (1,1). Find the probability that he never returned to the point (0,1) during these 50 moves.Proposed by David Tang 2021 Team P13
Let p=3⋅1010+1 be a prime and let pn denote the probability that p∣(kk−1) for a random k chosen uniformly from {1,2,⋯,n}. Given that pn⋅p converges to a value L as n goes to infinity, what is L?Proposed by Vijay Srinivasan 2021 Team P10
How many functions f:{1,2,3,…,7}→{1,2,3,…,7} are there such that the set F={f(i):i∈{1,…,7}} has cardinality four, while the set G={f(f(f(i))):i∈{1,…,7}} consists of a single element?Proposed by Sam Delatore 2021 Team P8
Determine the number of functions f from the integers to {1,2,⋯,15} which satisfy f(x)=f(x+15)
and
f(x+f(y))=f(x−f(y))
for all x,y.Proposed by Vijay Srinivasan 2021 Team P2
Let p1,p2,p3,p4,p5,p6 be distinct primes greater than 5. Find the minimum possible value of p1+p2+p3+p4+p5+p6−6min(p1,p2,p3,p4,p5,p6)Proposed by Oliver Hayman 2021 TCS Problem 2
You are initially given the number n=1. Each turn, you may choose any positive divisor d∣n, and multiply n by d+1. For instance, on the first turn, you must select d=1, giving n=1⋅(1+1)=2 as your new value of n. On the next turn, you can select either d=1 or 2, giving n=2⋅(1+1)=4 or n=2⋅(2+1)=6, respectively, and so on.Find an algorithm that, in at most k steps, results in n being divisible by the number 202120212021−1.An algorithm that completes in at most k steps will be awarded:1 pt for k>202120212021
20 pts for k=202120212021
50 pts for k=10104
75 pts for k=1010
90 pts for k=105
95 pts for k=6⋅104
100 pts for k=5⋅104 2021 TCS Problem 1
You place n2 indistinguishable pieces on an n×n chessboard, where n=290≈1.27×1027. Of these pieces, n of them are slightly lighter than usual, while the rest are all the same standard weight, but you are unable to discern this simply by feeling the pieces.\\However, beneath each row and column of the chessboard, you have set up a scale, which, when turned on, will tell you only whether the average weight of all the pieces on that row or column is the standard weight, or lighter than standard. On a given step, you are allowed to rearrange every piece on the chessboard, and then turn on all the scales simultaneously, and record their outputs, before turning them all off again. (Note that you can only turn on the scales if all n2 pieces are placed in different squares on the board.)Find an algorithm that, in at most k steps, will always allow you to rearrange the pieces in such a way that every row and column measures lighter than standard on the final step.An algorithm that completes in at most k steps will be awarded:1 pt for k>1055
10 pts for k=1055
30 pts for k=1030
50 pts for k=1028
65 pts for k=1020
80 pts for k=105
90 pts for k=2021
100 pts for k=500 2021 Geo Div 2 P5
Emily is at (0,0), chilling, when she sees a spider located at (1,0)! Emily runs a continuous path to her home, located at (2+2,0), such that she is always moving away from the spider and toward her home. That is, her distance from the spider always increases whereas her distance to her home always decreases. What is the area of the set of all points that Emily could have visited on her run home?Proposed by Thomas Lam 2021 Combo Div 2 P5
Bill Gates and Jeff Bezos are playing a game. Each turn, a coin is flipped, and if Bill and Jeff have m,n>0 dollars, respectively, the winner of the coin toss will take min(m,n) from the loser. Given that Bill starts with 20 dollars and Jeff starts with 21 dollars, what is the probability that Bill ends up with all of the money?Proposed by Daniel Li 2021 Alg/NT Div 1 P8
There are integers v,w,x,y,z and real numbers 0≤θ<θ′≤π such that cos3θ=cos3θ′=v−1,w+xcosθ+ycos2θ=zcosθ′. Given that z=0 and v is positive, find the sum of the 4 smallest possible values of v.Proposed by Vijay Srinivasan 2021 Geo Div 1 P8
Let ABC be a triangle with AB<AC and ω be a circle through A tangent to both the B-excircle and the C-excircle. Let ω intersect lines AB,AC at X,Y respectively and X,Y lie outside of segments AB,AC. Let O be the center of ω and let OIC,OIB intersect line BC at J,K respectively. Suppose KJ=4, KO=16 and OJ=13. Find [JIBIC][KIBIC].Proposed by Grant Yu 2021 Combo Div 1 P7
How many non-decreasing tuples of integers (a1,a2,…,a16) are there such that 0≤ai≤16 for all i, and the sum of all ai is even?Proposed by Nancy Kuang 2021 Geo Div 1 P5
Let γ1,γ2,γ3 be three circles with radii 3,4,9, respectively, such that γ1 and γ2 are externally tangent at C, and γ3 is internally tangent to γ1 and γ2 at A and B, respectively. Suppose the tangents to γ3 at A and B intersect at X. The line through X and C intersect γ3 at two points, P and Q. Compute the length of PQ.Proposed by Kyle Lee 2021 Combo Div 2 P2
Dilhan has objects of 3 types, A, B, and C, and 6 functions fA,B,fA,C,fB,A,fB,C,fC,A,fC,Bwhere fX,Y takes in an object of type X and outputs an object of type Y. Dilhan wants to compose his 6 functions, without repeats, such that the resulting expression is well-typed, meaning an object can be taken in by the first function, and the resulting output can then be taken in by the second function, and so on. In how many orders can he compose his 6 functions, satisfying this constraint?Proposed by Adam Bertelli 2021 Alg/NT Div 2 P1
Find the unique 3 digit number N=A B C, whose digits (A,B,C) are all nonzero, with the property that the product P=A B C × A B × A is divisible by 1000.Proposed by Kyle Lee