ศิลปะ
ความงามและสุขภาพ
งานฝีมือ
วัฒนธรรมและประวัติศาสตร์
ความบันเทิง
สิ่งแวดล้อม
อาหารและเครื่องดื่ม
วิศวกรรมย้อนรอย
วิทยาศาสตร์
กีฬา
เทคโนโลยี
อุปกรณ์สวมใส่
Binary Arithmetic
Ed

สร้างโดย

Ed

20. สิงหาคม 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.
เริ่มต้น
1 hour

คำแนะนำ

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.

วัสดุสำหรับขั้นตอนนี้:

Cardstock Assorted Pack (50 Sheets)Cardstock Assorted Pack (50 Sheets)1 แพ็ค
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.

วัสดุสำหรับขั้นตอนนี้:

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.

วัสดุ

2

บลูพริ้นท์ที่เกี่ยวข้อง

บลูพริ้นท์เหล่านี้แบ่งปันความรู้ — เทคนิค วัสดุ หรือหลักการ

CC0 สาธารณสมบัติ

พิมพ์เขียวนี้เผยแพร่ภายใต้ CC0 คุณสามารถคัดลอก แก้ไข แจกจ่าย และใช้งานผลงานนี้เพื่อวัตถุประสงค์ใดก็ได้ โดยไม่ต้องขออนุญาต

สนับสนุนเมกเกอร์โดยซื้อสินค้าผ่านพิมพ์เขียวของพวกเขา ซึ่งพวกเขาจะได้รับ ค่าคอมมิชชันเมกเกอร์ ที่ผู้ขายกำหนด หรือสร้างเวอร์ชันใหม่ของพิมพ์เขียวนี้และรวมเป็นการเชื่อมต่อในพิมพ์เขียวของคุณเพื่อแบ่งรายได้

การสนทนา

(0)

เข้าสู่ระบบ เพื่อร่วมการสนทนา

กำลังโหลดความคิดเห็น...