Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Revision history of "2025 SSMO Relay Round 2 Problems/Problem 2"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 11:43, 9 September 2025‎ Pinkpig (talk | contribs)‎ . . (340 bytes) (+340)‎ . . (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...")
Retrieved from "https://artofproblemsolving.com/wiki/index.php/2025_SSMO_Relay_Round_2_Problems/Problem_2"