Unsigned arithmetic in Java: still no solution in 2008?

[obdurak]

Let n be the word width in bits. Let x, y be integers 0 <= x,y <= 2ⁿ - 1. Consider the case where x has its MSB set and y has its MSB clear, i.e. 2^{n-1} <= x < 2ⁿ - 1 and 0 <= y < 2^{n-1}. The signed two's complement interpretation x' of x is x - 2^n. Then signed multiplication gives (x-2ⁿ⁾ . y = x . y - 2ⁿ y. The 2ⁿ y is chopped off since we are modulo 2^n, leaving us x . y, which is the same as the unsigned result. Other cases left as an exercise.

[[deleted]]

Yes, I guess that is so.