New pages
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 13:12, 11 September 2025 2022 CEMC Cayley Problems/Problem 2 (hist) [1,423 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The integer <math>119</math> is a multiple of <math> \text{ (A) }\ 2 \qquad\text{ (B) }\ 3 \qquad\text{ (C) }\ 5 \qquad\text{ (D) }\ 7 \qquad\text{ (E) }\ 11</mat...")
- 12:47, 11 September 2025 2022 CEMC Cayley Problems/Problem 15 (hist) [1,037 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The integers <math>a</math>, <math>b</math>, and <math>c</math> satisfy the equations <math>a + 5 = b</math> and <math>5 + b = c</math> and <math>b + c = a</math>....")
- 12:20, 11 September 2025 2023 CEMC Cayley Problems/Problem 1 (hist) [692 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== What is the value of <math>\frac{1}{1} + \frac{2}{2} + \frac{3}{3}</math>? <math> \text{ (A) }\ 1 \qquad\text{ (B) }\ 0 \qquad\text{ (C) }\ 3 \qquad\text{ (D) }\...")
- 12:14, 11 September 2025 2022 CEMC Cayley Problems/Problem 1 (hist) [350 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The expression <math>2 + (0 \times 2^2)</math> is equal to <math> \text{ (A) }\ 1 \qquad\text{ (B) }\ 2 \qquad\text{ (C) }\ 4 \qquad\text{ (D) }\ 5 \qquad\text{ (...")
- 02:11, 11 September 2025 2025 AMC 10A Problems/Problem 9 (hist) [0 bytes] Glowworm (talk | contribs) (Created page with "The 2020 AMC 10A has not been created yet. Try checking out some of the other problems from the past.")
- 14:44, 9 September 2025 2006 CEMC Fermat Problems/Problem 8 (hist) [1,417 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== If Corina had added the numbers <math>P</math> and <math>Q</math> correctly, the answer would have been <math>16</math>. By mistake, she subtracted <math>Q</math>...")
- 14:38, 9 September 2025 2006 CEMC Fermat Problems/Problem 7 (hist) [685 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== What is the smallest positive integer <math>p</math> for which <math>\sqrt{2^3 \times 5 \times p}</math> is an integer? <math> \text{ (A) }\ 2 \qquad\text{ (B) }\...")
- 14:34, 9 September 2025 2006 CEMC Fermat Problems/Problem 6 (hist) [809 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The regular price for a T-shirt is <math>\$25</math> and the regular price for a pair of jeans is <math>\$75</math>. If the T-shirt is sold at a <math>30\%</math>...")
- 14:29, 9 September 2025 2006 CEMC Fermat Problems/Problem 5 (hist) [930 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== Three cubes have edges of lengths <math>4</math>, <math>5</math>, and <math>6</math>. The average (mean) of their volumes is {{Image needed}} <math> \text{ (A) }\...")
- 14:24, 9 September 2025 2006 CEMC Fermat Problems/Problem 4 (hist) [526 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The value <math>(\sqrt{\sqrt{9} + \sqrt{1}})^{4}</math> is <math> \text{ (A) }\ \sqrt{10} \qquad\text{ (B) }\ 10 \qquad\text{ (C) }\ 16 \qquad\text{ (D) }\ 82 \qq...")
- 14:02, 9 September 2025 2006 CEMC Fermat Problems/Problem 3 (hist) [598 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The value <math>\frac{4^3}{10^2 - 6^2}</math> is <math> \text{ (A) }\ 1 \qquad\text{ (B) }\ 0.5 \qquad\text{ (C) }\ -35.36 \qquad\text{ (D) }\ 1.5 \qquad\text{ (E...")
- 13:58, 9 September 2025 2006 CEMC Fermat Problems/Problem 2 (hist) [787 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== If <math>2x + 3x + 4x = 12 + 9 + 6</math>, then <math>x</math> equals <math> \text{ (A) }\ 6 \qquad\text{ (B) }\ 3 \qquad\text{ (C) }\ 1 \qquad\text{ (D) }\ \frac...")
- 13:54, 9 September 2025 2006 CEMC Fermat Problems/Problem 1 (hist) [505 bytes] Anabel.disher (talk | contribs) (Created page with "==Problem== The value of <math>\frac{1}{4 \times 5}</math> is <math> \text{ (A) }\ 0.45 \qquad\text{ (B) }\ 0.05 \qquad\text{ (C) }\ 1.25 \qquad\text{ (D) }\ 0.20 \qquad\text...")
- 10:45, 9 September 2025 2025 SSMO Relay Round 5 Answer Key (hist) [9 bytes] Pinkpig (talk | contribs) (Created page with "#7 #20 #8")
- 10:45, 9 September 2025 2025 SSMO Relay Round 4 Answer Key (hist) [10 bytes] Pinkpig (talk | contribs) (Created page with "#3 #21 #17")
- 10:45, 9 September 2025 2025 SSMO Relay Round 3 Answer Key (hist) [17 bytes] Pinkpig (talk | contribs) (Created page with "#392 #153664 #168")
- 10:45, 9 September 2025 2025 SSMO Relay Round 2 Answer Key (hist) [13 bytes] Pinkpig (talk | contribs) (Created page with "#66 #130 #463")
- 10:45, 9 September 2025 2025 SSMO Relay Round 1 Answer Key (hist) [12 bytes] Pinkpig (talk | contribs) (Created page with "#3 #4500 #90")
- 10: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^...")
- 10: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...")
- 10: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...")
- 10: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),...")
- 10: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...")
- 10: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...")
- 10: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<...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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+...")
- 10:42, 9 September 2025 2025 SSMO Relay Round 1 Problems/Problem 2 (hist) [202 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...")
- 10: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...")
- 10:42, 9 September 2025 2025 SSMO Relay Round 1 Problems/Problem 1 (hist) [917 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...")
- 10: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,...")
- 10: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...")
- 10: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...")
- 10: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^...")
- 10:37, 9 September 2025 2025 SSMO Relay Round 1 Problems (hist) [805 bytes] Pinkpig (talk | contribs) (Created page with "==Problem 1== Solution ==Problem 2== Solution ==Problem 3== 2025 SSMO R...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10:35, 9 September 2025 2025 SSMO Tiebreaker Round Answer Key (hist) [14 bytes] Pinkpig (talk | contribs) (Created page with "#51 #674 #1616")
- 10: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,...")
- 10: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==")
- 10: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...")
- 10: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...")
- 10: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...")
