evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- 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
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_f4a60e8e7d9049e0"}
- id
- vea_e45c5ccc71c11282
- frontier
- Erdős problems frontier
- source
- vs_99739ef9bed53fde
- finding
- vf_3ecc100261603880
finding binding
boundopen_question
Erdős Problem #126 remains OPEN. Statement: Let $f(n)$ be maximal such that if $A\subseteq\mathbb{N}$ has $|A| = n$ then $\prod_{a\neq b\in A}(a + b)$ has at least $f(n)$ distinct prime factors. Is it true that $\frac{f(n)}{\log n} \to\infty$? Topics: number theory. Erdős prize: $250. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_f4a60e8e7d9049e0
vs_99739ef9bed53fde
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_f4a60e8e7d9049e0"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_67f4e7f7e448b0d4
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_84b81c6bf38eb2b8finding.assertedCandidate claim vc_f4a60e8e7d9049e0 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_acac240968822b05finding.addCandidate claim vc_f4a60e8e7d9049e0 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.