Erdős problem 979Let k≥2k ≥ 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?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 9794 retained source recordsCanvaspublic previewSource#979→ResultNone→Checks0