2017 LMT Individual Round - Lexington Mathematical Tournament
Source:
September 16, 2023
LMTalgebrageometrycombinatoricsnumber theory
Problem Statement
p1. Find the number of zeroes at the end of .
p2. Express in simplest radical form.
p3. John draws a square . On side he draws point so that and on side he draws point such that . What is the ratio of the area of to the area of ?
p4. Alfred, Bill, Clara, David, and Emily are sitting in a row of five seats at a movie theater. Alfred and Bill don’t want to sit next to each other, and David and Emily have to sit next to each other. How many arrangements can they sit in that satisfy these constraints?
p5. Alex is playing a game with an unfair coin which has a chance of flipping heads and a chance of flipping tails. He flips the coin three times and wins if he flipped at least one head and one tail. What is the probability that Alex wins?
p6. Positive two-digit number has divisors. Find the number of divisors of the four-digit number .
p7. Call a positive integer diagonal if the number of diagonals of a convex -gon is a multiple of the number of sides. Find the number of diagonal positive integers less than or equal to .
p8. There are houses on a street, with on each side, and each house can be colored one of 5 different colors. Find the number of ways that the houses can be painted such that no two houses on the same side of the street are the same color and not all the houses are different colors.
p9. Compute
p10. Given points in the coordinate plane, let be the unique point such that is parallel to the -axis and is parallel to the -axis. Find the point such that .
p11. In the following subtraction problem, different letters represent different nonzero digits.
\begin{tabular}{ccccc}
& M & A & T & H \\
- & & H & A & M \\
\hline
& & L & M & T \\
\end{tabular}
How many ways can the letters be assigned values to satisfy the subtraction problem?
p12. If and are integers such that , then what is the minimum possible value of ?
p13. Let . For some complex numbers , it is true that for all complex numbers . Find .p14. A positive integer is called an imposter if it can be expressed in the form where are non-negative integers and . How many almost positive integers less than are imposters?
p15. Evaluate the infinite sum
p16. Each face of a regular tetrahedron is colored either red, green, or blue, each with probability . What is the probability that the tetrahedron can be placed with one face down on a table such that each of the three visible faces are either all the same color or all different colors?
p17. Let be the point on the graph of that is closest to the point . Find .
p18. Alice is going to place rooks on a chessboard where both the rows and columns are labelled to ; the rooks are placed so that no two rooks are in the same row or the same column. The value of a square is the sum of its row number and column number. The score of an arrangement of rooks is the sumof the values of all the occupied squares. Find the average score over all valid configurations.
p19. Let be a function defined recursively across the natural numbers such that and . Find the sum of all positive divisors less than or equal to of the number .
p20. Find the number of ordered pairs of positive integers that satisfy
p21. Let be a triangle. Let be the midpoint of and let be the projection of onto . If , and , compute .
p22. For positive integers , define the odd parent function, denoted , to be the greatest positive odd divisor of . For example, , , and . Find
p23. Suppose has sidelengths and . Let be a point inside such that and . If , the compute the length of side .
p24. How many ways can some squares be colored black in a grid of squares such that each row and each column contain exactly two colored squares? Rotations and reflections of the same coloring are considered distinct.
p25. Let be a convex quadrilateral with , , and . Let be the midpoint of . If , find the length of segment .
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.