Given an integer that is a power of 10, find the number of non-zero bits, k, in its binary representation.
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.
random picture with random colours
Find the sum of the elements in the "second" diagonal
Add more zeros
Determine if input is a perfect number
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office