Vela

frontiers / frontier

Erdős problems frontier

constellation seal · derived from vfr_37aec80d874a0239
id
vfr_37aec80d874a0239
license
CC-BY-4.0
findings
1,256
accepted core
6
contested
0
links
17
sources
1,234
evidence
1,256
avg conf
0.98

used by 0 · replayed by 2 producers

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Reviewable change

back to review

add a finding

claimed — no verifier run, no signed judgmentopen

Erdős #313 (?, AMS 11). STATEMENT: This set contains all solutions `(m, P)` to the Erdős problem 313. A solution is a pair where `m` is an integer `≥ 2` and `P` is a non-empty, finite set of distinct prime numbers, such that the sum of the reciprocals of the primes in `P` equals `1 - 1/m`. FORMAL: erdos_313: answer(sorry) ↔ erdos313Solutions.Infinite; erdos_313: (6, {2, 3}) ∈ erdos313Solutions; erdos_313: (42, {2, 3, 7}) ∈ erdos313Solutions KNOWN/REMARKS: # Erdős Problem 313 *References:* - erdosproblems.com/313 - A54377 (Primary pseudoperfect numbers) | Are there infinitely many pairs `(m, P)` where `m ≥ 2` is an integer and `P` is a set of distinct primes such that the following equation holds: $\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}$? | An integer `n` is a **primary pseudoperfect number** if it is the denominator `m` in a solution `(m, P)` RELATED: [] OEIS: []

id
vpr_5b00ea2389d2f233
frontier
Erdős problems frontier
kind
finding.add
created
2026-06-04

A proposal; no authority until an accepted review event.

accept gate

0 of 4 on record
·
signature
no terminal verdict yet
·
chain
no state transition yet
witness
no verifier attachment on record for this target
·
grade
target not (yet) in frontier state

timeline

  1. 2026-06-04proposeproposed · finding.addagent — machine actor, no signing keyagent:erdos-deep-ingestvpr_5b00ea2389d2f233Candidate claim vc_87fdda54cb4400bf imported from artifact packet cap_f4e8bcd294c97ba7

proposed

reason

Candidate claim vc_87fdda54cb4400bf imported from artifact packet cap_f4e8bcd294c97ba7

finding type

theoretical

proposed confidence

0.95

confidence basis

agent-imported candidate claim; reviewer acceptance required

provenance

proposed by

agent — machine actor, no signing keyagent:erdos-deep-ingest

actor type

agent

created at

2026-06-04

target type

finding

Diff

Read-only frontier; diff not recomputed.

Review chain

  1. 01request

    Change request

    Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.

    open review
  2. 02packet

    Diff packet

    The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.

    open the campaign
  3. 03checks

    Check output

    Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.

    inspect checks
  4. 04review

    Reviewer decision

    A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.

    read queue
  5. 05accepted

    Accepted event

    Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.

    inspect events

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.