ART
BEAUTY & WELLNESS
CRAFT
CULTURE & HISTORY
ENTERTAINMENT
ENVIRONMENT
FOOD & DRINKS
REVERSE ENGINEERING
SCIENCES
SPORTS
TECHNOLOGY
WEARABLES
Binary Arithmetic
Ed

Ṣẹ́dá nipasẹ̀

Ed

20. Oṣù Kẹjọ 2026FI
0
0
0
0
0

Binary Arithmetic

Counting with two symbols instead of ten. Every place is worth twice the one to its right — 1, 2, 4, 8, 16 — and a number is written as the sum of the powers of two you switch on. Addition needs one rule about carrying and nothing else; there is no multiplication table to learn because there is nothing to learn beyond zero times anything and one times anything. Leibniz published the system in 1703 and saw immediately that it was more than a curiosity, though the machines that would need it were two centuries away. What makes it the foundation of computing is not elegance but physics: a switch is either on or off, and a system with exactly two states can be built out of anything that has two states reliably.
Olùbẹ̀rẹ̀
1 hour

Ìlànà

1

Build a physical binary counter

Make the places real objects you can flip.

  1. Lay out cards for 1, 2, 4, 8, 16, 32 — face up is on, face down is off.
  2. Count from 0 to 20 by flipping cards.
  3. Watch what happens each time a place fills.
Every place is worth twice its neighbour, so turning a place ON is always cheaper than turning on everything below it. You are seeing why binary needs no digits above 1: two of anything simply becomes one of the next thing up.

Materials for this step:

Cardstock Assorted Pack (50 Sheets)Cardstock Assorted Pack (50 Sheets)1 àkópọ̀
2

Convert both ways

Two procedures, and one of them you have already met.

  1. Decimal to binary: repeatedly halve, discarding remainders, and record odd (1) or even (0). Read from the bottom up.
  2. Binary to decimal: add the place values where there is a 1.
  3. Convert a dozen numbers each way and check against each other.
That halving procedure is exactly the left column of Russian peasant multiplication. Same operation, different name — which is the point at which binary stops feeling like a new subject.

Materials for this step:

Graph PaperGraph Paper1 pad
3

Add, and find the carry

Four rules, and that is the whole of binary addition.

  1. 0+0=0 · 0+1=1 · 1+0=1 · 1+1=0 carry 1.
  2. Add 1011 and 0110 column by column.
  3. Check your answer in decimal: 11 + 6 = 17.
Note that the carry can cascade: 1111 + 1 propagates all the way along. That cascade is a real cost in hardware — the time an adder takes is dominated by how far a carry has to ripple, which is why processors use carry-lookahead circuits rather than the naive method.
4

Multiply by shifting

Show that multiplication needs no new machinery.

  1. Take a binary number and add a zero on the right.
  2. Convert before and after.
  3. Repeat — each added zero doubles the value.
Shifting left multiplies by two, shifting right divides by two. Combine shifting with adding and you can multiply any two numbers — which is precisely the algorithm from the Russian peasant blueprint, and precisely what a hardware multiplier does. Three blueprints, one algorithm, three different clothes.
5

History and context

Gottfried Wilhelm Leibniz published his account of binary in 1703, and was struck by finding the same two-state structure in the hexagrams of the Chinese I Ching, which a Jesuit correspondent had sent him. He attached theological significance to a system that creates everything from one and nothing — a reading that is his own and not part of the mathematics.

Earlier and elsewhere: binary and near-binary systems appear independently in the I Ching itself, in Indian prosody — Pingala described binary patterns of long and short syllables around the third century BC — and in African divination systems. Two-state encoding is something people keep arriving at.

The reason it won is engineering, not mathematics. A decimal computer needs a component that reliably distinguishes ten voltage levels; a binary one needs a component that distinguishes on from off, which almost any switch, relay, valve or transistor does robustly and cheaply. Claude Shannon's 1937 master's thesis made the connection explicit by showing that relay circuits implement Boolean algebra — arguably the most consequential master's thesis ever written.

Decimal computers did exist — ENIAC was one, and IBM built decimal machines for business — so the outcome was not inevitable. Binary won on component cost and reliability, and the survival of binary-coded decimal in financial software is a reminder that the argument was once genuinely open.

Àwọn ohun-èlò

2

Blueprint tó jọra

Àwọn blueprint wọ̀nyí pín ìmọ̀ — ọ̀nà, ohun-èlò tàbí ìlànà

CC0 Àgbègbè Gbogbogbò

Blueprint yìí ti jáde lábẹ́ CC0. O lè ṣe àdàkọ, yí padà, pín, àti lò láìsí ìyọ̀ǹda.

Ṣàtìlẹ́yìn Olùṣẹ́dá nípa rírà àwọn ọjà nipasẹ̀ Blueprint wọn Ẹ̀san Olùṣẹ́dá tí àwọn Olùtajà gbé kalẹ̀, tàbí ṣẹ̀dá àtúnṣe tuntun ti Blueprint yìí kí o sì fi sínú Blueprint rẹ gẹ́gẹ́ bí ìsopọ̀ láti pín owó-wíwọlé.

Ìfọ̀rọ̀wérọ̀

(0)

Wọlé láti dara pọ̀ mọ́ ìfọ̀rọ̀wérọ̀

Loading comments...