Skip to published state

Erdős problem / erdos

no open offer

Problem 1041

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_81f42b0bfc280f7b

    theoretical

    Erdős Problem #1041 [status: falsifiable; formalized: yes]. Let f(z)=i=1n(zzi)C[z]f(z)=\prod_{i=1}^n(z-z_i)\in \mathbb{C}[z] with zi<1\lvert z_i\rvert < 1 for all ii. Must there always exist a path of length less than 22 in{z:f(z)<1}\{z: \lvert f(z)\rvert < 1\}which connects two of the roots of ff? Prize: no. Tags: analysis.

    recordedOpen record