|
|
| (One intermediate revision by the same user not shown) |
| Line 1: |
Line 1: |
| − | ==Problem 1==
| + | '''2025 SSMO Speed Round''' problems and solutions. The first link contains the full set of test problmems. The second link contains the answer key. The rest contain each individual problem and its solution. |
| − | | + | *[[2025 SSMO Speed Round Problems]] |
| − | Define <cmath>f(x) = \begin{cases} x + 2 & \text{if } x < 0 \\ x^2 + 1 & \text{if } x \geq 0 \end{cases}</cmath> and let <math>x_0 = -3</math>. Define <math>x_{n+1} = f(x_n)</math>. Find the least <math>n</math> such that <math>x_n > 100</math>.
| + | *[[2025 SSMO Speed Round Answer Key]] |
| − | | + | **[[2025 SSMO Speed Round Problems/Problem 1|Problem 1]] |
| − | [[2025 SSMO Speed Round Problems/Problem 1|Solution]] | + | **[[2025 SSMO Speed Round Problems/Problem 2|Problem 2]] |
| − | | + | **[[2025 SSMO Speed Round Problems/Problem 3|Problem 3]] |
| − | ==Problem 2==
| + | **[[2025 SSMO Speed Round Problems/Problem 4|Problem 4]] |
| − | | + | **[[2025 SSMO Speed Round Problems/Problem 5|Problem 5]] |
| − | Let <math>A</math> and <math>B</math> be points such that <math>AB = 50</math>. Points <math>M</math> and <math>N</math> lie on <math>\overline{AB}</math> such that <math>M</math> lies between points <math>A</math> and <math>N</math> and <math>N</math> lies between points <math>B</math> and <math>M</math>. Given that <math>MN = 20</math> and <math>AN \cdot BM</math> is maximized, find the length of <math>AM</math>.
| + | **[[2025 SSMO Speed Round Problems/Problem 6|Problem 6]] |
| − | | + | **[[2025 SSMO Speed Round Problems/Problem 7|Problem 7]] |
| − | [[2025 SSMO Speed Round Problems/Problem 2|Solution]] | + | **[[2025 SSMO Speed Round Problems/Problem 8|Problem 8]] |
| − | | + | **[[2025 SSMO Speed Round Problems/Problem 9|Problem 9]] |
| − | ==Problem 3==
| + | **[[2025 SSMO Speed Round Problems/Problem 10|Problem 10]] |
| − | | |
| − | Anna is buying different types of cheese from the local supermarket. Let <math>x,</math> <math>y,</math> and <math>z</math> be the number of pieces of blue, cheddar, and mozzarella cheese, respectively, that Anna buys. She can buy any nonnegative integer number of each type, but the total number of pieces must be at most 12. How many different combinations <math>(x, y, z)</math> of cheese can Anna buy? (Anna is allowed to buy 0 pieces of cheese.)
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 3|Solution]] | |
| − | | |
| − | ==Problem 4==
| |
| − | | |
| − | In rectangle <math>ABCD,</math> let <math>AB = 8,BC = 15,\omega</math> be the circumcircle of <math>ABCD</math>, <math>\ell</math> be the line through <math>B</math> parallel to <math>AC,</math> and <math>X \neq B</math> be the intersection of <math>\ell</math> and <math>\omega</math>. Suppose the value of <math>BX</math> can be expressed as <math>\frac{m}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 4|Solution]] | |
| − | | |
| − | ==Problem 5==
| |
| − | | |
| − | Let <math>N = 101112\cdots9899</math> be the number formed when all the two-digit positive integers are concatenated in increasing order. How many ordered triples of digits <math>(a,b,c)</math> are there such that <math>a,</math> <math>b,</math> and <math>c</math> appear as consecutive digits (in that order) in the decimal representation of <math>N</math>?
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 5|Solution]] | |
| − | | |
| − | ==Problem 6==
| |
| − | | |
| − | The centroid <math>G</math> of <math>\triangle{ABC}</math> has distances <math>21,</math> <math>60,</math> and <math>28</math> from sides <math>AB,</math> <math>BC,</math> and <math>CA,</math> respectively. Find the perimeter of <math>\triangle{ABC}</math>.
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 6|Solution]] | |
| − | | |
| − | ==Problem 7==
| |
| − | | |
| − | Positive integers <math>a</math> and <math>b</math> satisfy <math>63a = 40b</math>. The sum of all possible values of <math>\tfrac{\varphi(a)}{\varphi(b)}</math> is <math>\frac{m}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 7|Solution]] | |
| − | | |
| − | ==Problem 8==
| |
| − | | |
| − | Let <math>S</math> be the set of all ordered pairs <math>(P,Q),</math> where <math>P</math> and <math>Q</math> are subsets of <math>\{1,2,\dots, 25\}</math> satisfying <math>|P\cup Q| = 17</math> and <math>|(P\cap Q)\cap \{20,25\}|\ge 1</math>. If an ordered pair <math>(A,B)</math> is chosen randomly from <math>S,</math> the expected value of <math>|A\cap B|</math> is <math>\tfrac{m}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 8|Solution]] | |
| − | | |
| − | ==Problem 9==
| |
| − | | |
| − | Let <math>ABC</math> be a triangle. The point <math>P</math> lies on side <math>BC,</math> the point <math>Q</math> lies on side <math>AB,</math> and the point <math>R</math> lies on side <math>AC</math> such that <math>PQ = BQ,</math> <math>CR = PR,</math> and <math>\angle APB < 90^\circ</math>. Let <math>H</math> be the foot of the altitude from <math>A</math> to <math>BC</math>. Given that <math>BP = 3,</math> <math>CP = 5,</math> and <math>[AQPR] = \tfrac{3}{7} \cdot [ABC],</math> the value of <math>BH \cdot CH</math> can be expressed in the form <math>\tfrac{m}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 9|Solution]] | |
| − | | |
| − | ==Problem 10==
| |
| − | | |
| − | Let <math>p</math> be a quadratic with a positive leading coefficient, and let <math>r</math> be a real number satisfying <math>r < 1 < \tfrac{5}{2r} < 5</math>. Given that <math>p(p(x)) = x</math> for <math>x \in \{ r,1, \tfrac{5}{2r} , 5\}</math>, find <math>p(12)</math>.
| |
| − | | |
| − | [[2025 SSMO Speed Round Problems/Problem 10|Solution]] | |
