MathDB
1988 MMPC , Part 2 = Michigan Mathematics Prize Competition

Source:

October 18, 2022
MMPCalgebrageometrynumber theorycombinatorics

Problem Statement

p1. Given an equilateral triangle ABCABC with area 16316\sqrt3, and an interior point PP with distances from vertices AP=4|AP| = 4 and BP=6|BP| = 6. (a) Find the length of each side. (b) Find the distance from point PP to the side ABAB. (c) Find the distance PC|PC|.
p2. Several players play the following game. They form a circle and each in turn tosses a fair coin. If the coin comes up heads, that player drops out of the game and the circle becomes smaller, if it comes up tails that player remains in the game until his or her next turn to toss. When only one player is left, he or she is the winner. For convenience let us name them AA (who tosses first), BB (second), CC (third, if there is a third), etc. (a) If there are only two players, what is the probability that AA (the first) wins? (b) If there are exactly 33 players, what is the probability that AA (the first) wins? (c) If there are exactly 33 players, what is the probability that BB (the second) wins?
p3. A circular castle of radius rr is surrounded by a circular moat of width mm (mm is the shortest distance from each point of the castle wall to its nearest point on shore outside the moat). Life guards are to be placed around the outer edge of the moat, so that at least one life guard can see anyone swimming in the moat. (a) If the radius rr is 140140 feet and there are only 33 life guards available, what is the minimum possible width of moat they can watch? (b) Find the minimum number of life guards needed as a function of rr and mm. https://cdn.artofproblemsolving.com/attachments/a/8/d7ff0e1227f9dcf7e49fe770f7dae928581943.png
p4. (a)Find all linear (first degree or less) polynomials f(x)f(x) with the property that f(g(x))=g(f(x))f(g(x)) = g(f(x)) for all linear polynomials g(x)g(x). (b) Prove your answer to part (a). (c) Find all polynomials f(x)f(x) with the property that f(g(x))=g(f(x))f(g(x)) = g(f(x)) for all polynomials g(x)g(x). (d) Prove your answer to part (c).
p5. A non-empty set BB of integers has the following two properties: i. each number xx in the set can be written as a sum x=y+zx = y+ z for some yy and zz in the set BB. (Warning: yy and zz may or may not be distinct for a given xx.) ii. the number 00 can not be written as a sum 0=y+z0 = y + z for any yy and zz in the set BB.
(a) Find such a set BB with exactly 66 elements. (b) Find such a set BB with exactly 66 elements, and such that the sum of all the 66 elements is 19881988. (c) What is the smallest possible size of such a set BB ? (d) Prove your answer to part (c).
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.