Wiki
Wiki

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 nn non-overlapping equilateral triangles of side lengths a1,…,ana_1,\ldots,a_n packed inside an equilateral triangle of side 11, f(n)f(n) is the maximum of a1+⋯+ana_1+\cdots+a_n over all such packings. Comparing areas and Cauchy-Schwarz give f(n)≤nf(n)\le\sqrt n, and tiling by k2k^2 congruent triangles gives f(k2)=kf(k^2)=k for every positive integer kk. As in Theorem 1, ϵ(k)=f(k2+1)−k\epsilon(k)=f(k^2+1)-k.

Theorem 2 (p. 2, quoted). "f(k2+1)=kf(k^2+1)=k for all kk if and only if ∑k⩾1ϵ(k)\sum_{k\geqslant1}\epsilon(k) converges."

Consequence (p. 3, unlabelled). If f(k2+1)=kf(k^2+1)=k for infinitely many kk, then f(k2+1)=kf(k^2+1)=k for every kk; this follows from part 1 of Theorem 1.

Proof pointer

Pp. 2--3. The paper first argues that this ff obeys hypothesis (*) of Theorem 1. For f(k2+1)≥kf(k^2+1)\ge k it points to Fig. 1, an example captioned n=2n=2 with side sum 22; no other case is treated. For the subdivision inequality it follows Praton's argument for squares: cut the unit triangle into the b×bb\times b triangular grid, replace an a×aa\times a corner subgrid by an optimal packing of nn triangles scaled by a/ba/b, and count b2−a2+nb^2-a^2+n triangles of total side (b2−a2)/b+af(n)/b≤f(b2−a2+n)(b^2-a^2)/b+a f(n)/b\le f(b^2-a^2+n). 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 ϵ(n)>0\epsilon(n)>0, part 2 gives ϵ(k)=Ω(1/k)\epsilon(k)=\Omega(1/k), 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.