Permanent problem IDPPL 040
Number theory
Let f(n) be maximal such that if A⊆ℕ has | A|=n then ∏_(a≠ b∈ A)(a+b) has at least f(n) distinct prime factors. Is it true that f(n)/log n→∈fty?
Let f(n) be maximal such that if A⊆ℕ has | A|=n then ∏_(a≠ b∈ A)(a+b) has at least f(n) distinct prime factors. Is it true that f(n)/log n→∈fty?
A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.