ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A triangle tiling is the edge-to-edge tiling of the plane by congruent copies of a triangle. The period of a periodic trajectory is the number of iterations, or equivalently the number of repeated trajectory steps, in its minimal return.

4n+24n+2 conjecture. Every periodic trajectory on a triangle tiling has period 4n+24n+2 for some positive integer nn.

The source says that Hubert and Paris-Romaskevich subsequently proved this conjecture. It is therefore solved.

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.