Skip to published state

Erdős problem / erdos

no open offer

Problem 334

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_1b24133f14ee1871

    theoretical

    Erdős Problem #334: declared status 'open'. Formalized: no. Find the best function f(n)f(n) such that every nn can be written as n=a+bn=a+b where both a,ba,b are f(n)f(n)-smooth (that is, are not divisible by any prime p>f(n)p>f(n).) Current best: This is known, and the best bound is due to Balog [Ba89] who proved thatf(n)ϵn49e+ϵf(n) \ll_\epsilon n^{\frac{4}{9\sqrt{e}}+\epsilon}for all ϵ>0\epsilon>0. Prize: no. OEIS: A045535, A062241. Tags: number theory.

    recordedOpen record