If you want to look at the binary representations of the numbers involved, try this site: <a href="http://babbage.cs.qc.cuny.edu/IEEE-754.old/Decimal" rel="nofollow">http://babbage.cs.qc.cuny.edu/IEEE-754.old/Decimal</a>... Here are the numbers from your example: # exponent mantissa 1.01: 01111111111 1.0000001010001111010111000010100011110101110000101001
6: 10000000001 1.1000000000000000000000000000000000000000000000000000
Results of multiplication:
6.059..: 10000000001 1.100000111101011100001010001111010111000010100011110 0
6.06: 10000000001 1.100000111101011100001010001111010111000010100011110 1
You can see that the number which results from the multiplication has lost the least significant bit of the mantissa when compared to the desired result. When the mantissae are multiplied, the result must then be shifted by one bit to bring a 1 back in the most significant bit. When this happens, a 0 is shifted on (I believe because the least significant bit at that time is a 0, so it is extended, but I don't remember precisely). When you add, it's much easier to explain. Add numbers:
0.06: 01111111010 1.111010111000010100011110101110000101000111101 0111000
6: 10000000001 1.100000 0000000000000000000000000000000000000000000000
Results
6.06: 10000000001 1.100000 1111010111000010100011110101110000101000111101 To add, the smaller number is shifted to the right by the difference in the exponents (7 in this case). I've underlined the parts of the added numbers that make up the result. The underlined part of the result is what was contributed by the right shifted 0.06. Hope that gives you deeper understanding. Let me know if you want to know more and I'll see what I can do. =D