If n is a binary fraction, then n = a / 2 k for the integers a and k.
This means that n = (a · 5 k ) / (2 k 5 k ) = (a · 5 k ) / 10 k
Thus, each binary fraction is a decimal fraction.
In the general case, each fraction to the base N is also a fraction for the base M if and only if N divides M k for some k (or, what is the same, if each prime factor N is also equal to the prime factor M). An argument similar to the one I gave above for 2 and 10 handles the if direction. For the “only if” direction, a preliminary proof is given here: suppose that 1 / N = a / M k then M k = a · N, therefore N divides M k .
Thus, the binary code can be converted to decimal without loss, because 2 is a factor of 10, but decimal cannot be converted to binary without losses, because 5 is a factor of 10, but not 2 times.
source share