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_620bd26c871b964d"}
- id
- vea_54b2541fe0ff6544
- frontier
- Erdős problems frontier
- source
- vs_d4465b9fbff2fea5
- finding
- vf_e5a829e19b7dd9a8
finding binding
boundopen_question
Erdős Problem #392 has status 'proved (lean)'. Statement: Let $A(n)$ denote the least value of $t$ such that $$ n! = a_1 \cdots a_t $$ with $a_1 \leq \cdots \leq a_t\leq n^2$. Then $$ A(n) = \frac{n}{2} - \frac{n}{2\log n} + o\left(\frac{n}{\log n}\right). $$ Topics: number theory, factorials. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_620bd26c871b964d
vs_d4465b9fbff2fea5
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_620bd26c871b964d"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_f82f9cd223821014
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_81860c8d43307b02finding.assertedCandidate claim vc_620bd26c871b964d imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_209cc7a04cc09986finding.addCandidate claim vc_620bd26c871b964d imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.