Skip to published state

Erdős problem / erdos

no open offer

Problem 242

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_f80ecbd0246333e9

    theoretical

    Erdős Problem #242 [status: falsifiable; formalized: yes]. For every n>2n>2 there exist distinct integers 1x<y<z1\leq x<y<z such that4n=1x+1y+1z.\frac{4}{n} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z}. Current best: Schinzel conjectured the generalisation that, for any fixed aa, if nn is sufficiently large in terms of aa then there exist distinct integers 1x<y<z1\leq x<y<z such thatan=1x+1y+1z.\frac{a}{n} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z}.This problem has been formalised in Lean as part of the Google DeepMind Formal Conjectures project. Prize: no. OEIS: A073101, A075245, A075246, A075247, A075248, A287116. Tags: number theory, unit fractions.

    recordedOpen record