Another exercise to represent fractions in binary is to take the decimal and multiply by two in a column.

• .625 * 2 = 1.25 

• .25  * 2 = 0.5 

• .5   * 2 = 1.0 

Now taking the whole number and going from bottom to top you get 101, the binary representation, exactly.

If you take .1 you get

• .1 * 2 = 0.2
• .2 * 2 = 0.4
• .4 * 2 = 0.8
• .8 * 2 = 1.6
• .6 * 2 = 1.2
• .2 * 2 = 0.4

And from that point you get a repeating sequence in binary similar to .333..3 in decimal

And the takeaway is instead of testing for equality in floating point you test against an Epsilon (small quantity) and if the two numbers are within that Epsilon close to each other, they are for all intents are purposes, equal. Not doing so introduces bugs.