MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayGiven 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.

27 correct solutions
57 incorrect solutions

Last solution submitted on Jun 11, 2014

1 player likes this problem

2 Comments