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
-
Find the longest sequence of 1's in a binary sequence.
6668 Solvers
-
Smallest distance between a point and a rectangle
275 Solvers
-
Join Strings with Multiple Different Delimiters
221 Solvers
-
Volume of a sphere given its surface area
153 Solvers
-
Create an index-powered vector
926 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!