Problem 57298. Easy Sequences 82: Digits of Powers of 2
In Project Euler Problem #16, we are asked for sum of the digits of powers of 2. Here we will be asked for more than that.
Given an integer power n, create a function the outputs 
, where:
- a is the first 5 digits of 
,
 - b is the last 5 digits of 
,
 - c is the number of digits of 
, and
 - d is the sum of the digits of 
.
 
For example, for 
 since 
, therefore 
. If 
, please output 
, therefore for 
, 
.
As an added challenge, some functions are disabled.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
- 
         
Make the vector [1 2 3 4 5 6 7 8 9 10]
51894 Solvers
 - 
         
Return the 3n+1 sequence for n
8403 Solvers
 - 
         
         
2414 Solvers
 - 
         
         
440 Solvers
 - 
         
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
138 Solvers
 
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!