2016 BmMT Individual Round - Berkley mini Math Tournament
Source:
November 4, 2023
bmmtalgebrageometrycombinatoricsnumber theory
Problem Statement
p1. David is taking a -question test, and he needs to answer at least of the questions correctly in order to pass the test. What is the minimum number of questions he must answer correctly in order to pass the test?
p2. You decide to flip a coin some number of times, and record each of the results. You stop flipping the coin once you have recorded either heads, or tails. What is the maximum number of times that you could have flipped the coin?
p3. The width of a rectangle is half of its length. Its area is square meters. What is the length of the rectangle, in meters?
p4. Carol is twice as old as her younger brother, and Carol's mother is times as old as Carol is. The total age of all three of them is . How old is Carol's mother?
p5. What is the sum of all two-digit multiples of ?
p6. The number is divisible by its last two digits, meaning that is divisible by . What is the smallest integer larger than that is also divisible by its last two digits?
p7. Let and both be squares whose perimeters add to . The area of to the area of is in a ratio of . Find the side length of .
p8. How many -digit positive integers have the property that the digits are strictly increasing from left to right? For instance, is an example of such a number, while is not.
p9. During a game, Steve Korry attempts free throws, making 16 of them. How many more free throws does he have to attempt to finish the game with accuracy, assuming he makes them all?
p10. How many dierent ways are there to arrange the letters such that is a contiguous substring?
For reference, the term "contiguous substring" means that the letters appear in that order, all next to one another. For example, would be such a string, while would not be.
p11. Suppose you roll two fair -sided dice. What is the probability that their sum is divisible by ?
p12. Suppose that two of the three sides of an acute triangle have lengths and , respectively. How many possible integer values are there for the length of the third side?
p13. Suppose that between Beijing and Shanghai, an airplane travels miles per hour, while a train travels at miles per hour. You must leave for the airport hours before your flight, and must leave for the train station minutes before your train. Suppose that the two methods of transportation will take the same amount of time in total. What is the distance, in miles, between the two cities?
p14. How many nondegenerate triangles (triangles where the three vertices are not collinear) with integer side lengths have a perimeter of ? Two triangles are considered distinct if they are not congruent.
p15. John can drive miles per hour on a paved road and miles per hour on a gravel road. If it takes John minutes to drive a road that is miles long, what fraction of the time does John spend on the paved road?
p16. Alice rolls one pair of -sided dice, and Bob rolls another pair of -sided dice. What is the probability that at least one of Alice's dice shows the same number as at least one of Bob's dice?
p17. When is divided by and expressed in decimal form, what is the number of digits to the right of the decimal point? Trailing zeroes should not be included.
p18. Suppose you have a bar of chocolate squares. You want to break the bar into smaller chunks, so that after some sequence of breaks, no piece has an area of more than . What is the minimum possible number of times that you must break the bar?
For an example of how breaking the chocolate works, suppose we have a bar and wish to break it entirely into bars. We can break it once to get two bars. Then, we would have to break each of these individual bars in half in order to get all the bars to be size , and we end up using breaks in total.
p19. A class of students decides to form two distinguishable committees, each with students. In how many ways can they do this, if the two committees can have no more than one student in common?
p20. You have been told that you are allowed to draw a convex polygon in the Cartesian plane, with the requirements that each of the vertices has integer coordinates whose values range from to inclusive, and that no pair of vertices can share the same or coordinate value (so for example, you could not use both and in your polygon, but and is fine). What is the largest possible area that your polygon can have?
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.