MathDB

1999 / 2000 Duke Math Meet

Part of Duke Math Meet (DMM)

Subcontests

(1)
3

1999 / 2000 DMM Individual Round - Duke Math Meet

p1. The least prime factor of aa is 33, the least prime factor of bb is 77. Find the least prime factor of a+ba + b.
p2. In a Cartesian coordinate system, the two tangent lines from P=(39,52)P = (39, 52) meet the circle defined by x2+y2=625x^2 + y^2 = 625 at points QQ and RR. Find the length QRQR.
p3. For a positive integer nn, there is a sequence (a0,a1,a2,...,an)(a_0, a_1, a_2,..., a_n) of real values such that a0=11a_0 = 11 and (ak+ak+1)(akak+1)=5(a_k + a_{k+1}) (a_k - a_{k+1}) = 5 for every kk with 0kn10 \le k \le n-1. Find the maximum possible value of nn. (Be careful that your answer isn’t off by one!)
p4. Persons AA and BB stand at point PP on line \ell. Point QQ lies at a distance of 1010 from point PP in the direction perpendicular to \ell. Both persons intially face towards QQ. Person AA walks forward and to the left at an angle of 25o25^o with \ell, when he is again at a distance of 1010 from point QQ, he stops, turns 90o90^o to the right, and continues walking. Person BB walks forward and to the right at an angle of 55o55^o with line \ell, when he is again at a distance of 1010 from point QQ, he stops, turns 90o90^o to the left, and continues walking. Their paths cross at point RR. Find the distance PRPR.
p5. Compute lcm(1,2,3,...,200)lcm(102,103,104,...,200).\frac{lcm (1,2, 3,..., 200)}{lcm (102, 103, 104, ..., 200)}.

p6. There is a unique real value AA such that for all xx with 1<x<31 < x < 3 and x2x \ne 2, Ax2x2+1x26x+8<1999.\left| \frac{A}{x^2-x - 2} +\frac{1}{x^2 - 6x + 8} \right|< 1999. Compute AA.
p7. Nine poles of height 1,2,...,91, 2,..., 9 are placed in a line in random order. A pole is called dominant if it is taller than the pole immediately to the left of it, or if it is the pole farthest to the left. Count the number of possible orderings in which there are exactly 22 dominant poles.
p8. tan(11x)=tan(34o)\tan (11x) = \tan (34^o) and tan(19x)=tan(21o)\tan (19x) = \tan (21^o). Compute tan(5x)\tan (5x).
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.

1999 / 2000 DMM Team Round - Duke Math Meet

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.

1999 DMM Tiebreaker Round - Duke Math Meet

p1A. Compute 1+123+133+143+153+...1 + \frac{1}{2^3} + \frac{1}{3^3} + \frac{1}{4^3} + \frac{1}{5^3} + ... 1123+133143+153...1 - \frac{1}{2^3} + \frac{1}{3^3} - \frac{1}{4^3} + \frac{1}{5^3} - ...
p1B. Real values aa and bb satisfy ab=1ab = 1, and both numbers have decimal expansions which repeat every five digits: a=0.(a1)(a2)(a3)(a4)(a5)(a1)(a2)(a3)(a4)(a5)... a = 0.(a_1)(a_2)(a_3)(a_4)(a_5)(a_1)(a_2)(a_3)(a_4)(a_5)... and b=1.(b1)(b2)(b3)(b4)(b5)(b1)(b2)(b3)(b4)(b5)... b = 1.(b_1)(b_2)(b_3)(b_4)(b_5)(b_1)(b_2)(b_3)(b_4)(b_5)... If a5=1a_5 = 1, find b5b_5.
p2. P(x)=x43x3+4x29x+5P(x) = x^4 - 3x^3 + 4x^2 - 9x + 5. Q(x)Q(x) is a 33rd-degree polynomial whose graph intersects the graph of P(x)P(x) at x=1x = 1, 22, 55, and 1010. Compute Q(0)Q(0).
p3. Distinct real values x1x_1, x2x_2, x3x_3, x4x_4 all satisfy x35=1.34953 ||x - 3| - 5| = 1.34953. Find x1+x2+x3+x4x_1 + x_2 + x_3 + x_4.
p4. Triangle ABCABC has sides AB=8AB = 8, BC=10BC = 10, and CA=11CA = 11. Let LL be the locus of points in the interior of triangle ABCABC which are within one unit of either AA, BB, or CC. Find the area of LL.
p5. Triangles ABCABC and ADEADE are equilateral, and ADAD is an altitude of ABCABC. The area of the intersection of these triangles is 33. Find the area of the larger triangle ABCABC.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.