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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_9db3af2842fafa64"}
- id
- vea_073798771aef6525
- frontier
- Erdős problems frontier
- source
- vs_ace974b31360c102
- finding
- vf_aea14e6cfdc43558
finding binding
boundopen_question
Erdős Problem #730 remains OPEN. Statement: Are there infinitely many pairs of integers $n < m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors? Topics: number theory, binomial coefficients, base representations. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A129515.
source binding
source-boundcap_61973ee16b553d57 · vc_9db3af2842fafa64
vs_ace974b31360c102
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_9db3af2842fafa64"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_b09df11d43b63262
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_a119df385b97f34ffinding.assertedCandidate claim vc_9db3af2842fafa64 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_4695890609f7179bfinding.addCandidate claim vc_9db3af2842fafa64 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.