Need help with binary

kaku1

Beta member
Messages
2
Location
Estonia
Hi!

So I was solving different types of riddles and puzzles and this came up. 111101 110101 11010 11001 10011 100111001 .
Add "zeros" to left as you need.
Nothing more. I tried normal binary translators, but they don't work. I know that the answer has to be numbers. Can someone help me? I'd be very thankful.
Sorry if I put this in the wrong place.
 
Last edited:
Is it supposed to be 1 long string, or are each separated part you have supposed to be separated like that?

Is it 1 number or multiple numbers?
 
Yes, it needs to be separated like that. First part- 2 numbers
second part- two numbers
third part- three numbers
fourth part- two or three numbers
fifth part- two numbers
sixth part- three numbers
 
Last edited:
Yes, it needs to be separated like that. First part- 2 numbers
second part- two numbers
third part- three numbers
fourth part- two or three numbers
fifth part- two numbers
sixth part- three numbers

Where are you getting those figures from? I'm assuming you're counting the # of concurrent 1's in each set? That's not how binary works. If each set is -supposed- to be a separate number... then just take each set and convert to decimal (either by hand or with a calculator).

111101 = 2^0 + 2^2 + 2^3 + 2^4 + 2^5 = 61
110101 = 2^0 + 2^2 + 2^4 + 2^5 = 53
... etc. Should be able to figure the rest out on your own.

Otherwise, if they're -not- supposed to be separate as I shown above, then pad each set with 0's on the left so they are in 8bit counts.
E.g. the first one:
111101 would be 00111101

Then run the entire string into a bin->dec calculator
 
Last edited:
Back
Top Bottom