2015 MMATHS Individual Round - Math Majors of America Tournament for High School
Source:
September 30, 2023
MMATHSalgebrageometrycombinatoricsnumber theory
Problem Statement
p1. The sum of two numbers, , is more than their difference, . What is ?
p2. Rectangle has and . Line is the perpendicular bisector of and intersects and at and , respectively. What is the area of quadrilateral ?
p3. The polynomial has roots that are all integers. What is ?
p4. There are balls in a bucket, and there are colors. Each color has exactly balls of that color. Every time a ball is selected uniformly, randomly, and independently from the bucket, its color is noted and the ball is replaced. What is the expected number of selections from the bucket until one ball of every color has been seen?
p5. Consider a solid rectangular prism with length , width , and height . Find the volume of the set of points that are both a distance of at most from the prism and a distance of at least from the prism.
p6. Two positive integers, and are chosen randomly, uniformly, and independently from the set of positive integers less than , . What is the expected value of the number of quadrants through which the graph will pass?
p7. John and Mitchell are playing a game to see who gets the last of their candy. John rolls three unbiased -sided dice with sides labeled through and records the maximum roll. Mitchell flips a biased coin (with probability of heads ) times and records the number of heads. What is the smallest such that Mitchell has or greater chance of winning the candy by recording a larger number?
p8. Define the sum of a finite set of integers to be the sum of the elements of the set. Let be the set of positive divisors of . How many nonempty subsets of have an even sum? (Simplify as reasonably as possible)
p9. Compute the absolute minimum of the function
p10. The largest prime factor of the number , , has digits. What is this prime factor?
p11. We play the following game with an equilateral triangle of coins (with coins on each side). Initially, all of the coins are turned heads up. On each turn, we may turn over three coins that are mutually adjacent; the goal is to make all of the coins eventually turned tails up. What is the smallest positive for which this can be achieved?
p12. Let be the first positive integers that can be so that is an integer. Compute the number of elements in that a can be so that is not a perfect square.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.