Problem 44337. Sums of Distinct Powers
You will be given three numbers: base, nstart, and nend. Write a MATLAB script that will compute the sum of a sequence of both the distinct powers of base as well as sums of distinct powers of base. Your sequence should start with the 'nstart'th term and end with the 'nend'th term. For example:
 base=4
 nstart=2
 nend=6
The first several sums of the distinct powers of 4 are:
 1 (4^0)
 4 (4^1)
 5 (4^1 + 4^0)
 16 (4^2)
 17 (4^2 + 4^0)
 20 (4^2 + 4^1)
 21 (4^2 + 4^1 + 4^0)
 64 (4^3)
 65 (4^3 + 4^0)
Since nstart=2 and nend=6 in this example, you take the second through the sixth terms of this sequence. The correct output would be 4+5+16+17+20, or 62. Notice that the number 8 does not occur in this pattern. While 8 is a multiple of 4, 8=4^1+4^1. Because there are two 4^1 terms in the sum, 8 does not qualify as a sum of distinct powers of 4. You can assume that all three will be integers, base>1, and that nstart<nend. Good luck!
Solution Stats
Problem Comments

6 Comments
I'm having some trouble understanding the problem. Could you provide an example for test 7?
base=7;nstart=1;nend=10;y_correct=1265;
My understanding of the problem leads me to believe the answer should be 1600: 1 + 7 + 8 + 49 + 50 + 56 + 343 + 344 + 350 + 392
You've almost got it, bmtran. You are missing 7^2 + 7^1 + 7^0 = 57 in your example. Put that in, remove the 392 (since that's term #11 in the sequence) and you have the correct answer.
Thanks, that makes sense. I was under the impression that it could only be the sum of 2 distinct powers based on the example.
I've changed the description to make it a bit clearer that you can use any number of terms in the sequence. Hope this helps.
The problem wants all unique combinations of distinct powers of a given base up to a point. If we forget some factors it will overflow, if we repeat sequences, their sum will not match the test cases.
that means
0
1
2
3
1 0
2 0
2 1
3 0
3 1
3 2
2 1 0
3 1 0
3 2 0
3 2 1
and so on (and resulting numbers must be sorted if we are not following their natural order)
It is not clear at all, James, that we must sum all possible unique combinations of exponents for a base. However, it is a good problem.
Solution Comments
Show commentsProblem Recent Solvers153
Suggested Problems

Remove all the words that end with "ain"
2289 Solvers

Find perfect placement of nonrotating dominoes (easier)
350 Solvers

Create an nbyn null matrix and fill with ones certain positions
599 Solvers

1116 Solvers

86 Solvers
More from this Author80
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!