Skip to content

Erdős problem 979

Let k2k ≥ 2, and let fk(n)f_k(n) count the number of solutions to n=p1k++pkkn = p_1^k + \dots + p_k^k, where the pip_i are prime numbers. Is it true that lim supfk(n)=\limsup f_k(n) = \infty?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#979
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page