benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / Let f(n) be the sum of the positive integer divisors of n. If n is prime and f(f(n)) is also prime, then call n a bouncy prime. What is the smallest bouncy prime?

Problem

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

problem

Let f(n)f(n) be the sum of the positive integer divisors of nn. If nn is prime and f(f(n))f(f(n)) is also prime, then call nn a bouncy prime. What is the smallest bouncy prime?
Plain-text mathematical notation (without MathML)
Let f(n) be the sum of the positive integer divisors of n. If n is prime and f(f(n)) is also prime, then call n a bouncy prime. What is the smallest bouncy prime?
Original LaTeX notation
Let $f(n)$ be the sum of the positive integer divisors of $n$. If $n$ is prime and $f(f(n))$ is also prime, then call $n$ a bouncy prime. What is the smallest bouncy prime?

level

Level 4

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

task_id
fd1e7a02-9406-5f44-8694-464d7e9b79dd
task_key
number~5ftheory--test--fd1e7a02-9406-5f44-8694-464d7e9b79dd
task_revision_id
1
config / split
number_theory / test

Official source

initial import