erdős #633
Classify those triangles which can only be cut into a square number of congruent triangles.
Worked, still open.
geometry · solved · prize $25 · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
This is (literally) one of Erdős’s $25 problems: a full **classification is still open**. ([Erdős Problems][1]) But there is a fairly sharp *partial* classification that captures a huge (“generic”) class of triangles, and it explains why “only squares” is the typical behavior.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 5 51 · api (literature)
lemma IsCuttable.ne_zero (hT : IsCuttable n T) : n ≠ 0formal-conjectures/633.lean ↗
status
solved