Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | English |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.17611257 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866901903679422464 |
|---|---|
| author | Caraccioli Abrego, Ricardo Adonis |
| author_facet | Caraccioli Abrego, Ricardo Adonis |
| contents | <p>We study a very simple condition on the decimal digits of a positive integer. Let PD(n) be the product of the decimal digits of n. We show that if n has at least 22 digits and satisfies the divisibility condition “n divides PD(n) minus 1”, then n must be a repunit, that is, all of its digits are equal to 1. The proof is purely a size comparison: for 22 or more digits, the maximum possible product of digits is already smaller than the smallest integer with that many digits, so the only way the divisibility can hold is when PD(n) equals 1. The remaining finite range of digit lengths from 1 to 21 can be checked by computer; we include a short Python script that performs an exhaustive search up to 6 digits (and can be extended further) and report that no non-repunit examples were found. We also briefly explain how the same argument works in any integer base greater than or equal to 3.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17611257 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | An elementary note on a digit–product condition forcing repunits Caraccioli Abrego, Ricardo Adonis <p>We study a very simple condition on the decimal digits of a positive integer. Let PD(n) be the product of the decimal digits of n. We show that if n has at least 22 digits and satisfies the divisibility condition “n divides PD(n) minus 1”, then n must be a repunit, that is, all of its digits are equal to 1. The proof is purely a size comparison: for 22 or more digits, the maximum possible product of digits is already smaller than the smallest integer with that many digits, so the only way the divisibility can hold is when PD(n) equals 1. The remaining finite range of digit lengths from 1 to 21 can be checked by computer; we include a short Python script that performs an exhaustive search up to 6 digits (and can be extended further) and report that no non-repunit examples were found. We also briefly explain how the same argument works in any integer base greater than or equal to 3.</p> |
| title | An elementary note on a digit–product condition forcing repunits |
| url | https://doi.org/10.5281/zenodo.17611257 |