← Complete problem index

PROJECT EULER · #0749

Near Power Sums

Statement only · SolvedOriginal problem ↗

A positive integer, n, is a near power sum if there exists a positive integer, k, such that the sum of the kth powers of the digits in its decimal representation is equal to either n+1 or n1. For example 35 is a near power sum number because 32+52=34.

Define S(d) to be the sum of all near power sum numbers of d digits or less. Then S(2)=110 and S(6)=2562701.

Find S(16).

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.