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_a5cb32b09844ad42"}
- id
- vea_d1c1b20cb0028b1f
- frontier
- Erdős problems frontier
- source
- vs_db5e952683d63bdf
- finding
- vf_20c835788cca05fd
finding binding
boundtheoretical
Erdős Problem #1214 has been PROVED (Erdős's conjecture holds). Statement: Let $x,y\geq 1$ be integers such that, for all $n\geq 1$, the set of primes dividing $x^{n}-1$ is equal to the set of primes dividing $y^n-1$. Must $x=y$? Erdős asked this at a 1988 number theory conference in Banff. A positive answer was given by Corrales-Rodrigáñez and Schoof [CoSc97]. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_a5cb32b09844ad42
vs_db5e952683d63bdf
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_a5cb32b09844ad42"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_3947f93f0338d27e
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_bb43d1dcd07c9275finding.assertedCandidate claim vc_a5cb32b09844ad42 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_31fdc9a59772b6a9finding.addCandidate claim vc_a5cb32b09844ad42 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.