Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Recurso digital |
| Sprache: | |
| Veröffentlicht: |
Zenodo
2026
|
| Online-Zugang: | https://doi.org/10.5281/zenodo.19395252 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Inhaltsangabe:
- <p>This paper investigates the divisibility properties and representability of palindromic numbers with arbitrary digit lengths. It proves that even-digit palindromic numbers are always divisible by 11, and establishes the necessary and sufficient condition for odd-digit palindromic numbers to be divisible by 11. A core theorem is constructed: a palindromic number can be expressed as the sum of a natural number and its reverse (with leading zeros allowed for digit alignment) if and only if it is divisible by 11. The conclusion is generalized to numbers of any digit length, and the inherent contradiction that renders non-multiples of 11 unrepresentable is explained through carryover structure. Iterative verification is performed on the 196 family of Lychrel candidates, revealing the structural root of their failure to produce palindromic numbers. The results of this paper provide a rigorous and unified criterion for the construction and determination of palindromic numbers in elementary number theory.</p> <p>CORRECTION NOTICE: This manuscript contains critical errors and is hereby retracted in its current form. The authors apologize for any inconvenience caused</p> <p> </p>