ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tmt_m denote the total number of rectangulations of a square with mm tiles, and write nn for a positive integer. Parity conjecture.

tn≡1 ⁣ ⁣mod  2t_n\equiv 1\!\!\mod 2

if n=8k+1n=8k+1 or n=8k+4n=8k+4; otherwise,

tn≡0 ⁣ ⁣mod  2.t_n\equiv 0\!\!\mod 2.

This conjecture is motivated by the computed sequence of total rectangulation counts and was stated as unproved in the source, which gives partial results concerning symmetry.

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.