Problem 1226. Non-zero bits in 10^n.

  • Created by SK
Given an integer that is a power of 10, find the number of non-zero bits, k, in its binary representation.
For example:
  • n = 1, 10^n = 1010, so k = 2.
  • n = 5, 10^n = 11000011010100000, so k = 6.
The solution should work for arbitrarily large powers n, say at least till n = 100.

Solution Stats

34.27% Correct | 65.73% Incorrect
Last Solution submitted on Feb 21, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers38

Suggested Problems

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!