01010111 01100101 01101100 01100011 01101111 01101101 01100101 00100000 01110100 01101111 00100000 01110100 01101000 01101001 01110011 00100000 01110111 01100101 01100101 01101011 00100111 01110011 00100000 01001101 01100001 01110100 01101000 00100000 01001101 01110101 01101110 01100011 01101000 00100001
Or, if you don’t speak binary, welcome to this week’s Math Munch!
Looking at that really, really long string of 0s and 1s, you might think that binary is a really inefficient way to encode letters, numbers, and symbols. I mean, the single line of text, “Welcome to this week’s Math Munch!” turns into six lines of digits that make you dizzy to look at. But, suppose you were a computer. You wouldn’t be able to talk, listen, or write. But you would be made up of lots of little electric signals that can be either on or off. To communicate, you’d want to use the power of being able to turn signals on and off. So, the best way to communicate would be to use a code that associated patterns of on and off signals with important pieces of information– like letters, numbers, and other symbols.
That’s how binary works to encode information. Computer scientists have developed a code called ASCII, which stands for American Standard Code for Information Interchange, that matches important symbols and typing communication commands (like tab and backspace) with numbers.
To use in computing, those numbers are converted into binary. How do you do that? Well, as you probably already know, the numbers we regularly use are written using place-value in base 10. That means that each digit in a number has a different value based on its spot in the number, and the places get 10 times larger as you move to the left in the number. In binary, however, the places have different values. Instead of growing 10 times larger, each place in a binary number is twice as large as the one to its right. The only digits you can use in binary are 0 and 1– which correspond to turning a signal on or leaving it off.
But if you want to write in binary, you don’t have to do all the conversions yourself. Just use this handy translator, and you’ll be writing in binary 01101001 01101110 00100000 01101110 01101111 00100000 01110100 01101001 01101101 01100101 00101110
Next up, check out this video about a classic number problem: the Infinite Hotel Paradox. If you find infinity baffling, as many mathematicians do, this video may help you understand it a little better. (Or add to the bafflingness– which is just how infinity works, I guess.)
I especially like how despite how many more people get rooms at the hotel (so long as the number of people is countable!), the hotel manager doesn’t make more money…
Speaking of videos, how about a math video contest? MATHCOUNTS is hosting a video contest for 6th-8th grade students. To participate, teams of four students and their teacher coach choose a problem from the MATHCOUNTS School Handbook and write a screenplay based on that problem. Then, make a video and post it to the contest website. The winning video is selected by a combination of students and adult judges– and each member of the winning team receives a college scholarship!
Here’s last year’s first place video.
01000010 01101111 01101110 00100000 01100001 01110000 01110000 01100101 01110100 01101001 01110100 00100001 (That means, Bon appetit!)