Permanent problem IDPPL 074
Number theory
Let g(n) be minimal such that for any A⊆ [2,∈fty)∩ ℕ with | A| =n and any set I of max(A) consecutive integers there exists some B⊆ I with | B|=g(n) such that ∏_(a∈ A) a ∣ ∏_(b∈ B)b. Is it true that g(n) ≤ (2+o(1))n? Or perhaps even g(n)≤ 2n?
Let g(n) be minimal such that for any A⊆ [2,∈fty)∩ ℕ with | A| =n and any set I of max(A) consecutive integers there exists some B⊆ I with | B|=g(n) such that ∏_(a∈ A) a ∣ ∏_(b∈ B)b. Is it true that g(n) ≤ (2+o(1))n? Or perhaps even g(n)≤ 2n?
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.