Difference between revisions of "2021 WSMO Speed Round Problems"
(→Problem 6) |
|||
Line 1: | Line 1: | ||
==Problem 1== | ==Problem 1== | ||
Let <math>f^1(x)=(x-1)^2</math>, and let <math>f^n(x)=f^1(f^{n-1}(x))</math>. Find the value of <math>|f^7(2)|</math>. | Let <math>f^1(x)=(x-1)^2</math>, and let <math>f^n(x)=f^1(f^{n-1}(x))</math>. Find the value of <math>|f^7(2)|</math>. | ||
+ | |||
+ | [i]Proposed by pinkpig[i] | ||
[[2021 WSMO Speed Round Problems/Problem 1|Solution]] | [[2021 WSMO Speed Round Problems/Problem 1|Solution]] | ||
Line 6: | Line 8: | ||
==Problem 2== | ==Problem 2== | ||
A square with side length of <math>4</math> units is rotated around one of its sides by <math>90^{\circ}</math>. If the volume the square sweeps out can be expressed as <math>m\pi</math>, find <math>m</math>. | A square with side length of <math>4</math> units is rotated around one of its sides by <math>90^{\circ}</math>. If the volume the square sweeps out can be expressed as <math>m\pi</math>, find <math>m</math>. | ||
+ | |||
+ | [i]Proposed by mahaler[i] | ||
[[2021 WSMO Speed Round Problems/Problem 2|Solution]] | [[2021 WSMO Speed Round Problems/Problem 2|Solution]] | ||
Line 11: | Line 15: | ||
==Problem 3== | ==Problem 3== | ||
Let <math>a@b=\frac{a^2-b^2}{a+b}</math>. Find the value of <math>1@(2@(\dots(2020@2021)\dots)</math>. | Let <math>a@b=\frac{a^2-b^2}{a+b}</math>. Find the value of <math>1@(2@(\dots(2020@2021)\dots)</math>. | ||
+ | |||
+ | [i]Proposed by asimov[i] | ||
[[2021 WSMO Speed Round Problems/Problem 3|Solution]] | [[2021 WSMO Speed Round Problems/Problem 3|Solution]] | ||
Line 21: | Line 27: | ||
==Problem 5== | ==Problem 5== | ||
The number of ways to arrange the characters in "delicious greenbeans" into two separate strings of letters can be expressed as <math>a\cdot b!,</math> where <math>b</math> is maximized and both <math>a</math> and <math>b</math> are positive integers. Find <math>a+b.</math> (A string of letters is defined as a group of consecutive letters with no spaces between them.) | The number of ways to arrange the characters in "delicious greenbeans" into two separate strings of letters can be expressed as <math>a\cdot b!,</math> where <math>b</math> is maximized and both <math>a</math> and <math>b</math> are positive integers. Find <math>a+b.</math> (A string of letters is defined as a group of consecutive letters with no spaces between them.) | ||
+ | |||
+ | [i]Proposed by pinkpig[i] | ||
[[2021 WSMO Speed Round Problems/Problem 5|Solution]] | [[2021 WSMO Speed Round Problems/Problem 5|Solution]] | ||
Line 27: | Line 35: | ||
A bag weighs 1 pound and can hold 16 pounds of food at maximum. Danny buys 100 packages of tomatoes and 300 packages of potatoes. Tomatoes come in packages that are <math>12</math> ounces each and potatoes come in packages that are <math>24</math> ounces each. If all of Danny's food must go in bags, how many pounds does Danny's total luggage weigh, including the bags? (Note that Danny will use only as many bags as he needs and that packages have to stay together). | A bag weighs 1 pound and can hold 16 pounds of food at maximum. Danny buys 100 packages of tomatoes and 300 packages of potatoes. Tomatoes come in packages that are <math>12</math> ounces each and potatoes come in packages that are <math>24</math> ounces each. If all of Danny's food must go in bags, how many pounds does Danny's total luggage weigh, including the bags? (Note that Danny will use only as many bags as he needs and that packages have to stay together). | ||
+ | [i]Proposed by pinkpig[i] | ||
[[2021 WSMO Speed Round Problems/Problem 6|Solution]] | [[2021 WSMO Speed Round Problems/Problem 6|Solution]] | ||
Line 32: | Line 41: | ||
==Problem 7== | ==Problem 7== | ||
Consider triangle <math>ABC</math> with side lengths <math>AB=13,AC=14,BC=15</math> and incircle <math>\omega</math>. A second circle <math>\omega_2</math> is drawn which is tangent to <math>AB,AC</math> and externally tangent to <math>\omega</math>. The radius of <math>\omega_2</math> can be expressed as <math>\frac{a-b\sqrt{c}}{d}</math>, where <math>\gcd{(a,b,d)}=1</math> and <math>c</math> is not divisible by the square of any prime. Find <math>a+b+c+d</math>. | Consider triangle <math>ABC</math> with side lengths <math>AB=13,AC=14,BC=15</math> and incircle <math>\omega</math>. A second circle <math>\omega_2</math> is drawn which is tangent to <math>AB,AC</math> and externally tangent to <math>\omega</math>. The radius of <math>\omega_2</math> can be expressed as <math>\frac{a-b\sqrt{c}}{d}</math>, where <math>\gcd{(a,b,d)}=1</math> and <math>c</math> is not divisible by the square of any prime. Find <math>a+b+c+d</math>. | ||
+ | |||
+ | [i]Proposed by pinkpig[i] | ||
[[2021 WSMO Speed Round Problems/Problem 7|Solution]] | [[2021 WSMO Speed Round Problems/Problem 7|Solution]] | ||
Line 37: | Line 48: | ||
==Problem 8== | ==Problem 8== | ||
Let <math>n</math> be the number of ways to seat <math>12</math> distinguishable people around a regular hexagon such that rotations do not matter (but reflections do), and two people are seated on each side (the order in which they are seated matters). Find the number of divisors of <math>n</math>. | Let <math>n</math> be the number of ways to seat <math>12</math> distinguishable people around a regular hexagon such that rotations do not matter (but reflections do), and two people are seated on each side (the order in which they are seated matters). Find the number of divisors of <math>n</math>. | ||
+ | |||
+ | [i]Proposed by captainnobody[i] | ||
[[2021 WSMO Speed Round Problems/Problem 8|Solution]] | [[2021 WSMO Speed Round Problems/Problem 8|Solution]] | ||
Line 64: | Line 77: | ||
</asy> | </asy> | ||
</center> | </center> | ||
+ | |||
+ | [i]Proposed by pinkpig[i] | ||
[[2021 WSMO Speed Round Problems/Problem 9|Solution]] | [[2021 WSMO Speed Round Problems/Problem 9|Solution]] | ||
Line 69: | Line 84: | ||
==Problem 10== | ==Problem 10== | ||
Find the remainder when <math>\underbrace{2021^{2022^{\ldots^{2022^{2021}}}}}_{2021\text{ } 2021\text{'}s}\cdot\underbrace{2022^{2021^{\ldots^{2021^{2022}}}}}_{2022\text{ }2022\text{'}s}</math> is divided by 11. | Find the remainder when <math>\underbrace{2021^{2022^{\ldots^{2022^{2021}}}}}_{2021\text{ } 2021\text{'}s}\cdot\underbrace{2022^{2021^{\ldots^{2021^{2022}}}}}_{2022\text{ }2022\text{'}s}</math> is divided by 11. | ||
+ | |||
+ | [i]Proposed by pinkpig[i] | ||
[[2021 WSMO Speed Round Problems/Problem 10|Solution]] | [[2021 WSMO Speed Round Problems/Problem 10|Solution]] |
Revision as of 11:33, 6 June 2022
Contents
Problem 1
Let , and let . Find the value of .
[i]Proposed by pinkpig[i]
Problem 2
A square with side length of units is rotated around one of its sides by . If the volume the square sweeps out can be expressed as , find .
[i]Proposed by mahaler[i]
Problem 3
Let . Find the value of .
[i]Proposed by asimov[i]
Problem 4
A square with side length is placed inside of a right isosceles triangle with such that and are on , is on , and is on . Find the area of .
Problem 5
The number of ways to arrange the characters in "delicious greenbeans" into two separate strings of letters can be expressed as where is maximized and both and are positive integers. Find (A string of letters is defined as a group of consecutive letters with no spaces between them.)
[i]Proposed by pinkpig[i]
Problem 6
A bag weighs 1 pound and can hold 16 pounds of food at maximum. Danny buys 100 packages of tomatoes and 300 packages of potatoes. Tomatoes come in packages that are ounces each and potatoes come in packages that are ounces each. If all of Danny's food must go in bags, how many pounds does Danny's total luggage weigh, including the bags? (Note that Danny will use only as many bags as he needs and that packages have to stay together).
[i]Proposed by pinkpig[i]
Problem 7
Consider triangle with side lengths and incircle . A second circle is drawn which is tangent to and externally tangent to . The radius of can be expressed as , where and is not divisible by the square of any prime. Find .
[i]Proposed by pinkpig[i]
Problem 8
Let be the number of ways to seat distinguishable people around a regular hexagon such that rotations do not matter (but reflections do), and two people are seated on each side (the order in which they are seated matters). Find the number of divisors of .
[i]Proposed by captainnobody[i]
Problem 9
Bobby is going to throw 20 darts at the dartboard shown below. It is formed by 4 concentric circles, with radii of and , with the largest circle being inscribed in a square. Each point on the dartboard has an equally likely chance of being hit by a dart, and Bobby is guaranteed to hit the dartboard. Each region is labeled with its point value (the number of points Bobby will get if he hits that region). The expected number of points Bobby will get after throwing the 20 darts can be expressed as where . Find \newline
[i]Proposed by pinkpig[i]
Problem 10
Find the remainder when is divided by 11.
[i]Proposed by pinkpig[i]