benchmarks.wiki / Public workspace

Omni-MATH / Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent…

Problem

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

problem

Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent rectangles. Connect the midpoints of the lower right rectangle for a total of 7 rectangles. Repeat this process infinitely. Let nn be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing an edge have the same color and mm be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing a corner have the same color. Find the ordered pair (n,m)(n, m).
Plain-text mathematical notation (without MathML)
Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent rectangles. Connect the midpoints of the lower right rectangle for a total of 7 rectangles. Repeat this process infinitely. Let n be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing an edge have the same color and m be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing a corner have the same color. Find the ordered pair (n,m).
Original LaTeX notation
Draw a rectangle. Connect the midpoints of the opposite sides to get 4 congruent rectangles. Connect the midpoints of the lower right rectangle for a total of 7 rectangles. Repeat this process infinitely. Let $n$ be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing an edge have the same color and $m$ be the minimum number of colors we can assign to the rectangles so that no two rectangles sharing a corner have the same color. Find the ordered pair $(n, m)$.

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