Problem

Source: Canada RepĂȘchage 2023/2 CMOQR

Tags: combinatorics



How many ways are there to fill a $3 \times 3$ grid with the numbers $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, and $9$, such that the set of three elements in every row and every column form an arithmetic progression in some order? (Each number must be used exactly once)