benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Compute the number of sets S such that every element of S is a nonnegative integer less than 16, and if x∈S then (2 x bmod 16) in S.

Problem

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

problem

Compute the number of sets SS such that every element of SS is a nonnegative integer less than 16, and if x∈Sx \in S then $(2 x \bmod 16) \in S$.
Plain-text mathematical notation (without MathML)
Compute the number of sets S such that every element of S is a nonnegative integer less than 16, and if x∈S then $(2 x \bmod 16) \in S$.
Original LaTeX notation
Compute the number of sets $S$ such that every element of $S$ is a nonnegative integer less than 16, and if $x \in S$ then $(2 x \bmod 16) \in S$.

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
f89ff374-f724-54b8-b7d6-d831193755e6
task_key
test--f89ff374-f724-54b8-b7d6-d831193755e6
task_revision_id
1
config / split
/ test

Official source

initial import