From Finger Counting to One‑Bit Adders: A Story of Learning Binary and Logic Gates

During a math class, second‑grader Xiao Ming struggles with the addition problem 6324 + 244675 and recalls a finger‑counting trick that can represent numbers from 0 to 31 using five fingers, effectively introducing binary representation.

Classmate Xiao Hong draws a table on the back of a math book, labeling the five‑finger states as binary inputs and discussing how to represent addition results and carries, leading to the concept of a one‑bit adder with inputs A, B and carry‑in (C‑in) and outputs Sum and carry‑out (C‑out).

Physical teaching aids—AND, OR, and NOT gates—are introduced by Xiao Lan, who demonstrates their truth tables with switches and a lamp, explaining how logical operations can be combined to implement the sum and carry functions of a binary adder.

The students sketch circuit diagrams, first connecting AND gates for the carry, then OR gates for the sum, and eventually assemble a complete one‑bit full‑adder. By cascading 32 of these units, they construct a 32‑bit adder capable of computing the original large addition.

The narrative culminates with the teacher posing further arithmetic, algorithmic, and mathematical questions, prompting the students to consider how to extend their hardware approach to subtraction, multiplication, division, Fibonacci numbers, and even deeper problems, highlighting the foundational role of binary logic in computing.