Problem 44337. Sums of Distinct Powers
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 Solvers149
Suggested Problems
-
Back to basics 8 - Matrix Diagonals
890 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
507 Solvers
-
1056 Solvers
-
Return fibonacci sequence do not use loop and condition
439 Solvers
-
3778 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!