benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / An n-string is a string of digits formed by writing the numbers 1,2,…,n in some order (in base ten). For example, one possible 10-string is 35728910461 What is the smallest n>1 suc…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

An nn-string is a string of digits formed by writing the numbers 1,2,…,n1,2, \ldots, n in some order (in base ten). For example, one possible 10-string is 3572891046135728910461 What is the smallest n>1n>1 such that there exists a palindromic nn-string?
Plain-text mathematical notation (without MathML)
An n-string is a string of digits formed by writing the numbers 1,2,…,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?
Original LaTeX notation
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?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
6541ea1e-19a0-510f-853e-94348322b233
task_key
test--6541ea1e-19a0-510f-853e-94348322b233
task_revision_id
1
config / split
/ test

Official source

initial import