← All papers
First page of Tiling a triangle into a prime number of congruent triangles

Tiling a triangle into a prime number of congruent triangles

Michael Beeson, Grigore Roşu

math.MG Jul 26, 2026 · v4 math.NT
All proofs on prime triangle tilings are formalized in Lean 4 with Mathlib, largely using Claude, with code released on GitHub.
We prove that if a triangle is cut into $N$ congruent triangles and $N$ is prime, then $N=2$, $N=3$, or $N\equiv 1 \pmod 4$, and every such $N$ occurs. In particular, if $N > 3$ then $N$ is not a prime congruent to $3$ modulo $4$. All the proofs in this paper have been formalized in Lean. The argument divides into cases according to possible shapes of the tiled triangle. Let $α,β,γ$ be the angles of the tile. Prior to this posting, there remained several open shapes. The two most difficult shapes were $(2α,β,α+β)$, the {\em triquadratic} shape, and $(β,β,3α)$, the {\em isosceles-$β$} shape, in which $3α+2β= π$ and $α$ is not a rational multiple of $π$. A previous version of this paper relied on incorrect proofs of those cases, which have been retracted, and are replaced here by correct proofs. For each of those two shapes the number of tiles has the form $N = j^2 N_0$, where $N_0 > 1$ is determined by the shape of the tile and $j$ is a positive integer; so $N$ is prime, or even squarefree, only if $j = 1$. We prove by geometric reasoning that neither shape admits a tiling with $j = 1$, which shows that for both shapes $N$ is never prime, and indeed never squarefree. The shape $(β,β,3α+β)$ (where $3α+ 3β= π$) has been settled by Bonfioli. In this paper, we settle the remaining cases, by number-theoretic arguments based on the area equation. Those proofs rule out $N$ prime, but not $N$ squarefree, and we give examples to show that tilings with squarefree $N$ do sometimes exist.

The goal is to characterize the primes N for which a triangle can be cut into N congruent triangles (the prime case of Erdős problem 634). Several tiling shapes remained open, and earlier claimed proofs for two of them were incorrect.

The argument splits into cases by the shape of the tiled triangle. For incommensurable shapes with a 2π/3 tile angle, the law of sines and coprimality lemmas show the side lengths are an integer multiple of a primitive triple. The area equation then gives an explicit formula for N. The triquadratic and isosceles-β shapes are handled by geometric reasoning ruling out j=1 in N=j^2 N_0. The entire paper is formalized in Lean 4 (v4.30.0) with Mathlib, using only standard axioms and no sorry or native_decide.

If N is prime and a triangle is N-tiled by congruent triangles, then N=2, N=3, or N≡1 mod 4, and every such N occurs. For the triquadratic and isosceles-β shapes, N is never squarefree. All results have kernel-checked Lean counterparts.