![]() |
|
|
COE Home > Education Resources > ELEMENTARY MATH CLUB > COUNTING MACHINE |
|
|
Overview | The Math | The Lesson
The Secret CodesThe secret codes of the lesson are closely related to the binary
expansion of numbers.
Find this interesting? Read more about binary expansions. Here we use a simplified notation — we also refer to binary expansions by the more friendly term "secret codes". Each number from 0 to 31 has a secret code consisting of some of (or all of) these numbers: 16, 8, 4, 2, 1. For example, the binary expansion of 5 is 4 + 1, but the secret code for 5 is the sequence 4, 1; the secret code for 11 is 8, 2, 1; and 8 has a secret code of just 8. The Human Counting machine provides one way to find the secret code/binary
expansion of a number.
The Human Counting MachineThe machine consists of five children labeled 1, 2, 4, 8, and 16 (as shown below).
The machine works according to these rules:
The machine's output: To find the secret code/binary expansion of a number, say 21, the operator taps 21 times on the shoulder of machine component number 1, allowing time after each tap for the machine to implement all necessary changes. The final position for 21 is:
Read off the secret code of 21 (16, 4, 1 — the labels of the raised arms) and its binary expansion (16 + 4 + 1 ). Have a look at these other outputs of the Human Counting Machine.
How to recognize a number if you know its secret code?Just add the numbers forming the secret code to retrieve the original
number.
Or: if the secret code is 16, 2, 1 then the original number had to be 19, since Comments
Send questions, comments to asofer@math.utexas.edu. |
|||||||||||||||||||||||||||||||||
COE HOME | COE FACULTY DIRECTORY | UT DIRECTORY | COE MAPS | UT DIRECT COPYRIGHT ©2005. ALL RIGHTS RESERVED. | PRIVACY POLICY | ACCESSIBILITY | CONTACT WEBMASTER |