Tag Archives: binary

Efficiency of repeated squaring: another proof

In my previous post I proved that the “binary algorithm” (corresponding to the binary expansion of a number ) is the most efficient way to build using only doubling and incrementing steps. Today I want to explain another nice proof, … Continue reading

Posted in computation, proof | Tagged , , , , , , , , | 3 Comments

Efficiency of repeated squaring: proof

My last post proposed a claim: The binary algorithm is the most efficient way to build using only doubling and incrementing steps. That is, any other way to build by doubling and incrementing uses an equal or greater number of … Continue reading

Posted in computation, proof | Tagged , , , , , , , , | 2 Comments

Efficiency of repeated squaring

As you probably realized if you read both, my recent post without words connects directly to my previous post on exponentiation by repeated squaring Each section shows the sequence of operations used by the repeated squaring algorithm to build up … Continue reading

Posted in computation | Tagged , , , , , , , | 7 Comments

The chocolate bar game: losing positions proved

In my last post I claimed that the losing positions for the chocolate bar game are precisely those of the form (or the reverse), that is, in binary, positions where one coordinate is the same as the other with any … Continue reading

Posted in games, pattern, pictures, proof, solutions | Tagged , , , , , , , , | 4 Comments

The chocolate bar game: losing positions characterized

The evident pattern from my last post is that losing positions in the chocolate bar game appear to be characterized by those where the binary expansion of is the same as the binary expansion of with any number (including zero) … Continue reading

Posted in challenges, games, pattern, pictures | Tagged , , , , , , , , | 1 Comment

The chocolate bar game: losing positions in binary

Recall the chocolate bar game from my last post, whose winning and losing positions can be visualized like this: Here’s a list of some losing positions on or above the main diagonal (dark blue squares in the above picture), ordered … Continue reading

Posted in challenges, games, pattern, pictures | Tagged , , , , , , , , | 1 Comment

P vs NP: What’s the problem?

As promised (better late than never), I’m going to begin explaining the (in)famous P vs NP question (see the previous post for a bit more context). As a start, here’s a super-concise, 30,000-foot version of the question: Are there problems … Continue reading

Posted in computation, open problems | Tagged , , , , | 9 Comments