|
|
| Line 14: |
Line 14: |
| | | | |
| | [[2022 SSMO Relay Round 1 Problems/Problem 3|Solution]] | | [[2022 SSMO Relay Round 1 Problems/Problem 3|Solution]] |
| − |
| |
| − |
| |
| − | ==Problem 1==
| |
| − |
| |
| − | Bobby is bored one day and flips a fair coin until it lands on tails. Bobby wins if the coin lands on heads a positive even number of times in the sequence of tosses. Then the probability that Bobby wins can be expressed in the form <math>\tfrac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 1|Solution]]
| |
| − | ==Problem 2==
| |
| − |
| |
| − | A bag is big enough to hold exactly 6 large pencils, 12 medium pencils, or 30 small pencils, with no space left over. Given that there is 1 large pencil and 3 medium pencils currently in the bag, what is the maximum number of small pencils that may be added to the bag? Note that there may still be space left over in the bag.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 2|Solution]]
| |
| − | ==Problem 3==
| |
| − |
| |
| − | Let <math>ABCD</math> be a parallelogram such that <math>E</math> is a point on <math>CD</math> such that <math>\frac{CE}{DE}=\frac{2}{3}.</math> Suppose that <math>BE</math> and <math>AC</math> intersect at <math>F.</math> If the area of triangle <math>AEF</math> is <math>15,</math> find the area of <math>ABCD</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 3|Solution]]
| |
| − | ==Problem 4==
| |
| − |
| |
| − | Consider a quadrilateral <math>ABCD</math> with area <math>120</math> and satisfying <math>AB+CD=AD+BC=24</math>. There exists a point <math>P</math> in 3D space such that the distances from <math>P</math> to <math>AB</math>, <math>BC</math>, <math>CD</math>, and <math>DA</math> are all equal to <math>13</math>. Find the volume of <math>PABCD</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 4|Solution]]
| |
| − | ==Problem 5==
| |
| − |
| |
| − | Let <math>ABCD</math> be a square such that <math>E</math> is on <math>AD</math> and <math>F</math> is on <math>CD.</math> If <math>AE=DF</math> and <math>\frac{[BEF]}{[ABCD]}=\frac{7}{18},</math> then the value of <math>\frac{EF^2}{BC^2}</math> can be expressed as <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 5|Solution]]
| |
| − | ==Problem 6==
| |
| − |
| |
| − | At the beginning of day <math>1</math>, there is a single bacterium in a petri dish. During each day, each bacterium in the petri dish divides into <math>a>1</math> new bacteria, and <math>b\ge 1</math> bacteria are added to the petri dish (these bacteria do not divide on the day they were added). For example, at the end of day <math>1</math>, there are <math>a+b</math> bacteria in the petri dish. If, at the end of day <math>4</math>, the number of bacteria in the petri dish is a multiple of <math>48</math>, find the minimum possible value of <math>a+b</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 6|Solution]]
| |
| − | ==Problem 7==
| |
| − |
| |
| − | Let <math>A_1=(1, 0)</math>. Define <math>A_{n+1}</math> as the image of <math>A_n</math> under a rotation of either <math>45^{\circ}</math>, <math>90^{\circ}</math>, or <math>135^{\circ}</math> clockwise about the origin, with each choice having a <math>\frac{1}{3}</math> chance of being selected. Find the expected value of the smallest positive integer <math>n>1</math> such that <math>A_n</math> coincides with <math>A_1</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 7|Solution]]
| |
| − | ==Problem 8==
| |
| − |
| |
| − | How many positive integers cannot be written as <math>7a + 19b + 28c</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are positive integers (not necessarily distinct)?
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 8|Solution]]
| |
| − | ==Problem 9==
| |
| − |
| |
| − | Consider a triangle <math>ABC</math> such that <math>AB=13</math>, <math>BC=14</math>, <math>CA=15</math> and a square <math>WXYZ</math> such that <math>Y</math> and <math>Z</math> lie on <math>\overleftrightarrow{BC}</math>, <math>W</math> lies on <math>\overleftrightarrow{AB}</math>, and <math>X</math> lies on <math>\overleftrightarrow{CA}</math>. Suppose further that <math>W</math>, <math>X</math>, <math>Y</math>, and <math>Z</math> are distinct from <math>A</math>, <math>B</math>, and <math>C</math>. Let <math>O</math> be the center of <math>WXYZ</math>. If <math>AO</math> intersects <math>BC</math> at <math>P</math>, then the sum of all values of <math>\frac{BP}{CP}</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>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 9|Solution]]
| |
| − | ==Problem 10==
| |
| − |
| |
| − | Let <math>S = \{2,7,15,26,....\}</math> be the set of all numbers for which the <math>i^{th}</math> element in <math>S</math> is the sum of the <math>i^{th}</math> triangular number and the <math>i^{th}</math> positive perfect square. Let <math>T</math> be the set which contains all unique remainders when the elements in <math>S</math> are divided by <math>2022</math>. Find the number of elements in <math>T</math>.
| |
| − |
| |
| − | [[2022 SSMO Speed Round Problems/Problem 10|Solution]]
| |
are distinct digits where 
such that 
where 
. Find 
.
TNYWR. Now, let 
and 
have equations 
and 
respectively. Suppose that 
is a point on 
such that the shortest distance from 
. Given that 
is a point on 
and 
is a point on 
, find 
a triangle such that 
, and 
Find the remainder when the product of all possible values of 
is divided by 
.
