This week's book giveaway is in the Design forum. We're giving away four copies of Building Microservices and have Sam Newman on-line! See this thread for details.

In binary, i = 0111 1111 1111 1111 1111 1111 1111 1111 (you can verify, this add up to 2147483647) j = i * 2 = 1111 1111 1111 1111 1111 1111 1111 1110 First bite is 1, so j is negative. | j | = 0000 0000 0000 0000 0000 0000 0000 0010 so j = -2

I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com

subject: int i =2147483647 //(Max_Value);int j=i*2; j=?