benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / In how many ways can the set of ordered pairs of integers be colored red and…

Problem

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

problem

In how many ways can the set of ordered pairs of integers be colored red and blue such that for all aa and bb, the points (a,b),(−1−b,a+1)(a, b),(-1-b, a+1), and (1−b,a−1)(1-b, a-1) are all the same color?
Plain-text mathematical notation (without MathML)
In how many ways can the set of ordered pairs of integers be colored red and blue such that for all a and b, the points (a,b),(−1−b,a+1), and (1−b,a−1) are all the same color?
Original LaTeX notation
In how many ways can the set of ordered pairs of integers be colored red and blue such that for all $a$ and $b$, the points $(a, b),(-1-b, a+1)$, and $(1-b, a-1)$ are all the same color?

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
31755395-ad11-5922-9f19-84f505d89f65
task_key
test--31755395-ad11-5922-9f19-84f505d89f65
task_revision_id
1
config / split
/ test

Official source

initial import