MathDB
1999 / 2000 DMM Team Round - Duke Math Meet

Source:

February 15, 2024
DMMalgebrageometrycombinatoricsnumber theory

Problem Statement

p1. Function ff is defined by f(x)=ax+bf (x) = ax+b for some real values a,b>0a, b > 0. If f(f(x))=9x+5f (f (x)) = 9x + 5 for all xx, find bb.
p2. At some point during a game, Will Avery has made 1/31/3 of his shots. When he shoots once and makes a basket, his average increases to 2/52/5. Find his average (expressed as a fraction) after a second additional basket.
p3. A dealer has a deck of 19991999 cards. He takes the top card off and “ducks” it, that is, places it on the bottom of the deck. He deals the second card onto the table. He ducks the third card, deals the fourth card, ducks the fifth card, deals the sixth card, and so forth, continuing until he has only one card left; he then ducks the last card with itself and deals it. Some of the cards (like the second and fourth cards) are not ducked at all before being dealt, while others are ducked multiple times. The question is: what is the average number of ducks per card?
p4. Point PP lies outside circle OO. Perpendicular lines \ell and m intersect at PP. Line \ell is tangent to circle OO at a point 66 units from PP. Line mm crosses circle OO at a point 44 units from PP. Find the radius of circle OO.
p5. Define f(n)f(n) by f(n)={n/2ifniseven(n+1023)/2ifnisoddf(n) = \begin{cases} n/2 \,\,\,\text{if} \,\,\, n\,\,\,is\,\,\, even \\ (n + 1023)/2\,\,\, \text{if} \,\,\, n\,\,\,is\,\,\, odd \end{cases} Find the least positive integer nn such that f(f(f(f(f(n)))))=n.f(f(f(f(f(n))))) = n.
p6. Write 10001\sqrt{10001} to the sixth decimal place, rounding down.
p7. Define (an)(a_n) recursively by a1=1a_1 = 1, an=20cos(an1o)a_n = 20 \cos (a_{n-1}^o). As nn tends to infinity, (an)(a_n) tends to 18.9195...18.9195.... Define (bn)(b_n) recursively by b1=1b_1 = 1, bn=800+800cos(bn1o)b_n =\sqrt{800 + 800 \cos (b_{n-1}^o)}. As nn tends to infinity, (bn)(b_n) tends to xx. Calculate xx to three decimal places.
p8. Let modd(k)mod_d (k) be the remainder of kk when divided by dd. Find the number of positive integers nn satisfying modn(1999)=n289n+1999mod_n(1999) = n^2 - 89n + 1999
p9. Let f(x)=x3+xf(x) = x^3 + x. Compute k=11011+f1(k1)2+f1(k1)f1(k)+f1(k)2\sum^{10}_{k=1} \frac{1}{1 + f^{-1}(k - 1)^2 + f^{-1}(k - 1)f^{-1}(k) + f^{-1}(k)^2} (f1f^{-1} is the inverse of ff: f(f11(x))=f11(f(x))=xf (f^{-1}1 (x)) = f^{-1}1 (f (x)) = x for all xx.)
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.