Diophantine Analysis of a Digital Anomaly
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915657676750848 |
|---|---|
| author | Seraj, Samer |
| author_facet | Seraj, Samer |
| contents | The arithmetic-digital anomaly of $5÷2 = 2.5$ has been observed several times in the past. We generalize it to an exponential Diophantine equation and inequality in the general number base, which is the object of our analysis. First, we produce a near-parametrization of all solutions using a modification of the standard parametrization of Pythagorean triples. We use this parametrized function to find all solutions where the numerator and denominator are coprime, and we construct infinite families where they are not coprime. Next, we use a variant of Baker's theorem from transcendental number theory to prove that each number base admits only finitely many solutions. Lastly, we use the $abc$ conjecture to conditionally show that only finitely many solutions have a numerator with $k$ digits, for each $k\ge 3$. A conjecture is offered for $k=2$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_06056 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Diophantine Analysis of a Digital Anomaly Seraj, Samer History and Overview 11D61, 11J86, 11D09, 11A63 The arithmetic-digital anomaly of $5÷2 = 2.5$ has been observed several times in the past. We generalize it to an exponential Diophantine equation and inequality in the general number base, which is the object of our analysis. First, we produce a near-parametrization of all solutions using a modification of the standard parametrization of Pythagorean triples. We use this parametrized function to find all solutions where the numerator and denominator are coprime, and we construct infinite families where they are not coprime. Next, we use a variant of Baker's theorem from transcendental number theory to prove that each number base admits only finitely many solutions. Lastly, we use the $abc$ conjecture to conditionally show that only finitely many solutions have a numerator with $k$ digits, for each $k\ge 3$. A conjecture is offered for $k=2$. |
| title | Diophantine Analysis of a Digital Anomaly |
| topic | History and Overview 11D61, 11J86, 11D09, 11A63 |
| url | https://arxiv.org/abs/2512.06056 |