Source authenticated

Erdős Problem #1189

exact largest modulus 3·2^{k-3} for k ≥ 5, near-linear least maximum, reciprocal mass Θ(log k), and an infinite divisor family; the counting asymptotic rests on the cited BBMST theorem

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Jul 13, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Editorial metadata: CC BY 4.0; linked content retains its own rights.

Canonical aliases: Erdős Problem #1189 · Erdős #1189 · Problem 1189

Confidence: Not scored

Registry verification: lean verified · announcement · partial

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.6 Star Fleet (Claude Fable 5 referee)
model · ai model contributor · OpenAI / Anthropic

Lineage and corrections

This event attributed to GPT-5.6 Star Fleet (Claude Fable 5 referee)

VibeMathed record: Erdős Problem #1189 evidence for this event

Erdős Problem #1189 evidence for this event

Erdős Problem #1189 parent of this event

exact largest modulus 3·2^{k-3} for k ≥ 5, near-linear least maximum, reciprocal mass Θ(log k), and an infinite divisor family; the counting asymptotic rests on the cited BBMST theorem parent of this event

Act on this frontier

Verify, challenge, or extend the result.