Want this question answered?
Be notified when an answer is posted
-- The decimal system (base-10) uses 10 digits to write all numbers. -- The binary system (base-2) uses 2 digits to write all numbers.
This is my own way of finding a binary of a number. We all know that binary is in base 2 (it only have 2 values - 0 and 1). Here is how I do it:Steps:1) Divide the number by 2. If there is a remainder, then write the number 1 as the first binary number otherwise write 0.Ex:7/2 = 3.5 ---> Since there's a remainder write 1.8/2 = 4 ---> If there's no remainder write 0.2) Repeat the first step using the value that was derived on the first one. Continue doing so until the number is not less than 1Ex:3/2 = 1.5 ---> Our binary now is 11.4/2 = 2 ---> Our binary here is 00.Repeat:1/2 = 0.5 ---> Since the number is less than zero, just write the final result. Our binary now is 111.2/2 = 1 ---> Again here we write 000.1/2 = 0.5 ---> Now we write it as 0001.3) After getting the final value, reverse your answer and it will now be the binary form.Answer:710 = 1112810 = 10002Note: Please edit my answer if you are a bit confuse with the steps.
Two, 11 in binary, II in roman numerals
1000100 this can be done as 68/2===remainder=0 34/2===========0 17/2===========1 8/2============0 4/2============0 2/2============0 1 is remainder so write from downwards it gives 1000100 which is binary eqivalent of 68
101011In other words . . .2^0 + 2^1 + 2^3 + 2^5
When you write the decimal number '7' in Base-2 (binary), you write '0111'.
2 --------- 10
Binary 1001111 is 79 in decimal.
'2' Decimal code => '10' Binary code.
First let's write it as a sum of powers of two. This will make it easier to write as a binary number. 19=16+2+1 This can be written: 19=16*1+8*0+4*0+2*1+1*1 So the binary form is: 10011
-- The decimal system (base-10) uses 10 digits to write all numbers. -- The binary system (base-2) uses 2 digits to write all numbers.
This is my own way of finding a binary of a number. We all know that binary is in base 2 (it only have 2 values - 0 and 1). Here is how I do it:Steps:1) Divide the number by 2. If there is a remainder, then write the number 1 as the first binary number otherwise write 0.Ex:7/2 = 3.5 ---> Since there's a remainder write 1.8/2 = 4 ---> If there's no remainder write 0.2) Repeat the first step using the value that was derived on the first one. Continue doing so until the number is not less than 1Ex:3/2 = 1.5 ---> Our binary now is 11.4/2 = 2 ---> Our binary here is 00.Repeat:1/2 = 0.5 ---> Since the number is less than zero, just write the final result. Our binary now is 111.2/2 = 1 ---> Again here we write 000.1/2 = 0.5 ---> Now we write it as 0001.3) After getting the final value, reverse your answer and it will now be the binary form.Answer:710 = 1112810 = 10002Note: Please edit my answer if you are a bit confuse with the steps.
All possible 2-bit numbers ... 0, 1, 2, and 3 ... are the same in BCD and binary. No conversion is required.
You write the number as a sum of decreasing powers of 2. Then for each power, you write 1 if it is present in the sum and 0 if not.So, 3 = 2 + 1 = 2^1 + 2^0and so the binary for 3 (in decimal) is 11.
Two, 11 in binary, II in roman numerals
1000100 this can be done as 68/2===remainder=0 34/2===========0 17/2===========1 8/2============0 4/2============0 2/2============0 1 is remainder so write from downwards it gives 1000100 which is binary eqivalent of 68
101011In other words . . .2^0 + 2^1 + 2^3 + 2^5