ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (a,b,c)(a,b,c) be the side lengths of the triangular tile, with angles determined by a,b,ca,b,c, and let TT be a triangle with angles (2α,2β,α+β)(2\alpha,2\beta,\alpha+\beta). Tile-count divisibility conjecture. If TT can be tiled by copies of (a,b,c)(a,b,c), then the number of tiles has the form

(a+2b)(b+2a)m2(a+2b)(b+2a)m^2

for some integer mm. Any counterexample must satisfy a≡b(mod3)a\equiv b\pmod 3.

The preceding lemma proves this form under the hypothesis a≢b(mod3)a\not\equiv b\pmod 3. The construction in the paper supplies infinitely many tile counts of the displayed form, while the exceptional congruence class remains the possible source of counterexamples.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.