# Tag Archives: discrete mathematics

## 42 Finally Solved!

Musicians practice; actors rehearse; athletes work out; and mathematicians play with numbers. Some of the games they play may seem as silly or pointless as musicians playing scales, but there is a point to it all. That old saying defining insanity as doing the same thing over and over and expecting different results was never really correct (or intended to be used as it often is).

An old joke is more on point: “How do you get to Carnegie Hall?” (Asked the first-time visitors to New York.) — “Practice, practice, practice!” (Replied the street musician they asked.) The point of mathematical play can be sheer exercise for the mind, sometimes can uncover unexpected insights, and once in a while can be sheer fun.

As when finally solving a 65-year-old puzzle involving the number 42!

## Sideband #58: Halt! (or not)

evaluate(2B || !2B)

Hamlet’s famous question, “To be or not to be?” is just one example of a question with a yes/no answer. It’s different from a question such as, “What’s your favorite color?” or, “How was your day?” What it boils down to is that the young Prince’s question requires only one bit to answer, and that bit is either yea or nay.

Computers can be very good at answering yes/no questions. We can write a computer program to compare two numbers and tell us — yea or nay — if the first one is bigger than the second one. Computers are also very good at calculations (they’re just big calculators, after all). For example, we can write a computer program that divides one number by another.

But there are questions computers can’t answer, and calculations they can’t make.

## Beautiful Math

Take a moment to gaze at Euler’s Identity:

It has been called “exquisite” and likened to a “Shakespearean sonnet.” It has earned the titles “the most famous” and “the most beautiful” formula in all of mathematics, and, in a mere seven symbols, symbolizes much of its foundation.

Today we’re going to graze on it!