Problem 57298. Easy Sequences 82: Digits of Powers of 2

• Created by Ramon Villamangca
• Appears in Chess

×

Like (0)

Difficulty:

(5)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

75.0% Correct | 25.0% Incorrect

• 4 Solutions
• 3 Solvers

Last Solution submitted on Dec 27, 2022

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers3

Suggested Problems

• Project Euler: Problem 7, Nth prime

  1569 Solvers

• Back to basics 9 - Indexed References

  447 Solvers

• Sort numbers by outside digits

  151 Solvers

• Accumulate Cells

  44 Solvers

• Fibonacci-Sum of Squares

  1492 Solvers

More from this Author116

• Easy Sequences 27: Product of Radicals of Integers

  7 Solvers

• Easy Sequences 68: Factorial Rectangles

  6 Solvers

• Easy Sequences 117: Fractional Part of Cube Roots

  4 Solvers

• Easy Sequences 1: Find the index of an element

  46 Solvers

• Easy Sequences 101: One-line Code Challenge - n-th Digit of Fibonacci Sequence

  0 Solvers