Minimum number of bits to represent the result of an expression on variables of known size?
<p>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: </p>

<pre><code>Given three n-bit unsigned ints: x, y, z, what is the min # 
of bits required to represent x * y + z 
</code></pre>

<p>So my thinking is: Do I have to just account for all three ints separately and do the math for the smallest possible numbers so for example 0 * 0 + 0</p>

<p>Or do I have to account for another variable n that is the result of the problem? </p>

<p>I'm having some trouble thinking this out. </p>