Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 2). For non-overlapping equilateral triangles of side lengths packed inside an equilateral triangle of side , is the maximum of over all such packings. Comparing areas and Cauchy-Schwarz give , and tiling by congruent triangles gives for every positive integer . As in Theorem 1, .
Theorem 2 (p. 2, quoted). " for all if and only if converges."
Consequence (p. 3, unlabelled). If for infinitely many , then for every ; this follows from part 1 of Theorem 1.
Proof pointer
Pp. 2--3. The paper first argues that this obeys hypothesis (*) of Theorem 1. For it points to Fig. 1, an example captioned with side sum ; no other case is treated. For the subdivision inequality it follows Praton's argument for squares: cut the unit triangle into the triangular grid, replace an corner subgrid by an optimal packing of triangles scaled by , and count triangles of total side . The paper notes (p. 3) that the argument works for any shape tileable by a square number of congruent copies similar to it. Theorem 2 then follows from Theorem 1: the forward direction is trivial, and if some , part 2 gives , so the series diverges.
Read depth
Claims checked: the setting, Theorem 2, the argument for (*), the remark on p. 3 and the proof were read clause by clause on the page images of arXiv v1. Nothing here is independently reviewed.
Dependencies
Theorem 1. External input named by the paper: I. Praton, Packing squares in a square, Math. Mag. (2008), 358--361, for the subdivision argument.
Source. Anshul Raj Singh, On a square packing conjecture of Erdős, arXiv:2601.22163 (2026); the edition read is named on the source card.
Bears on
- Problem 106: Theorem 2 is the triangle analogue of the problem, which the paper raises on p. 2 as a question similar to Erdős's conjecture; it says nothing about squares by itself. The square case is the paper's Section 4, recorded on its own page.