Posted November 27, 2012
![avatar](/www/default/-img/newuser_big.png)
The Wolfram clue is the first step. It tells you that that particular code is a programming code for (bitshift the number 11 leftward by one)++. The problem is that Wolfram does not understand what ++ means and thus ignores it. Try putting (11<<1) on Wolfram and compare it with (11<<1)++. You will find that Wolfram erroneously give the same answer for both. The bitshifting left by 1 is basically "multiple the number by 2". So you get 22, and that's what Wolfram tells you. However, the ++ part adds 1 to that, so the answer is actually 23. I figured this out by googling what bitshift meant, then doing the math manually myself, and discovering that well, Wolfram was incomplete.
Oh well. Thanks for the explanation. And thanks for the giveaway, Ipopman.