A character in an alphabet is represented in 12 bits. How many characters are there in the alphabet which do not have any sequence of 3 adjacent 1s?
#63386. Asked by ajay_daiict. (Mar 12 06 1:19 AM)
From 000000000000 to 111111111111 (inclusive) is a list of 4096 binary numbers. A quick program to generate that list and remove instances of 3 adjacent 1s results in a list of 1705 entries. The few and last few:
"Ask FunTrivia" is for entertainment purposes only, and answers offered are unverified and unchecked by
FunTrivia. We cannot guarantee the accuracy or veracity of ANY statement posted. Feel free to post an updated
if you feel that an answer is inadequate or incorrect. Please
thoroughly research items where accuracy is important to you using multiple reliable sources. By accessing our
website, you agree to be bound by our terms of service.