benchmarks.wiki / Public workspace

MATH / Let n be a natural number with exactly 2 positive prime divisors. If n² has 27 divisors, how many does n have?

Problem

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

problem

Let nn be a natural number with exactly 2 positive prime divisors. If n2n^2 has 27 divisors, how many does nn have?
Plain-text mathematical notation (without MathML)
Let n be a natural number with exactly 2 positive prime divisors.  If n² has 27 divisors, how many does n have?
Original LaTeX notation
Let $n$ be a natural number with exactly 2 positive prime divisors.  If $n^2$ has 27 divisors, how many does $n$ have?

level

Level 5

type

Number Theory

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

Official source

initial import