Waring's Problem
n = a1**k + a2**k + a3**k + … + ag(k)**k
possible for all n =>
g(k) = (3/2)**k + 2**k - 2
Proof:
From Euler's Powers Theorem,
g(k) = (3**k - 2**k)/2**k + (2**k - 1**k)/1**k