Positive spoof Lehmer factorizations
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909909042331648 |
|---|---|
| author | Molnar, Grant Singh, Guntas |
| author_facet | Molnar, Grant Singh, Guntas |
| contents | We investigate the integer solutions of Diophantine equations related to Lehmer's totient conjecture. We give an algorithm that computes all nontrivial spoof Lehmer factorizations with a fixed number of factors, and enumerate all nontrivial spoof Lehmer factorizations with 6 or fewer factors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_17076 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Positive spoof Lehmer factorizations Molnar, Grant Singh, Guntas Number Theory Discrete Mathematics 16D70 (Primary) 16P70, 16U60, 16U80 (Secondary) We investigate the integer solutions of Diophantine equations related to Lehmer's totient conjecture. We give an algorithm that computes all nontrivial spoof Lehmer factorizations with a fixed number of factors, and enumerate all nontrivial spoof Lehmer factorizations with 6 or fewer factors. |
| title | Positive spoof Lehmer factorizations |
| topic | Number Theory Discrete Mathematics 16D70 (Primary) 16P70, 16U60, 16U80 (Secondary) |
| url | https://arxiv.org/abs/2409.17076 |