Kastalia Knowledge Management System · Glasperlenspiel template · knot 4389

Exercise · Paper Circuit

🌐 public · created AE561117 (17.11.2026) · by daniel-hromada · open in the standard editor view · 📽 open as presentation

In pairs. Four numbers: 0101, 0111, 1011, 1111. Increment each using only the two formulas — no counting.

Split the labour like a circuit: one of you computes every XOR, the other every AND and keeps the carry. Fill in a table with columns b, c, out, c′ for each position, right to left.

Check against finger counting. Which number made the carry travel farthest? What is c after the last position of 1111?

Ancestors (1 superordinated path)