benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / How many ways are there to color every integer either red or blue such that…

Problem

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

problem

How many ways are there to color every integer either red or blue such that nn and n+7n+7 are the same color for all integers nn, and there does not exist an integer kk such that k,k+1k, k+1, and 2k2k are all the same color?
Plain-text mathematical notation (without MathML)
How many ways are there to color every integer either red or blue such that n and n+7 are the same color for all integers n, and there does not exist an integer k such that k,k+1, and 2k are all the same color?
Original LaTeX notation
How many ways are there to color every integer either red or blue such that \(n\) and \(n+7\) are the same color for all integers \(n\), and there does not exist an integer \(k\) such that \(k, k+1\), and \(2k\) 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
98ce9cc8-410d-584a-8e68-daf6e3f7df8a
task_key
test--98ce9cc8-410d-584a-8e68-daf6e3f7df8a
task_revision_id
1
config / split
/ test

Official source

initial import