benchmarks.wiki / Public workspace

Omni-MATH / A positive integer will be called "sparkly" if its smallest (positive) divisor,…

Problem

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

problem

A positive integer will be called "sparkly" if its smallest (positive) divisor, other than 1, equals the total number of divisors (including 1). How many of the numbers 2,3,…,20032,3, \ldots, 2003 are sparkly?
Plain-text mathematical notation (without MathML)
A positive integer will be called "sparkly" if its smallest (positive) divisor, other than 1, equals the total number of divisors (including 1). How many of the numbers 2,3,…,2003 are sparkly?
Original LaTeX notation
A positive integer will be called "sparkly" if its smallest (positive) divisor, other than 1, equals the total number of divisors (including 1). How many of the numbers $2,3, \ldots, 2003$ are sparkly?

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