benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Call a positive integer 'mild' if its base-3 representation never contains the…

Problem

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

problem

Call a positive integer 'mild' if its base-3 representation never contains the digit 2. How many values of n(1≤n≤1000)n(1 \leq n \leq 1000) have the property that nn and n2n^{2} are both mild?
Plain-text mathematical notation (without MathML)
Call a positive integer 'mild' if its base-3 representation never contains the digit 2. How many values of n(1≤n≤1000) have the property that n and n² are both mild?
Original LaTeX notation
Call a positive integer 'mild' if its base-3 representation never contains the digit 2. How many values of $n(1 \leq n \leq 1000)$ have the property that $n$ and $n^{2}$ are both mild?

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
31f5ff99-227d-5bcb-a98b-9a0176f1b338
task_key
test--31f5ff99-227d-5bcb-a98b-9a0176f1b338
task_revision_id
1
config / split
/ test

Official source

initial import