benchmarks.wiki / Public workspace

Omni-MATH / A k×k array contains each of the numbers 1,2,…,m exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest po…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

A k×kk \times k array contains each of the numbers 1,2,…,m1, 2, \dots, m exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest possible value of mm if k=3nk = 3^n (n∈N+n \in \mathbb{N}^+)?
Plain-text mathematical notation (without MathML)
A k×k array contains each of the numbers 1,2,…,m exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest possible value of m if k=3^(n) (n∈N^(+))?
Original LaTeX notation
A $k \times k$ array contains each of the numbers $1, 2, \dots, m$ exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest possible value of $m$ if $k = 3^n$ ($n \in \mathbb{N}^+$)?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import