I read that overflow is more frequent when we work with normalised mantissas. Why is this?  Is it because when we adopt a normalised representation, our range is smaller than in a unnormalised representation?Source: I read this in: Hwang, K. Computer arithmetic. John Wiley & sons, 1979. Chapter 10 Advanced topics on floating-point arithmetic (page 323)It says this: The operands are not required to be normalized, overflow may be expected to occur less frequently in unnormalized arithmetic.
Why is there more frequent overflow in normalised Floating Point
arithmetic;floating point;normal forms;number formats;real numbers