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
-
16993 Solvers
-
Given two arrays, find the maximum overlap
1493 Solvers
-
127 Solvers
-
Get the length of a given vector
10821 Solvers
-
Free Fall analytical solution (Chapra 2012 textbook Example 1.1)
24 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!