benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / In how many ways can you fill a 3×3 table with the numbers 1 through 9 (each used once) such that all pairs of adjacent numbers (sharing one side) are relatively prime?

Problem

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

problem

In how many ways can you fill a 3×33 \times 3 table with the numbers 1 through 9 (each used once) such that all pairs of adjacent numbers (sharing one side) are relatively prime?
Plain-text mathematical notation (without MathML)
In how many ways can you fill a 3×3 table with the numbers 1 through 9 (each used once) such that all pairs of adjacent numbers (sharing one side) are relatively prime?
Original LaTeX notation
In how many ways can you fill a $3 \times 3$ table with the numbers 1 through 9 (each used once) such that all pairs of adjacent numbers (sharing one side) are relatively prime?

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

task_id
eb555614-bffc-558e-b683-f3416b58dbb1
task_key
test--eb555614-bffc-558e-b683-f3416b58dbb1
task_revision_id
1
config / split
/ test

Official source

initial import