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.
Solve

Solution Stats

146 Solutions

40 Solvers

Last Solution submitted on Jun 01, 2024

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers40

George Berken minnolina Dyuman Joshi Christian Schröder

Suggested Problems

Community Treasure Hunt

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

Start Hunting!