Skip to published state

Erdős problem / erdos

open offer

Problem 302

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 4
availableerdos:302
Erdős 302
Advance Erdős problem 302 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. Targeterdos:302
  2. Packetsite/problems/302.json
  3. Verifiererdos-frontier.problem-work.v1
Inspect ranked work
Exact offer contractPacket, root, and verifier profile
Verifier
erdos-frontier.problem-work.v1
Packet
site/problems/302.json
Packet root
sha256:7c60b65c39b76b38ef18cae2bf3a7670396676555391d1eb9053b63ccfaaf11a

Matching finding records

1 records

  1. vf_7faca3da4c387539

    theoretical

    Erdős Problem #302: declared status 'open'. Formalized: no. Let f(N)f(N) be the size of the largest A⊆{1,…,N}A\subseteq \{1,\ldots,N\} such that there are no solutions to1a=1b+1c\frac{1}{a}= \frac{1}{b}+\frac{1}{c}with distinct a,b,c∈Aa,b,c\in A? Estimate f(N)f(N). In particular, is f(N)=(12+o(1))Nf(N)=(\tfrac{1}{2}+o(1))N? Prize: no. OEIS: A390395. Tags: number theory, unit fractions.

    recordedOpen record