Skip to published state

Erdős problem / erdos

open offer

Problem 319

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 13
availableerdos:319
Erdős 319
Advance Erdős problem 319 from its pinned statement, theorem and proof records, attempts, residual obligations, dependency context, and source locks; produce one decision-relevant artifact or an informative negative result without repeating banked routes.
  1. erdos:319
  2. site/problems/319.json
  3. erdos-frontier.problem-work.v1
Exact offer contractPacket, root, and verifier profile
erdos-frontier.problem-work.v1
site/problems/319.json
sha256:f3b5ab20ec43395b44b3244a28bb5c4e740c6b4a5817b704e5ea82710d0e0a7f

Matching finding records

1 records
  1. vf_095adf2312c4258c

    theoretical

    Erdős Problem #319: declared status 'open'. Formalized: yes. What is the size of the largest A{1,,N}A\subseteq \{1,\ldots,N\} such that there is a function δ:A{1,1}\delta:A\to \{-1,1\} such thatnAδnn=0\sum_{n\in A}\frac{\delta_n}{n}=0andnAδnn0\sum_{n\in A'}\frac{\delta_n}{n}\neq 0for all non-empty AAA'\subsetneq A? Current best: Adenwalla has observed that a lower bound ofA(11e+o(1))N\lvert A\rvert\geq (1-\tfrac{1}{e}+o(1))Nfollows from the main result of Croot [Cr01], which states that there exists some set of integers B[(1eo(1))N,N]B\subset [(\frac{1}{e}-o(1))N,N] such that bB1b=1\sum_{b\in B}\frac{1}{b}=1. Since the sum of 1m\frac{1}{m} for m[c1N,c2N]m\in [c_1N,c_2N] is asymptotic to log(c2/c1)\log(c_2/c_1) we must have B(11e+o(1))N\lvert B\rvert \geq (1-\tfrac{1}{e}+o(1))N. Prize: no. Tags: number theory, unit fractions.

    recordedOpen record