Coba jelasin {| class="wikitable" dari Sistem angka perduaan dalam bahasa melayu dong

|align="right"|0 ||× 2 +|| 1 || = 1

|align="right"|1 ||× 2 +|| 0 || = 2

|align="right"|2 ||× 2 +|| 0 || = 4

|align="right"|4 ||× 2 +|| 1 || = 9

|align="right"|9 ||× 2 +|| 0 || = 18

|align="right"|18 ||× 2 +|| 1 || = 37

|align="right"|37 ||× 2 +|| 0 || = 74

|align="right"|74 ||× 2 +|| 1 || = 149

|align="right"|149 ||× 2 +|| 1 || = 299

|align="right"|299 ||× 2 +|| 0 || = 598

|align="right"|598 ||× 2 +|| 1 || = 1197

Hasil adalah 119710. Note that the first Prior Value of 0 is simply an initial decimal value. This method is an application of the skema Horner.

The fractional parts of a nombor are converted with similar methods. They are again based on the equivalence of shifting with doubling or halving.

In a fractional binary nombor such as .110101101012, the first digit is , the second , etc. So if there is a 1 in the first place after the decimal, then the nombor is at least , dan vice versa. Double that nombor is at least 1. This suggests the algorithm: Repeatedly double the nombor to be converted, record if the hasil is at least 1, dan then throw away the integer part.

Contohnya, 10, dalam angka perduaan, adalah: