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_2af409e77728f93f"}
- id
- vea_28788f81e3b105c3
- frontier
- Erdős problems frontier
- source
- vs_ed6e9174080901e4
- finding
- vf_29c8b747d0aa12af
finding binding
boundopen_question
Erdős Problem #488 has status 'falsifiable'. Statement: Let $A$ be a finite set and $$B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}.$$ Is it true that, for every $m>n\geq \max(A)$, $$\frac{\lvert B\cap [1,m]\rvert }{m}< 2\frac{\lvert B\cap [1,n]\rvert}{n}?$$ Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_2af409e77728f93f
vs_ed6e9174080901e4
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_2af409e77728f93f"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_ccfa346f485ca5fe
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_2237de1b00a8b34bfinding.assertedCandidate claim vc_2af409e77728f93f imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_ed4a8111f2954993finding.addCandidate claim vc_2af409e77728f93f imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.