Resolution of an Erdős' problem on least common multiples
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917801199927296 |
|---|---|
| author | Cambie, Stijn |
| author_facet | Cambie, Stijn |
| contents | Erdős posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question affirmatively by proving that the ratio of the lcm's can be made arbitrarily large. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_09138 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Resolution of an Erdős' problem on least common multiples Cambie, Stijn General Mathematics 11A05, 11A07, 11A51 Erdős posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question affirmatively by proving that the ratio of the lcm's can be made arbitrarily large. |
| title | Resolution of an Erdős' problem on least common multiples |
| topic | General Mathematics 11A05, 11A07, 11A51 |
| url | https://arxiv.org/abs/2410.09138 |