benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For a positive integer n, let p(n) denote the product of the positive integer factors of n. Determine the number of factors n of 2310 for which p(n) is a perfect square.

Problem

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

problem

For a positive integer nn, let p(n)p(n) denote the product of the positive integer factors of nn. Determine the number of factors nn of 2310 for which p(n)p(n) is a perfect square.
Plain-text mathematical notation (without MathML)
For a positive integer n, let p(n) denote the product of the positive integer factors of n. Determine the number of factors n of 2310 for which p(n) is a perfect square.
Original LaTeX notation
For a positive integer $n$, let $p(n)$ denote the product of the positive integer factors of $n$. Determine the number of factors $n$ of 2310 for which $p(n)$ is a perfect square.

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
ce043976-eae3-576d-8be3-3d15f6ef2c9e
task_key
test--ce043976-eae3-576d-8be3-3d15f6ef2c9e
task_revision_id
1
config / split
/ test

Official source

initial import