benchmarks.wiki / Public workspace

Omni-MATH / A subset S of the nonnegative integers is called supported if it contains 0, and k+8,k+9∈S for all k∈S. How many supported sets are there?

Problem

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

problem

A subset SS of the nonnegative integers is called supported if it contains 0, and k+8,k+9∈Sk+8, k+9 \in S for all k∈Sk \in S. How many supported sets are there?
Plain-text mathematical notation (without MathML)
A subset S of the nonnegative integers is called supported if it contains 0, and k+8,k+9∈S for all k∈S. How many supported sets are there?
Original LaTeX notation
A subset $S$ of the nonnegative integers is called supported if it contains 0, and $k+8, k+9 \in S$ for all $k \in S$. How many supported sets 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