benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A perfect power is an integer n that can be represented as a^(k) for some positive integers a≥1 and k≥2. Find the sum of all prime numbers 0<p<50 such that p is 1 less than a perfe…

Problem

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

problem

A perfect power is an integer nn that can be represented as aka^{k} for some positive integers a≥1a \geq 1 and k≥2k \geq 2. Find the sum of all prime numbers 0<p<500<p<50 such that pp is 1 less than a perfect power.
Plain-text mathematical notation (without MathML)
A perfect power is an integer n that can be represented as a^(k) for some positive integers a≥1 and k≥2. Find the sum of all prime numbers 0<p<50 such that p is 1 less than a perfect power.
Original LaTeX notation
A perfect power is an integer $n$ that can be represented as $a^{k}$ for some positive integers $a \geq 1$ and $k \geq 2$. Find the sum of all prime numbers $0<p<50$ such that $p$ is 1 less than a perfect power.

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
a5f4f5dd-1ef6-531d-92dd-f151f932c6aa
task_key
test--a5f4f5dd-1ef6-531d-92dd-f151f932c6aa
task_revision_id
1
config / split
/ test

Official source

initial import