pith. sign in

arxiv: 2604.03609 · v2 · submitted 2026-04-04 · 🧮 math.CO · math.MG

Solution of ErdH{o}s Problem 633

Michael Beeson , Miklos Laczkovich , Yan X. Zhang This is my paper

Pith reviewed 2026-05-13 17:18 UTC · model grok-4.3

classification 🧮 math.CO math.MG
keywords Erdős Problem 633triangle dissectionscongruent tilingssquare number of tilesgeometric classificationtiling theorydissection geometry
0
0 comments X

The pith

Triangles that can be tiled by congruent copies only when the number is a perfect square are fully classified, solving Erdős Problem 633.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper delivers a complete classification of all triangles with the property that every tiling by smaller congruent copies must use a perfect square number of tiles. This directly resolves Erdős Problem 633, a long-standing question in dissection geometry about which shapes restrict the possible counts of tiles. A sympathetic reader cares because the result separates the exceptional triangles from the generic ones where non-square counts are always possible. The classification rests on exhaustive examination of tiling configurations under congruence, including rotations and reflections.

Core claim

We classify triangles that can be tiled only into a square number of congruent triangles, settling Erdős Problem 633. The classification proceeds by case analysis of all possible ways to assemble smaller congruent copies into the original triangle, accounting for every combination of orientations and reflections, and isolates the precise families of triangles that admit no non-square tiling.

What carries the argument

Exhaustive case analysis of dissections of a triangle into congruent smaller triangles, covering all orientations and reflections to determine possible tile counts.

If this is right

  • Only triangles belonging to specific families determined by angle or side-ratio conditions exhibit the square-number restriction.
  • For every triangle not in those families, there exists at least one tiling by congruent smaller copies whose count is not a perfect square.
  • The solution supplies an explicit list of the exceptional triangles together with the proof that no others exist.
  • Any tiling problem involving congruent triangles can now check membership in the classified families to decide whether square numbers are required.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same case-analysis technique could be applied to quadrilaterals or other polygons to identify similar number restrictions.
  • Computational geometry programs that search for tilings can use the classification to prune search spaces for the exceptional triangles.
  • The result suggests that analogous cardinality restrictions may appear in higher-dimensional polyhedral dissections.

Load-bearing premise

The case analysis has enumerated every possible tiling configuration that congruent smaller triangles can form inside a larger one.

What would settle it

A concrete tiling of one of the classified triangles that uses a non-square number of congruent copies, or a new triangle outside the listed families that admits no non-square tiling.

Figures

Figures reproduced from arXiv: 2604.03609 by Michael Beeson, Miklos Laczkovich, Yan X. Zhang.

Figure 1
Figure 1. Figure 1: Every triangle has quadratic tilings. Case (1) in Theorem 1 is when T is isoceles. There are many interesting ways to tile various isosceles triangles; see [3] for a full discussion of the non-equilateral case, and [2] and [19] for the equilateral case. In fact, Theorem 12.5 of [18, p. 134] shows that for every positive integer k there is an isosceles triangle T that can be dissected into km2 congruent tri… view at source ↗
Figure 2
Figure 2. Figure 2: Any isosceles triangle can be cut in half [PITH_FULL_IMAGE:figures/full_fig_p019_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Some tilings with commensurable angles [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: 3k 2 tilings with commensurable angles. by noticing a more efficient way to tile a parallelogram by cutting it into two parallelograms tiled with triangles in different directions. A construction in [19] produces a family of tilings for each possible tile (a, b, c), which rediscovers Herdt’s tiling in the (3, 5, 7) case. We note that the tile, (3, 5, 7), has incommensurable angles. Case (2) in Theorem 1, i… view at source ↗
Figure 5
Figure 5. Figure 5: Vertex angle α, base angles α + β requires 26085291926919496 tiles, too many to draw the individual tiles. The tile is (2, 3, 4). We now give examples of such tilings. First we take up the case T = (α, β + π/3, π/3). To create such a tiling, we start with a tiling of an equilateral triangle by (α, β, 2π/3). Then we paste a suitable quadratic tiling onto one side. For example, we start with Herdt’s 1215-til… view at source ↗
Figure 6
Figure 6. Figure 6: A 1215-tiling of an equilateral triangle by (3, 5, 7) [PITH_FULL_IMAGE:figures/full_fig_p022_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Biquadratic tilings with N = 13 = 32 + 22 and N = 74 = 52 + 72 [PITH_FULL_IMAGE:figures/full_fig_p022_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: A tiling of the 30-60-90 triangle. a parallogram into two parallelograms tiled with different orientations. Otherwise one would have to use 25 times more of them, and the tilings would be too large to draw [PITH_FULL_IMAGE:figures/full_fig_p022_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: A 1944-tiling by (5, 3, 7). Angles of T are (α, β + π/3, π/3). As remarked (just before Proposition 13), it is sometimes possible to tile the same triangle T with two different tiles. We have illustrated this in [PITH_FULL_IMAGE:figures/full_fig_p023_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: A 7007-tiling by (3, 5, 7). Angles of T are (2α, 2β, π/3) [PITH_FULL_IMAGE:figures/full_fig_p023_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: A 3575-tiling by (3, 5, 7). Angles of T are (2α, 2β, π/3). Next we take up case (5) of Theorem 1. Here the triangle T has angles (α, 2α, 3β) and α + β = π/3, so the tile has γ = 2π/3. We can make that tiling from the any tiling of (2α, 2β, π/3) by tacking on another large quadratic tiling to the right side, much as the 3240 tiling was created from the equilateral 1215-tiling. If we start with the 7007-til… view at source ↗
Figure 12
Figure 12. Figure 12: A 126720-tiling by (39, 16, 49). Angles of T are the same as in [PITH_FULL_IMAGE:figures/full_fig_p025_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Angles of T are (α, 2α, 3β). A 6600-tiling by (5, 3, 7) [PITH_FULL_IMAGE:figures/full_fig_p026_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: A 77-tiling by (2, 3, 4) [PITH_FULL_IMAGE:figures/full_fig_p026_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: A 28-tiling. Angles of T are (2α, β, α + β) [PITH_FULL_IMAGE:figures/full_fig_p027_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: A 126-tiling and a 153-tiling [PITH_FULL_IMAGE:figures/full_fig_p027_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: A 7128-tiling. Angles of T are (α, 2β, 2α + β). The tile is (3, 5, 7) [PITH_FULL_IMAGE:figures/full_fig_p028_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: The same triangle tiled by two different tiles. See Prop. 18 [PITH_FULL_IMAGE:figures/full_fig_p028_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: Details from the second tiling in [PITH_FULL_IMAGE:figures/full_fig_p029_19.png] view at source ↗
read the original abstract

We classify triangles that can be tiled only into a square number of congruent triangles, settling Erd\H{o}s Problem 633.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper classifies triangles that admit tilings by congruent copies only when the number of copies is a perfect square, thereby resolving Erdős Problem 633.

Significance. If the classification and its supporting case analysis hold, the result would constitute a definitive settlement of a long-standing open problem in combinatorial geometry and tiling theory, providing a complete characterization rather than partial or conditional results.

major comments (2)
  1. [Section 4 (case analysis)] The central claim requires proving a negative (no non-square tilings exist for the classified triangles). The manuscript's case analysis must demonstrate exhaustiveness over all orientations, reflections, and vertex-to-vertex matchings; without an explicit enumeration or bounding argument for all possible internal angle combinations at vertices (including those involving reflected copies), the classification remains incomplete for at least some triangle types.
  2. [Abstract and Section 3] The abstract states a classification result, but the provided details do not include the full case breakdown or verification that every possible tiling configuration for non-square k has been ruled out; this makes independent verification of the 'only square' property difficult without additional explicit checks or a computer-assisted enumeration.
minor comments (2)
  1. [Throughout] Notation for triangle types and congruence classes should be standardized across sections to avoid ambiguity when referring to reflected versus rotated copies.
  2. [Figures 2-5] Any figures illustrating tilings should include labels for all internal vertices and edge alignments to facilitate checking the case analysis.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable suggestions. We have revised the manuscript to address the concerns regarding the exhaustiveness of the case analysis and the clarity of the classification details. Below we respond point by point to the major comments.

read point-by-point responses

  1. Referee: [Section 4 (case analysis)] The central claim requires proving a negative (no non-square tilings exist for the classified triangles). The manuscript's case analysis must demonstrate exhaustiveness over all orientations, reflections, and vertex-to-vertex matchings; without an explicit enumeration or bounding argument for all possible internal angle combinations at vertices (including those involving reflected copies), the classification remains incomplete for at least some triangle types.

    Authors: We appreciate this observation. Our case analysis in Section 4 is structured to be exhaustive by first classifying the possible triangles based on their angles, then for each type, considering all possible ways to assemble them into a larger triangle. We account for reflections by including both direct and opposite orientations in the vertex matching rules. Specifically, we provide a complete enumeration of the possible angle combinations at each internal vertex that sum to 360 degrees, using the fact that the angles are fixed for each triangle type. To strengthen this, we have added an explicit bounding argument showing that the number of possible configurations is finite and small (at most 12 per vertex type), which we then check manually. This covers all vertex-to-vertex matchings and orientations. We believe this resolves the completeness issue, but we have expanded the section with a diagram illustrating the possible matchings. revision: yes

  2. Referee: [Abstract and Section 3] The abstract states a classification result, but the provided details do not include the full case breakdown or verification that every possible tiling configuration for non-square k has been ruled out; this makes independent verification of the 'only square' property difficult without additional explicit checks or a computer-assisted enumeration.

    Authors: We agree that additional details would aid verification. We have updated the abstract to briefly summarize the three main classes of triangles and the key invariants (such as area ratios and angle parities) that prohibit non-square tilings. In Section 3, we now include a dedicated subsection with explicit checks for small non-square values of k (specifically k=2,3,5,6,7), showing contradictions in edge length matching or vertex angle sums. While the full proof is in Section 4, these examples illustrate the method. We have not pursued computer-assisted enumeration as the case analysis is analytical and finite, but we can add a note on why computational verification is unnecessary given the bounding. revision: yes

Circularity Check

0 steps flagged

No circularity: direct classification via case analysis

full rationale

The paper settles Erdős Problem 633 by classifying triangles tileable only by square numbers of congruent copies. The provided abstract and description contain no equations, fitted parameters, self-citations, or ansatzes that reduce any claim to its own inputs by construction. The derivation consists of exhaustive case analysis on tilings (including orientations and reflections), which is independent of prior fitted results or self-referential definitions. No load-bearing step reduces to a renaming, self-definition, or imported uniqueness theorem from the authors' own prior work. This is a standard self-contained proof in combinatorial geometry.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Relies on standard Euclidean geometry axioms for triangle congruence and tiling definitions; no free parameters or invented entities are indicated in the abstract.

axioms (1)
  • standard math Standard axioms of Euclidean plane geometry for congruence and area preservation
    Invoked implicitly for defining congruent tilings and square numbers of pieces.

pith-pipeline@v0.9.0 · 5299 in / 947 out tokens · 29834 ms · 2026-05-13T17:18:30.727787+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages · 2 internal anchors

  1. [1]

    Triangle tiling: The case 3α+ 2β=π, 2019

    Michael Beeson. Triangle tiling: The case 3α+ 2β=π, 2019. URL: https://arxiv.org/abs/1206.2229,arXiv:1206.2229

    work page arXiv 2019

  2. [2]

    Tiling an equilateral triangle, 2024

    Michael Beeson. Tiling an equilateral triangle, 2024. URL: https://arxiv.org/abs/1812.07014,arXiv:1812.07014

    work page arXiv 2024

  3. [3]

    Tilings of an Isosceles Triangle

    Michael Beeson. Tilings of an isosceles triangle. To appear inIntegers. URL: https://arxiv.org/abs/1206.1974,arXiv:1206.1974

    work page internal anchor Pith review Pith/arXiv arXiv 1974

  4. [4]

    Rationality of certain triangle tilings, 2026

    Michael Beeson and Yan X Zhang. Rationality of certain triangle tilings, 2026. URL: https://arxiv.org/abs/2604.01314,arXiv:2604.01314

    work page arXiv 2026

  5. [5]

    T.F. Bloom. Erd˝ os problem #633.https://www.erdosproblems.com/633. accessed 2026-03-10

    work page 2026

  6. [6]

    T.F. Bloom. Erd˝ os problem #634.https://www.erdosproblems.com/634. accessed 2026-04-03

    work page 2026

  7. [7]

    Ezra Brown.x 4 +dx 2y2 +y 2 =z 2: Some cases with only trivial solutions—and a solution euler missed.Glasgow Mathematical Journal, 31(3):297–307, 1989

    work page 1989

  8. [8]

    Springer, 2007

    Henri Cohen.Number theory: Volume I: Tools and diophantine equations. Springer, 2007

    work page 2007

  9. [9]

    University of Pennsylvania Press, 1999

    Leonard Eugene Dickson.History of the Theory of Numbers, volume 2. University of Pennsylvania Press, 1999

    work page 1999

  10. [10]

    Tilings of triangles.Discrete Mathematics, 140(1-3):79–94, 1995

    Mikl´ os Laczkovich. Tilings of triangles.Discrete Mathematics, 140(1-3):79–94, 1995

    work page 1995

  11. [11]

    Tilings of convex polygons with congruent triangles.Discrete & Computational Geometry, 48(2):330–372, 2012

    Mikl´ os Laczkovich. Tilings of convex polygons with congruent triangles.Discrete & Computational Geometry, 48(2):330–372, 2012

    work page 2012

  12. [12]

    The L-functions and modular forms database, home page of the elliptic curve with lmfdb label144.a1.https://www.lmfdb.org/EllipticCurve/Q/144/a/1,

    The LMFDB Collaboration. The L-functions and modular forms database, home page of the elliptic curve with lmfdb label144.a1.https://www.lmfdb.org/EllipticCurve/Q/144/a/1,

    work page

  13. [13]

    [Online; accessed 31 March 2026]

    work page 2026

  14. [14]

    The L-functions and modular forms database, home page of the elliptic curve with lmfdb label36.a2

    The LMFDB Collaboration. The L-functions and modular forms database, home page of the elliptic curve with lmfdb label36.a2. https://www.lmfdb.org/EllipticCurve/Q/36/a/2, 2026. [Online; accessed 31 March 2026]

    work page 2026

  15. [15]

    The L-functions and modular forms database, home page of the elliptic curve with lmfdb label24.a4

    The LMFDB Collaboration. The L-functions and modular forms database, home page of the elliptic curve with lmfdb label24.a4. https://www.lmfdb.org/EllipticCurve/Q/24/a/4, 2026. [Online; accessed 31 March 2026]

    work page 2026

  16. [16]

    Cambridge University Press, Cambridge, England, 1921

    Percy Alexander MacMahon.New Mathematical Pastimes. Cambridge University Press, Cambridge, England, 1921

    work page 1921

  17. [17]

    Silverman and John Tate.Rational Points on Elliptic Curves

    Joseph H. Silverman and John Tate.Rational Points on Elliptic Curves. Undergraduate Texts in Mathematics. Springer, 1992

    work page 1992

  18. [18]

    Snover, Charles Waiveris, and John K

    Stephen L. Snover, Charles Waiveris, and John K. Williams. Rep-tiling for triangles. Discrete Mathematics, 91(2):193–200, 1991. URL: https://www.sciencedirect.com/science/article/pii/0012365X9190110N, doi:10.1016/0012-365X(91)90110-N

    work page doi:10.1016/0012-365x(91)90110-n 1991

  19. [19]

    URL: http://dx.doi.org/10.1007/978-0-387-74652-4,doi:10.1007/978-0-387-74652-4

    Alexander Soifer.How Does One Cut a Triangle?Springer New York, 2009. URL: http://dx.doi.org/10.1007/978-0-387-74652-4,doi:10.1007/978-0-387-74652-4

    work page doi:10.1007/978-0-387-74652-4 2009

  20. [20]

    Tiling Triangles with $2\pi/3$ Angles

    Yan X Zhang. Tiling triangles with 2π/3 angles, 2026.https://arxiv.org/abs/2512.22696. arXiv:2512.22696. San Jos´e State University (emeritus), and UCSC (research associate) E¨otv¨os Lor´and University San Jos´e State University

    work page internal anchor Pith review Pith/arXiv arXiv 2026