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:
, 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 
, 
.
since , therefore . If , please output , therefore for , .As an added challenge, some functions are disabled.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers5
Suggested Problems
-
Implement simple rotation cypher
1098 Solvers
-
Magic is simple (for beginners)
11669 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
303 Solvers
-
Create a v-notch vector without "sort" function
36 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!
