Proving it is impossible; on Erdős problem $\# 278$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912553415737344 |
|---|---|
| author | Cambie, Stijn |
| author_facet | Cambie, Stijn |
| contents | Erdős asked many mathematical questions. Some lead to exciting research, others turned out to be easily solved. In this article, we provide evidence that one of his questions, Erdős problem \#278 , has no general answer. We do so by relating it with a hard knapsack problem instance,and by demonstrating that different, non-equivalent formulas arise depending on the structure of the moduli. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18270 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Proving it is impossible; on Erdős problem $\# 278$ Cambie, Stijn Combinatorics 05-01 Erdős asked many mathematical questions. Some lead to exciting research, others turned out to be easily solved. In this article, we provide evidence that one of his questions, Erdős problem \#278 , has no general answer. We do so by relating it with a hard knapsack problem instance,and by demonstrating that different, non-equivalent formulas arise depending on the structure of the moduli. |
| title | Proving it is impossible; on Erdős problem $\# 278$ |
| topic | Combinatorics 05-01 |
| url | https://arxiv.org/abs/2508.18270 |