Find all $n$ such that there is at least one triangle which can be cut into $n$ congruent triangles.

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

This is one of Erdős’ 25 problems (Soifer’s Problem 6.7), and a complete classification of **all** such integers $n$ is **still not known** as of the latest literature summaries (edited Dec 30, 2025). ([Erdős Problems][1])

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.