A mathematical proof demonstrating that every positive integer can be expressed as a subsequence sum of powers of given integers. The solution constructs a sequence by sorting powers of multiple bases with multiplicity, then proves completeness by showing that the sum of the first n terms always exceeds or equals the (n+1)th term minus one.
Sort: