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_8b5851038515bba2"}
- id
- vea_dc2cbbc6147c1995
- frontier
- Erdős problems frontier
- source
- vs_bf2945a2477fc2f0
- finding
- vf_631c5e14bdf29505
finding binding
boundopen_question
Erdős Problem #677 remains OPEN. Statement: Denote by $M(n, k)$ the least common multiple of the finite set $\{n+1, \dotsc, n+k\}$. Is it true that for all $m \geq n + k$, we get $M(m, k) \neq M(n, k)$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_8b5851038515bba2
vs_bf2945a2477fc2f0
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_8b5851038515bba2"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_edd8ac28259eb935
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_fbd2c16bb79ed4a9finding.assertedCandidate claim vc_8b5851038515bba2 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_96be1366239802d0finding.addCandidate claim vc_8b5851038515bba2 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.