record state
frontier-ownedfrontiers / 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
Finding bundle
back to stateErdős Problem #694 has status 'solved (lean)'. Statement: Let $f_\max(n)$ be the largest $m$ such that $\phi(m) = n$, and $f_\min(n)$ be the smallest such $m$, where $\phi$ is Euler's totient function. Investigate $$ \max_{n\leq x}\frac{f_\max(n)}{f_\min(n)}. $$ GPT-5.5 Pro (prompted by Price) has proved (see also the comments for a summary) that $$ \max_{n\leq x}\frac{f_{\max}(n)}{f_{\min}(n)}=(e^\gamma+o(1))\log\log x. $$ A Lean formalisation of the reduction exists, conditional on Mertens' product theorem and Linnik's theorem; see the [formal proof](https://github.com/Shashi456/erdos-formalizations/blob/main/Erdos/P694/Proof.lean). Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
- id
- vf_548d85ccc6d3d37c
- frontier
- Erdős problems frontier
- version
- 1
- confidence
- 0.99
no incoming links yet
file
/frontier/erdos-problems/at/vev_9a5efe8213cf9bbcpermalink · after_hash f4248ea9e18be913…vf_548d85ccc6d3d37c · erdos-problems · snapshot sha256:adf5cd08914be106b09be94cb69e55449b5195f7c3e9894fc07c7fc288c446c0 · https://vela-site-next.fly.dev/frontier/erdos-problems/at/vev_9a5efe8213cf9bbcciteraw json · vf_548d85ccc6d3d37c (2.9 KB)
{
"assertion": {
"direction": null,
"entities": [],
"relation": null,
"text": "Erdős Problem #694 has status 'solved (lean)'. Statement: Let $f_\\max(n)$ be the largest $m$ such that $\\phi(m) = n$, and $f_\\min(n)$ be the smallest such $m$, where $\\phi$ is Euler's totient function. Investigate $$ \\max_{n\\leq x}\\frac{f_\\max(n)}{f_\\min(n)}. $$ GPT-5.5 Pro (prompted by Price) has proved (see also the comments for a summary) that $$ \\max_{n\\leq x}\\frac{f_{\\max}(n)}{f_{\\min}(n)}=(e^\\gamma+o(1))\\log\\log x. $$ A Lean formalisation of the reduction exists, conditional on Mertens' product theorem and Linnik's theorem; see the [formal proof](https://github.com/Shashi456/erdos-formalizations/blob/main/Erdos/P694/Proof.lean). Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.",
"type": "open_question"
},
"conditions": {
"age_group": null,
"cell_type": null,
"clinical_trial": false,
"concentration_range": null,
"duration": null,
"human_data": false,
"in_vitro": false,
"in_vivo": false,
"species_unverified": [],
"species_verified": [],
"text": "Agent-imported candidate claim; scope requires review."
},
"confidence": {
"basis": "agent-imported candidate claim; reviewer acceptance required",
"extraction_confidence": 0.7,
"kind": "frontier_epistemic",
"method": "expert_judgment",
"score": 0.99
},
"created": "2026-05-30T00:42:06.826507+00:00",
"evidence": {
"effect_size": null,
"evidence_spans": [
{
"artifact_id": "va_9bc926d75e4e3881",
"artifact_packet_id": "cap_61973ee16b553d57",
"candidate_claim_id": "vc_cc4fc15311b97749"
}
],
"method": "ScienceClaw-shaped artifact packet import",
"model_system": "agent artifact packet",
"p_value": null,
"replicated": false,
"replication_count": null,
"sample_size": null,
"species": null,
"type": "computational"
},
"flags": {
"contested": false,
"declining": false,
"gap": false,
"gravity_well": false,
"negative_space": false,
"retracted": false
},
"id": "vf_548d85ccc6d3d37c",
"links": [],
"previous_version": null,
"provenance": {
"authors": [
{
"name": "Erdős Open-Problem spine ingest",
"orcid": null
}
],
"citation_count": null,
"doi": null,
"extraction": {
"extracted_at": "2026-05-30T00:42:06.826507+00:00",
"extractor_version": "vela/0.691.0",
"method": "artifact_to_state_import",
"model": "agent:erdos-spine-ingest",
"model_version": null
},
"journal": null,
"openalex_id": null,
"pmc": null,
"pmid": null,
"publisher": "artifact packet",
"review": {
"corrections": [],
"reviewed": false,
"reviewed_at": null,
"reviewer": null
},
"source_type": "model_output",
"title": "cap_61973ee16b553d57 · vc_cc4fc15311b97749",
"url": "https://www.erdosproblems.com/694",
"year": null
},
"updated": null,
"version": 1
}Unsealed — 0 attachment(s) on record, awaiting independent verification.
0 attachments · 0 distinct checker actors · 0 methods
blame · custody trail
vev_90e1ae49a2d6683dhistory · 1 event
finding statement
finding typeopen_question
No entity list is declared.
evidence
source-bound1 atoms
computational · ScienceClaw-shaped artifact packet import · agent artifact packet
proof impact
packet context1 events
1 reviewable changes and 0 evaluation records are attached to this finding id.
evidence
method
ScienceClaw-shaped artifact packet import
evidence type
computational
system
agent artifact packet
evidence spans
span recorded
conditions
- species_unverified
- species_verified
- text
- Agent-imported candidate claim; scope requires review.
provenance
source title
cap_61973ee16b553d57 · vc_cc4fc15311b97749
authors
Erdős Open-Problem spine ingest
Source records
1Evidence atoms
1- vea_1d361737d2e832fdcomputational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_cc4fc15311b97749"}
vs_ef2303ee158e5d7f · span:0 · artifact_to_state_import
Typed links
0outgoing
No outgoing links.
incoming
No incoming links.
Review, event, and evaluation records
2events
vev_90e1ae49a2d6683dfinding.assertedCandidate claim vc_cc4fc15311b97749 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_d110170198daf7dafinding.addCandidate claim vc_cc4fc15311b97749 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation record targets this finding id.