benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let n be a positive integer, and let s be the sum of the digits of the base-four representation of 2^(n)−1. If s=2023 (in base ten), compute n (in base ten).

Problem

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

problem

Let nn be a positive integer, and let ss be the sum of the digits of the base-four representation of 2n−12^{n}-1. If s=2023s=2023 (in base ten), compute nn (in base ten).
Plain-text mathematical notation (without MathML)
Let n be a positive integer, and let s be the sum of the digits of the base-four representation of 2^(n)−1. If s=2023 (in base ten), compute n (in base ten).
Original LaTeX notation
Let $n$ be a positive integer, and let $s$ be the sum of the digits of the base-four representation of $2^{n}-1$. If $s=2023$ (in base ten), compute $n$ (in base ten).

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
b4a1ac7a-f19e-5912-b624-510c76ba3d93
task_key
test--b4a1ac7a-f19e-5912-b624-510c76ba3d93
task_revision_id
1
config / split
/ test

Official source

initial import