benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For a positive integer n, let, τ(n) be the number of positive integer divisors of n. How many integers 1≤n≤50 are there such that τ(τ(n)) is odd?

Problem

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

problem

For a positive integer nn, let, τ(n)\tau(n) be the number of positive integer divisors of nn. How many integers 1≤n≤501 \leq n \leq 50 are there such that τ(τ(n))\tau(\tau(n)) is odd?
Plain-text mathematical notation (without MathML)
For a positive integer n, let, τ(n) be the number of positive integer divisors of n. How many integers 1≤n≤50 are there such that τ(τ(n)) is odd?
Original LaTeX notation
For a positive integer $n$, let, $\tau(n)$ be the number of positive integer divisors of $n$. How many integers $1 \leq n \leq 50$ are there such that $\tau(\tau(n))$ is odd?

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
21c07192-0574-5a1c-a0ba-ca794c5fda3d
task_key
test--21c07192-0574-5a1c-a0ba-ca794c5fda3d
task_revision_id
1
config / split
/ test

Official source

initial import