benchmarks.wiki / Public workspace

Omni-MATH / Consider a 9×9 grid of squares. Haruki fills each square in this grid with an integer between 1 and 9 , inclusive. The grid is called a super-sudoku if each of the following three …

Problem

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

problem

Consider a 9×99 \times 9 grid of squares. Haruki fills each square in this grid with an integer between 1 and 9 , inclusive. The grid is called a super-sudoku if each of the following three conditions hold: - Each column in the grid contains each of the numbers 1,2,3,4,5,6,7,8,91,2,3,4,5,6,7,8,9 exactly once. - Each row in the grid contains each of the numbers 1,2,3,4,5,6,7,8,91,2,3,4,5,6,7,8,9 exactly once. - Each 3×33 \times 3 subsquare in the grid contains each of the numbers 1,2,3,4,5,6,7,8,91,2,3,4,5,6,7,8,9 exactly once. How many possible super-sudoku grids are there?
Plain-text mathematical notation (without MathML)
Consider a 9×9 grid of squares. Haruki fills each square in this grid with an integer between 1 and 9 , inclusive. The grid is called a super-sudoku if each of the following three conditions hold: - Each column in the grid contains each of the numbers 1,2,3,4,5,6,7,8,9 exactly once. - Each row in the grid contains each of the numbers 1,2,3,4,5,6,7,8,9 exactly once. - Each 3×3 subsquare in the grid contains each of the numbers 1,2,3,4,5,6,7,8,9 exactly once. How many possible super-sudoku grids are there?
Original LaTeX notation
Consider a $9 \times 9$ grid of squares. Haruki fills each square in this grid with an integer between 1 and 9 , inclusive. The grid is called a super-sudoku if each of the following three conditions hold: - Each column in the grid contains each of the numbers $1,2,3,4,5,6,7,8,9$ exactly once. - Each row in the grid contains each of the numbers $1,2,3,4,5,6,7,8,9$ exactly once. - Each $3 \times 3$ subsquare in the grid contains each of the numbers $1,2,3,4,5,6,7,8,9$ exactly once. How many possible super-sudoku grids are there?

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