New pages
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 11:45, 9 September 2025 2025 SSMO Relay Round 2 Answer Key (hist) [13 bytes] Pinkpig (talk | contribs) (Created page with "#66 #130 #463")
- 11:45, 9 September 2025 2025 SSMO Relay Round 1 Answer Key (hist) [12 bytes] Pinkpig (talk | contribs) (Created page with "#3 #4500 #90")
- 11:44, 9 September 2025 2025 SSMO Relay Round 5 Problems/Problem 3 (hist) [234 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> How many positive integers <math>n</math> satisfy <cmath>\operatorname{lcm}(\operatorname{gcd}(n, n^2 + T^2), \operatorname{gcd}(T, n^...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 5 Problems/Problem 2 (hist) [645 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Ethan places <math>T</math> red cards and <math>T</math> blue cards in a row so that the leftmost card is red and every second card is...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 5 Problems/Problem 1 (hist) [727 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== The numbers <math>17</math> and <math>25</math> are written on a blackboard. Every second, if the number <math>n</math> is currently written on the blackboard, it...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 4 Problems/Problem 3 (hist) [531 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> A particle moves in the coordinate plane such that at any time <math>t,</math> its position is <cmath>\left(\sum_{a=1}^{T-1} \cos(at),...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 4 Problems/Problem 2 (hist) [443 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Jonathan and Kate are playing a game with <math>n</math> sticks. On each turn, a player may remove <math>1,</math> <math>2,</math> or...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 4 Problems/Problem 1 (hist) [403 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Call a positive integer <i>chuzzed</i> if the sum of the digits in its binary representation is equal to the units digit of its base-<math>10</math> representatio...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 3 Problems/Problem 3 (hist) [480 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> The numbers <math>1</math> and <math>2</math> are written on a board. Every second, if the numbers currently on the board are <math>x<...")
- 11:44, 9 September 2025 2025 SSMO Relay Round 3 Problems/Problem 2 (hist) [245 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> In triangle <math>ABC,</math> angle <math>C</math> is a right angle. If the median from <math>C</math> has length <math>T,</math> find...")
- 11:43, 9 September 2025 2025 SSMO Relay Round 3 Problems/Problem 1 (hist) [381 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Michael, Nico, and Jackson are splitting a <math>100</math> dollar bill. Michael's favorite number is <math>3,</math> so he insists on paying a positive amount of...")
- 11:43, 9 September 2025 2025 SSMO Relay Round 2 Problems/Problem 3 (hist) [682 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Define a \textit{multiplicative partition} of a positive integer <math>n</math> as the value of a product <math>a_1a_2\cdots a_k,</mat...")
- 11:43, 9 September 2025 2025 SSMO Relay Round 2 Problems/Problem 2 (hist) [340 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Let <math>x_1,x_2,\dots, x_{T}</math> be an increasing sequence of positive integers such that for every positive integer <math>1\le n...")
- 11:43, 9 September 2025 2025 SSMO Relay Round 2 Problems/Problem 1 (hist) [204 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>(p,q,r)</math> be the real solution to following system: <cmath>\begin{align*} pq &= 20 \\ qr &= 25 \\ r+p &= 9. \end{align*}</cmath> Compute <math>p^2+...")
- 11:42, 9 September 2025 2025 SSMO Relay Round 1 Problems/Problem 2 (hist) [204 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> A positive integer is called \textit{zro} if more than half of its digits are <math>0</math>. Find the sum of the first <math>T^2</mat...")
- 11:42, 9 September 2025 2025 SSMO Relay Round 1 Problems/Problem 3 (hist) [194 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Positive integers <math>m</math> and <math>n</math> satisfy <math>m^2-n^2 = T</math>. What is the least possible value of <math>m+n</m...")
- 11:42, 9 September 2025 2025 SSMO Relay Round 1 Problems/Problem 1 (hist) [270 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>x_1, x_2, \ldots, x_7</math> be distinct integers such that the mean of <math>\{x_i,x_{i+1},x_{i+2}\}</math> is an integer for all integers <math>1\le i...")
- 11:41, 9 September 2025 2025 SSMO Relay Round 5 Problems (hist) [1,745 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== The numbers <math>17</math> and <math>25</math> are written on a blackboard. Every second, if the number <math>n</math> is currently written on the blackboard,...")
- 11:40, 9 September 2025 2025 SSMO Relay Round 4 Problems (hist) [1,516 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== Call a positive integer <i>chuzzed</i> if the sum of the digits in its binary representation is equal to the units digit of its base-<math>10</math> representat...")
- 11:40, 9 September 2025 2025 SSMO Relay Round 3 Problems (hist) [1,245 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== Michael, Nico, and Jackson are splitting a <math>100</math> dollar bill. Michael's favorite number is <math>3,</math> so he insists on paying a positive amount...")
- 11:39, 9 September 2025 2025 SSMO Relay Round 2 Problems (hist) [1,365 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== Let <math>(p,q,r)</math> be the real solution to following system: <cmath>\begin{align*} pq &= 20 \\ qr &= 25 \\ r+p &= 9. \end{align*}</cmath> Compute <math>p^...")
- 11:37, 9 September 2025 2025 SSMO Relay Round 1 Problems (hist) [807 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== Solution ==Problem 2== Solution ==Problem 3== 2025 SSMO R...")
- 11:36, 9 September 2025 2025 SSMO Relay Round 5 (hist) [423 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Relay Round 5''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. *202...")
- 11:36, 9 September 2025 2025 SSMO Relay Round 4 (hist) [423 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Relay Round 4''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. *202...")
- 11:36, 9 September 2025 2025 SSMO Relay Round 3 (hist) [423 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Relay Round 3''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. *202...")
- 11:36, 9 September 2025 2025 SSMO Relay Round 2 (hist) [423 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Relay Round 2''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. *202...")
- 11:36, 9 September 2025 2025 SSMO Relay Round 1 (hist) [423 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Relay Round 1''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. *202...")
- 11:35, 9 September 2025 2025 SSMO Relay Rounds (hist) [291 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Relay Rounds''' problems and solutions. The following 5 links contain problems and solutions for the 5 relay rounds in the 2024 SSMO. *2025 SSMO Relay Round 1...")
- 11:35, 9 September 2025 2025 SSMO Tiebreaker Round Answer Key (hist) [14 bytes] Pinkpig (talk | contribs) (Created page with "#51 #674 #1616")
- 11:34, 9 September 2025 2025 SSMO Tiebreaker Round Problems/Problem 3 (hist) [210 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Find the number of functions <math>f:\{1, 2, 3, 4, 5, 6, 7, 8\} \to \{1, 2, 3, 4\}</math> such that <math>f(2f(x)) = f(x)</math> for all <math>x \in \{1, 2, 3, 4,...")
- 11:34, 9 September 2025 2025 SSMO Tiebreaker Round Problems/Problem 2 (hist) [171 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Determine the largest positive integer <math>n</math> satisfying <cmath>\frac{\sqrt{n+1} - \sqrt{n}}{\sqrt{n+2026} - \sqrt{n+2025}} > 2.</cmath> ==Solution==")
- 11:34, 9 September 2025 2025 SSMO Tiebreaker Round Problems/Problem 1 (hist) [1,126 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== In a triangular grid, each cell must contain exactly one number such that: * Each cell in the bottom row contains either <math>0</math> or <math>1</math>. * Each...")
- 11:34, 9 September 2025 2025 SSMO Tiebreaker Round Problems (hist) [1,655 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== In a triangular grid, each cell must contain exactly one number such that: * Each cell in the bottom row contains either <math>0</math> or <math>1</math>. * Eac...")
- 11:33, 9 September 2025 2025 SSMO Tiebreaker Round (hist) [482 bytes] Pinkpig (talk | contribs) (Created page with "'''2025 SSMO Tiebreaker 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...")
- 11:33, 9 September 2025 2025 SSMO Team Round Answer Key (hist) [61 bytes] Pinkpig (talk | contribs) (Created page with "#32 #4 #64 #1 #7 #121 #69 #36 #832 #54 #271 #659 #71 #60 #901")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 15 (hist) [846 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== The circles <math>\omega_1</math> and <math>\omega_2</math> have radii <math>8</math> and <math>7</math>, respectively, and intersect at points <math>A</math> and...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 14 (hist) [197 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Find the number of ordered triples of positive integers <math>(a,b,c)</math> such that <math>a+b+c=305</math> and <math>ab+bc+ca</math> is a multiple of <math>305...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 13 (hist) [679 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>S</math> be the set of all ordered quintuples of integers <math>(x_1,x_2,x_3,x_4,x_5)</math> satisfying <math>0 \le x_1\le x_2\le x_3\le x_4 \le x_5\le...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 12 (hist) [291 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>a_n=(4+3\sqrt2)^n</math> for all nonnegative integers <math>n</math>. Let <cmath>\sum_{k=0}^\infty\frac{\lfloor a_k\rfloor}{10^k}=\frac{m}{n},</cmath> w...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 11 (hist) [568 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Squares <math>s_1,</math> <math>s_2,</math> and <math>s_3</math> with side lengths <math>9,</math> <math>17,</math> and <math>10,</math> respectively, lie inside...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 10 (hist) [381 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Anna has a three term arithmetic sequence of integers. She divides each term of her sequence by a positive integer <math>n>1</math>, and tells Bob that the three...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 9 (hist) [382 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Pairwise distinct integers <math>a,</math> <math>b,</math> <math>c,</math> and <math>d</math> satisfy the system of equations <cmath>\begin{align*} ab &= cd \\ a...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 8 (hist) [268 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Adam has a fair coin with a <math>2</math> written on one side and a <math>3</math> written on the other. What is the expected number of times Adam needs to flip...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 6 (hist) [420 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== The rhombus <math>PQRS</math> has side length <math>3</math>. The point <math>X</math> lies on segment <math>PR</math> such that line <math>QX</math> is perpendic...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 7 (hist) [347 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>n</math> be the largest integer such that <math>20!^{25!} + 25!^{20!}</math> is divisible by <math>2025^n</math>. The value of <math>n</math> can be wri...")
- 11:32, 9 September 2025 2025 SSMO Team Round Problems/Problem 5 (hist) [143 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Bob rolls a fair six-sided die until he rolls an even number. What is the expected sum of all the numbers he rolled? ==Solution==")
- 11:31, 9 September 2025 2025 SSMO Team Round Problems/Problem 4 (hist) [330 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>P(x) = x^2 - ax + b</math> be a quadratic with nonzero real coefficients. Given that <math>P(a)</math> and <math>P(-b)</math> are roots of <math>P(x),</...")
- 11:31, 9 September 2025 2025 SSMO Team Round Problems/Problem 3 (hist) [436 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== A rectangle is divided as shown into nine smaller rectangles. The areas of the five smallest rectangles are <math>1,</math> <math>2,</math> <math>3,</math> <math>...")
- 11:30, 9 September 2025 2025 SSMO Team Round Problems/Problem 2 (hist) [174 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== Nonnegative integers <math>a</math> and <math>b</math> satisfy <math>a!+b^4 = 16a+41</math>. Find the sum of all possible values of <math>b</math>. ==Solution==")
- 11:30, 9 September 2025 2025 SSMO Team Round Problems/Problem 1 (hist) [280 bytes] Pinkpig (talk | contribs) (Created page with "==Problem== There are <math>N</math> solutions <math>(a,b,c)</math> to <math>a + b^2 + c = 2025,</math> where <math>a</math> and <math>b</math> are positive integers and <mat...")
