Skip to published state

Erdős problem / erdos

open offer

Problem 307

Exact records and bounded producer offers matched to this problem.

Current bounded offer

rank 7
availableerdos:307
Erdős 307
Advance Erdős problem 307 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:307
  2. Packetsite/problems/307.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/307.json
Packet root
sha256:9a641b14fe9353d3148c79128f98aaffc139601495ebc84001c82d72b722038a

Matching finding records

1 records

  1. vf_b0ef5a3d6e6183c9

    theoretical

    Erdős Problem #307 [status: verifiable; formalized: yes]. Are there two finite sets of primes P,QP,Q such that1=(∑p∈P1p)(∑q∈Q1q)?1=\left(\sum_{p\in P}\frac{1}{p}\right)\left(\sum_{q\in Q}\frac{1}{q}\right)? Prize: no. Tags: number theory, unit fractions.

    recordedOpen record