Let x>0. Consider a computer using a PBFP representation with n bits of precision in the significand. Assume that rounding is used in going from a number x outside the computer to its floating point approximation fl(x) inside the computer.

Show that -2^(e-n) <= x - fl(x) <= 2^(e-n)

Show that x>=2 and use this to show |x-fl(x)| / x <= 2^(-n)


Any advice? I havn't a clue. Thank you