2022 SSMO Accuracy Round Problems
Contents
Problem 1
Consider a bijective function (meaning each element in the domain maps to a distinct element in the range) where . What is the average of , over all ?
Problem 2
Consider a cone with radius and height , and a point in the same plane as the base of the cone, but a distance of from the center of the base of the cone. We rotate the cone about such that the plane that the base of the cone lies on stays the same. The volume of the region that the cone sweeps out can be expressed as . Find .
Problem 3
Let and Suppose that is a point in space such that bisects and are coplanar. In addition, If can be expressed as , where and are relatively prime positive integers and is squarefree, find
Problem 4
A monic polynomial has real roots A monic polynomial has roots Given that the minimum possible value of is for relatively prime positive integers and find
Problem 5
Find the number of ordered pairs , where , for which the largest integer that satisfies for all is .
Problem 6
Consider an unfair -sided die labeled from to , such that the probability of rolling a number is directly proportional to . However, if we roll any number , then the probability of rolling a number less than becomes , and the probability of rolling any number from to inclusive remains directly proportional to . The expected number of rolls until a is rolled can be expressed as , where and are relatively prime positive integers. Find .
Problem 7
After a robber drives in a car for (not necessarily integral) minutes, the car goes at miles per hour. Whenever the car's speed drops below miles per hour, the robber switches into a new car with no time loss. A police car can drive at a constant speed of 117 miles per hour. Given that the robber starts 1 hour before the police car, how many minutes will pass between when the police car starts and when the police car catches up to the robber?
Problem 8
Let be a trapezoid with . Suppose that , , , and . Let be the midpoint of . If is the intersection of and , and , then , where and are relatively prime positive integers. Find
Problem 9
The graph has vertices labeled , such that is not connected to , is not connected to , and so on. Suppose that all the vertices other than have different degrees (number of connections to the vertex). Find the sum of all possible values for the number of edges (connections) in .
Problem 10
Let Then the value of can be expressed as , where and are relatively prime positive integers. Find the largest positive integer such that .