VibeMathed – Math problems solved by AI
Erdős Problem #106DisprovedUnder reviewErdős #106 · Discrete Geometry, PackingIf f(n)f(n)f(n) is the maximum total side length of nnn interior-disjoint squares packed in the unit square, is f(k2+1)=kf(k^2 + 1) = kf(k2+1)=k? An exact rational configuration packs 171717 squares with total side length greater than 444, refuting the identity at k=4k = 4k=4.Posed by —·Open —·Model OpenAI Codex (OpenAI)·Solved 2026-07-29Lean-verifiedNotability 010
- ▪Erdős Problem #106DisprovedUnder reviewErdős #106 · Discrete Geometry, PackingIf f(n)f(n)f(n) is the maximum total side length of nnn interior-disjoint squares packed in the unit square, is f(k2+1)=kf(k^2 + 1) = kf(k2+1)=k?
- ▪An exact rational configuration packs 171717 squares with total side length greater than 444, refuting the identity at k=4k = 4k=4.Posed by —·Open —·Model OpenAI Codex (OpenAI)·Solved 2026-07-29Lean-verifiedNotability 010
2 outlets in our directory ran this story, first to last over 19 hours. All of the coverage we found sits in one bucket: centre. That one-sidedness is itself worth noticing.
- ▪ Theo Conjecture solves 35-year-old math problem, finds a term no one predicted — Firstprinciples
Hacker News (AI / LLM) files mainly under ai. We currently carry 3,300 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | VibeMathed |
| Canonical URL | https://vibemathed.com |
| Publication time | Thu, 30 Jul 2026 15:23:09 +0000 |
| Retrieval time | 2026-07-30T15:32:02.133Z |
| Last seen | 2026-07-30T15:32:02.133Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | FxyAIg6CGHJk · 2 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Erdős Problem #106DisprovedUnder reviewErdős #106 · Discrete Geometry, PackingIf f(n)f(n)f(n) is the maximum total side length of nnn interior-disjoint squares packed in the unit square, is f(k2+1)=kf(k^2 + 1) = kf(k2+1)=k? An exact rational configuration packs 171717 squares with total side length greater than 444, refuting the identity at k=4k = 4k=4.Posed by —·Open —·Model OpenAI Codex (OpenAI)·Solved 2026-07-29Lean-verifiedNotability 010
Excerpt limited to ~120 words for fair-use compliance. The full article is at VibeMathed.