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

2023 SSMO Tiebreaker Round Problems/Problem 3

Revision as of 21:30, 15 December 2023 by Pinkpig (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For $n\geq4,$ let $a_n$ be the maximum possible value of $P(n+1)$ given that $P(x)$ is a $n$ degree monic polynomial that satisfies $P(i)\in\{1,2,3\dots,n\}$ for $1\leq i \leq n.$ If $\frac{m}{n} = \sum_{n=4}^{\infty}\frac{a_n-n!}{3^n},$ for relatively prime positive integers $m$ and $n,$ find $m+n.$

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2023_SSMO_Tiebreaker_Round_Problems/Problem_3&oldid=207690"