Given an integer that is a power of 10, find the number of non-zero bits, k, in its binary representation.
For example:
The solution should work for arbitrarily large powers n, say at least till n = 100.
I can't get the last three cases to work out. I've checked the answers a couple of different ways. I still get 26 1s in the binary for 10^100. Is there a defect in the solutions offered?
The test cases are correct. In case you are using dec2bin, it is subject to loss of significance.
Replace NaNs with the number that appears to its left in the row.
1585 Solvers
333 Solvers
Back to basics 4 - Search Path
274 Solvers
Back to basics 6 - Column Vector
762 Solvers
54 Solvers