benchmarks.wiki / Public workspace

Omni-MATH / Determine all pairs (n,k) of distinct positive integers such that there exists a positive integer s for which the number of divisors of sn and of sk are equal.

Problem

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

problem

Determine all pairs (n,k)(n, k) of distinct positive integers such that there exists a positive integer ss for which the number of divisors of snsn and of sksk are equal.
Plain-text mathematical notation (without MathML)
Determine all pairs (n,k) of distinct positive integers such that there exists a positive integer s for which the number of divisors of sn and of sk are equal.
Original LaTeX notation
Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

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