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

2022 SSMO Tiebreaker Round Problems/Problem 1

Revision as of 19:42, 15 December 2023 by Pinkpig (talk | contribs) (Created page with "==Problem== For all positive integers <math>n,</math> let <math>S(n)</math> denote the least positive integer <math>x</math> such that <math>n+x</math> is a palindrome. Find t...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For all positive integers $n,$ let $S(n)$ denote the least positive integer $x$ such that $n+x$ is a palindrome. Find the value of $\displaystyle{\sum_{n=1}^{100}S(n)}.$

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_SSMO_Tiebreaker_Round_Problems/Problem_1&oldid=207594"