benchmarks.wiki / Public workspace

Omni-MATH / A palindrome is a positive integer which reads in the same way in both…

Problem

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

problem

A palindrome is a positive integer which reads in the same way in both directions (for example, 11, 343343 and 20022002 are palindromes, while 20052005 is not). Is it possible to find 20052005 pairs in the form of (n,n+110)(n, n + 110) where both numbers are palindromes?
Plain-text mathematical notation (without MathML)
A palindrome is a positive integer which reads in the same way in both directions (for example, 1, 343 and 2002 are palindromes, while 2005 is not). Is it possible to find 2005 pairs in the form of (n,n+110) where both numbers are palindromes?
Original LaTeX notation
A palindrome is a positive integer which reads in the same way in both directions (for example, $1$, $343$ and $2002$ are palindromes, while $2005$ is not). Is it possible to find $2005$ pairs in the form of $(n, n + 110)$ where both numbers are palindromes?

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

Official source

initial import