On the Largest Integer that is not a Sum of Distinct Positive $n$th Powers

TL;DR

This paper establishes explicit bounds for the largest integer that cannot be expressed as a sum of distinct positive n-th powers, extending understanding of additive number theory for powers.

Contribution

It provides a new explicit bound for the largest non-representable integer as a sum of distinct n-th powers, improving previous theoretical results.

Findings

Derived explicit bounds for non-representable integers

Extended classical results to higher powers

Provided formulas involving factorials and powers of two

Abstract

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every integer \(m\geq (b-1)2^{n-1}(r+\frac{2}{3}(b-1)(2^{2n}-1)+2(b-2))^n-2a+ab\), where \(a=n!2^{n^2}\), \(b=2^{n^3}a^{n-1}\), \(r=2^{n^2-n}a\), is a sum of distinct \(n\)th powers of positive integers.