I'm trying to learn more about how computers store memory. So I've found information on how to represent binary numbers or hexadecimal numbers, but I found a question asking:
Given three n-bit unsigned ints: x, y, z, what is the min #
of bits required to represent x * y + z
The number of bits required is
n + n. Taking an example using 8 bits and maximum unsigned values:
255 * 255 + 255 = 65280
The result is less then
65536 which would require more than 16 bits.