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 "2023 SSMO Tiebreaker Round Problems/Problem 3"

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) 21:30, 15 December 2023‎ Pinkpig (talk | contribs)‎ . . (448 bytes) (+448)‎ . . (Created page with "==Problem== For <math>n\geq4,</math> let <math>a_n</math> be the maximum possible value of <math>P(n+1)</math> given that <math>P(x)</math> is a <math>n</math> degree monic po...")
Retrieved from "https://artofproblemsolving.com/wiki/index.php/2023_SSMO_Tiebreaker_Round_Problems/Problem_3"