MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

n-String Digit String Count

1925SpecialistCombinatoricsCounting Principles

Harvard-MIT Mathematics Tournament

An $n$-string is a string of digits formed by writing the numbers $1, 2, \ldots, n$ in some order (in base ten). For example, one possible 10-string is 35728910461 What is the smallest $n > 1$ such that there exists a palindromic $n$-string?
0 students attempted0% solvedRating 1925

Related practice paths

AIME PracticeInteger-answer practice for deeper multi-step problems.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.