Every number system ever devised by humans shares one fundamental characteristic: it operates within a defined set of symbols, and the position of each symbol within a number determines its magnitude. Our everyday number system the decimal system uses ten symbols (0 through 9) and assigns increasing powers of ten to each position from right to left. The binary number system follows the same positional logic, but uses only two symbols: 0 and 1.

The word 'binary' comes from the Latin binarius, meaning 'consisting of two.' In the Indonesian language, the KBBI (Kamus Besar Bahasa Indonesia) defines binary as characterized by two things or parts, and in mathematics, as a system based on the number two. This definition captures the essential nature of binary perfectly: it is a base-2 number system in which every number is expressed using only the digits zero and one.

At first glance, a number system with only two symbols seems impossibly limiting. How could you represent large numbers? How could you encode the rich diversity of human language, music, images, and video? The answer lies in combination and scale. Just as two simple states heads and tails, yes and no, on and off can encode an infinite variety of messages through sequence and combination, binary's two digits can represent any number, any character, any color, any sound, when arranged in sequences of sufficient length. The power of binary lies not in the richness of its alphabet, but in the mathematical properties that make it ideally suited to the physical reality of electronic circuits.

BINARY AT A GLANCE: KEY DEFINITIONS
Binary	A base-2 number system using only the digits 0 and 1
Bit	A single binary digit — the smallest unit of digital information (either 0 or 1)
Byte	8 bits grouped together — the standard unit for encoding a single character or small number
Base-2	Each positional place represents a power of 2: 1, 2, 4, 8, 16, 32, 64, 128...
LSB	Least Significant Bit — the rightmost bit, representing the smallest value (2⁰ = 1)
MSB	Most Significant Bit — the leftmost bit, representing the largest value in an n-bit number
ASCII	American Standard Code for Information Interchange — assigns binary codes to characters
Digital Signal	A signal that uses binary values (0 and 1) to represent information electronically

Binary vs. Decimal: Two Ways of Counting

To understand binary deeply, it helps to first understand why our familiar decimal system works the way it does. In the decimal system, we use ten distinct digits (0–9). When counting beyond 9, we do not invent a new symbol — instead, we write a 1 in the next position to the left and reset the current position to 0. This is the essence of positional notation: each position represents a power of the base (ten, in decimal), and the digit in that position tells us how many times to count that power.

For example, the decimal number 345 means: 3 × 10² + 4 × 10¹ + 5 × 10⁰ = 300 + 40 + 5 = 345. The positional value of each digit is determined by its distance from the right: the rightmost digit represents 10⁰ (ones), the next represents 10¹ (tens), then 10² (hundreds), and so on.

Binary follows the exact same logic, but with a base of 2 instead of 10. Each position represents a power of 2 (1, 2, 4, 8, 16, 32...), and the digit in that position can only be 0 (meaning 'this power does not contribute') or 1 (meaning 'this power contributes its full value'). The decimal number 345 in binary is 101011001 — which means: 1×256 + 0×128 + 1×64 + 0×32 + 1×16 + 1×8 + 0×4 + 0×2 + 1×1 = 345.

💡 Key Insight: Binary Is Just a Different Way of Writing the Same Numbers Binary numbers are not a different kind of mathematics — they are the same numbers expressed in a different notation. The quantity represented by decimal '10' and binary '1010' are identical; they are just written in different number bases. Just as the English word 'cat' and the Spanish word 'gato' refer to the same animal, 1010₂ and 10₁₀ refer to the same quantity. The number itself is universal; only its representation differs.

A Short History — How Binary Was Invented

Gottfried Wilhelm Leibniz: The Father of Binary

The binary number system as we use it today was formalized by Gottfried Wilhelm Leibniz, a German mathematician and philosopher of extraordinary breadth. Born in Leipzig in 1646 and educated in Leipzig, Jena, and Altdorf, Leibniz went on to become one of the towering intellectual figures of the 17th and 18th centuries — a man whose contributions spanned mathematics, physics, philosophy, history, diplomacy, and theology.

In mathematics alone, Leibniz's contributions are staggering: he independently developed calculus (simultaneously with Isaac Newton, in one of history's most celebrated intellectual disputes), invented the first mechanical calculator capable of multiplication and division, developed the foundations of formal logic, and — most relevant to our discussion — articulated and published the modern binary number system in his 1703 paper 'Explication de l'Arithmétique Binaire' (Explanation of Binary Arithmetic).

Leibniz was fascinated by the binary system for both mathematical and philosophical reasons. Mathematically, he recognized that a number system with only two digits simplified arithmetic operations in ways that had profound theoretical implications. Philosophically, he saw the binary system as an expression of a deeper metaphysical truth — in his interpretation, 1 represented God and 0 represented nothingness, and the ability to create all numbers from just these two symbols expressed the idea that all of creation could emerge from the divine (1) and the void (0). While this philosophical interpretation has not aged particularly well, the mathematical insight was transformative.

GOTTFRIED WILHELM LEIBNIZ: A PROFILE
Born	1 July 1646, Leipzig, Saxony (now Germany)
Died	14 November 1716, Hanover, Germany
Nationality	German, of Sorbian descent
Fields	Mathematics, Philosophy, Physics, History, Diplomacy, Theology
Key Works	Calculus (independent of Newton), mechanical calculator, binary arithmetic, formal logic
Binary Paper	'Explication de l'Arithmetique Binaire' — published 1703 in Memoires de l'Academie Royale des Sciences
Other Titles	Philosopher, mathematician, diplomat, physicist, historian, Doctor of Theology
Legacy	One of the most influential philosophers of the 17th-18th centuries; binary became the foundation of digital computing

Earlier Traces of Binary Thinking

While Leibniz is rightfully credited with the formal articulation of binary arithmetic, the concept of representing information through two states has appeared in various cultures throughout history. The ancient Chinese I Ching (Book of Changes), dating back over 3,000 years, uses a system of broken and unbroken lines — a binary notation in effect — to represent 64 hexagrams used for divination and philosophical reflection. Leibniz himself was aware of the I Ching and drew connections between it and his binary arithmetic.

Ancient Indian scholars, particularly in the tradition of Pingala (a Sanskrit grammarian working around 300 BCE), developed a prosodic notation using short and long syllables — again, a form of binary distinction. The Morse code, developed in the 19th century for telegraphy, uses a binary-like distinction between short and long signals (dots and dashes) to encode the alphabet.

What Leibniz contributed was not merely the observation that two symbols could represent information, but the precise mathematical formulation of place-value binary arithmetic — the same system that underlies every digital device built since the invention of electronic computing. The conceptual leap from philosophical observation to rigorous mathematical system is what made Leibniz's contribution foundational.

From Philosophy to Computing: The 20th Century Revolution

Leibniz's binary arithmetic remained primarily a mathematical curiosity for two centuries after its publication. The connection between binary numbers and electronic circuits — which ultimately made digital computing possible — was made by George Boole in the mid-19th century and Claude Shannon in the 20th century.

George Boole, working in the 1840s and 1850s, developed Boolean algebra: a branch of mathematics that formalizes logical operations (AND, OR, NOT) using binary variables. Boole showed that logical propositions could be expressed and manipulated mathematically, treating truth as 1 and falsehood as 0. This was a purely theoretical development in Boole's lifetime — no machines existed that could implement Boolean operations.

The crucial connection was made by Claude Shannon in his landmark 1937 master's thesis at MIT, 'A Symbolic Analysis of Relay and Switching Circuits.' Shannon showed that Boolean algebra could be implemented directly using electrical relay circuits, where closed circuits represented 1 (TRUE) and open circuits represented 0 (FALSE). This insight — that electronic circuits could perform mathematical and logical operations using binary states — is the direct intellectual ancestor of every computer ever built. Shannon's work transformed Leibniz's theoretical binary arithmetic and Boole's abstract logic into the engineering foundation of the digital age.

🔬 Claude Shannon's Foundational Insight When Claude Shannon realized that Boolean algebra could map directly onto electrical relay circuits — with circuit closed = 1 and circuit open = 0 — he was making a connection that Leibniz and Boole never could have anticipated. This insight, published in what has been called 'the most important master's thesis of the 20th century,' provided the theoretical foundation that made every digital computer, smartphone, and electronic device possible.

How Binary Works — The Mathematics

The Powers of 2: Binary's Building Blocks

To read and write binary numbers, you need to understand the powers of 2 — the positional values that each bit position represents. In an 8-bit (1-byte) binary number, the eight positions represent, from right to left: 2⁰ = 1, 2¹ = 2, 2² = 4, 2³ = 8, 2⁴ = 16, 2⁵ = 32, 2⁶ = 64, and 2⁷ = 128. To convert a binary number to decimal, you simply identify which bits are set to 1 and add their corresponding powers of 2.

Lower Powers (2⁰ – 2⁷)	Higher Powers (2⁸ – 2¹⁵)
2⁰	1			2⁸	256
2¹	2			2⁹	512
2²	4			2¹⁰	1,024
2³	8			2¹¹	2,048
2⁴	16			2¹²	4,096
2⁵	32			2¹³	8,192
2⁶	64			2¹⁴	16,384
2⁷	128			2¹⁵	32,768

Figure 2 — Powers of 2: the positional values for 16-bit binary numbers (2⁰ through 2¹⁵)

Reading Binary Numbers: The Bit Position Method

Let us work through the example from the original article: the binary number 10111100011010₂. To convert this to decimal, we identify the position of each bit (starting from 0 at the rightmost position) and add the positional value for every bit that is set to 1.

Reading from right to left: position 1 (value 2, bit = 1), position 3 (value 8, bit = 1), position 4 (value 16, bit = 1), position 7 (value 128, not applicable here)... The article's example gives us: 8192 + 2048 + 1024 + 512 + 256 + 16 + 8 + 2 = 12058. Let us visualize a simpler 8-bit example to understand the method clearly.

Example: Reading 10110110₂ in 8-bit format

2⁷	2⁶	2⁵	2⁴	2³	2²	2¹	2⁰
1	0	1	1	0	1	1	0
128	0	32	16	0	4	2	0

Figure 3 — Bit-by-bit breakdown of 10110110₂: each '1' contributes its positional value; 128+32+16+4+2 = 182

Binary to Decimal Conversion: Step-by-Step

10110110 in binary = (1 x 128) + (0 x 64) + (1 x 32) + (1 x 16) + (0 x 8) + (1 x 4) + (1 x 2) + (0 x 1) = 128 + 0 + 32 + 16 + 0 + 4 + 2 + 0 = 182 in decimal

Converting Decimal to Binary

Converting in the other direction — from decimal to binary — uses a method called repeated division by 2. The process is straightforward: repeatedly divide the decimal number by 2, recording the remainder (which is always 0 or 1) at each step. When you have reduced the number to 0, read the remainders from bottom to top to get the binary representation.

Decimal to Binary Conversion: Division Method

Convert decimal 45 to binary: 45 / 2 = 22 remainder 1 (LSB - rightmost bit) 22 / 2 = 11 remainder 0 11 / 2 = 5 remainder 1 5 / 2 = 2 remainder 1 2 / 2 = 1 remainder 0 1 / 2 = 0 remainder 1 (MSB - leftmost bit) Read remainders from BOTTOM to TOP: 101101 Therefore: 45 (decimal) = 101101 (binary) Verify: (1x32) + (0x16) + (1x8) + (1x4) + (0x2) + (1x1) = 32+8+4+1 = 45 ✓

Common Decimal-Binary-Hexadecimal Conversions

In computing, binary numbers are often grouped into sets of four bits (a nibble) or eight bits (a byte) and represented in hexadecimal — a base-16 system using digits 0–9 and letters A–F. Hexadecimal (hex) provides a more human-readable shorthand for binary: each hex digit exactly represents four binary digits, making long binary strings much more manageable.

Decimal	Binary (8-bit)	Hexadecimal
0	00000000	00
1	00000001	01
10	00001010	0A
15	00001111	0F
16	00010000	10
32	00100000	20
64	01000000	40
100	01100100	64
128	10000000	80
170	10101010	AA
200	11001000	C8
255	11111111	FF

Figure 4 — Decimal, Binary (8-bit), and Hexadecimal equivalents for common values (1s in binary shown in blue)

Bits, Bytes, and the Structure of Digital Data

The Bit: The Smallest Unit of Digital Information

A bit — short for 'binary digit' — is the most fundamental unit of information in computing. A single bit can hold exactly one of two possible values: 0 or 1. This might seem trivially small, but the bit's power lies in combination. Two bits together can represent four states (00, 01, 10, 11). Three bits can represent eight states. Eight bits — one byte — can represent 256 distinct states, which is enough to encode every letter, digit, and punctuation mark in the English language.

The bit is to information what the atom is to matter: the indivisible fundamental unit from which all complexity is built. A single bit encodes the answer to a single yes/no question. Is this circuit on or off? Is this pixel light or dark? Is this logical condition true or false? From billions of such simple questions answered in sequence and combination, every computation ever performed — from the simplest calculator to the most advanced artificial intelligence — emerges.

The Byte: The Practical Unit of Computing

While the bit is the theoretical fundamental unit, the byte — a group of 8 bits — is the practical fundamental unit of computing. The choice of 8 bits per byte was not arbitrary: 8 bits provide exactly 256 possible values (2⁸ = 256), which proved sufficient to encode the 128 characters of the original ASCII standard (all printable characters, control codes, and common symbols in English) with room to spare for extended character sets.

In modern computing, the byte serves as the standard addressable unit of memory: when a processor reads from or writes to memory, it typically does so in multiples of bytes. A 64-bit processor, for instance, works with registers that hold 64 bits (8 bytes) at a time. Hard drives, solid-state drives, RAM, and all other storage media measure capacity in bytes (kilobytes, megabytes, gigabytes, terabytes, petabytes).

THE HIERARCHY OF BINARY DATA UNITS
1 Bit	Single binary digit — value 0 or 1 — the smallest unit of digital information
4 Bits (Nibble)	Half a byte — can represent 16 values (0–15) — often one hexadecimal digit
8 Bits (Byte)	Standard unit — 256 possible values — sufficient for one ASCII character
16 Bits	2 bytes — 65,536 possible values — used for some character encodings and integer types
32 Bits	4 bytes — ~4.3 billion possible values — standard integer size on 32-bit systems
64 Bits	8 bytes — ~18 quintillion possible values — standard on modern 64-bit processors
1 Kilobyte	1,024 bytes (2¹⁰) — approximately 1,000 bytes; enough for a short text document
1 Megabyte	1,048,576 bytes (2²⁰) — enough for a typical photograph at low resolution
1 Gigabyte	1,073,741,824 bytes (2³⁰) — enough for approximately 250 typical songs
1 Terabyte	2⁴⁰ bytes — 1,000 gigabytes — typical modern hard drive capacity

LSB and MSB: The Most and Least Significant Bits

In any binary number, not all bit positions are equal. The rightmost bit — the one representing 2⁰ = 1 — is called the Least Significant Bit (LSB) because changes to it produce the smallest change in the number's value (changing from 0 to 1 or vice versa changes the number by only 1). The leftmost bit — representing the highest power of 2 in the number — is called the Most Significant Bit (MSB) because changes to it produce the largest change in value.

In the example binary number 10111100011010₂ from the original article: the digit 0 at the far right (position 0) represents 2⁰ = 1, making it the LSB. The digit 1 at the far left (position 13) represents 2¹³ = 8,192, making it the MSB. If you change the LSB from 0 to 1, the decimal value increases by 1 (from 12058 to 12059). If you change the MSB from 1 to 0, the decimal value decreases by 8,192.

The distinction between LSB and MSB is practically important in digital steganography — the science of hiding data within other data. A common steganographic technique called LSB substitution hides secret information in the least significant bits of digital media (images, audio files) without perceptibly altering the content. By replacing the LSB of each pixel in an image, you can encode a hidden message that is mathematically present in the data but visually invisible to human observers, because the change to each pixel's value is at most 1 — far below the threshold of human visual perception.

🔐 LSB Steganography: Hiding Messages in Plain Sight The Least Significant Bit has an important application in digital steganography — hiding secret information inside ordinary-looking files. By changing only the LSB of each pixel in a 24-bit color image, you can encode one bit of secret data per pixel (one bit per color channel in RGB). A 1-megapixel image thus has capacity for about 375 kilobytes of hidden data with imperceptible visual changes. This technique is used in digital watermarking, covert communications research, and security testing.

Why Computers Use Binary

The Electronic Reality: Voltage as Binary

The reason computers use binary is ultimately physical, not mathematical. Electronic circuits — transistors, logic gates, memory cells — operate in states that are most reliably represented as two distinct conditions rather than a continuous range of values. A transistor is either conducting (allowing current to flow, representing 1) or not conducting (blocking current, representing 0). A memory cell is either charged (holding a 1) or discharged (holding a 0). A logic gate produces either a high-voltage output (1) or a low-voltage output (0).

The engineers who designed the first digital computers in the 1940s and 1950s faced a fundamental choice: how many states should each physical component represent? Theoretically, a component that could represent 10 states (corresponding to the decimal digits 0–9) would allow more information to be stored in fewer components. But in practice, reliably distinguishing 10 different voltage levels in an electronic circuit is extraordinarily difficult: noise, temperature variations, manufacturing tolerances, and component aging all introduce uncertainty that makes fine-grained voltage discrimination unreliable.

Binary requires only two states — high voltage (1) and low voltage (0) — with a wide gap between them. This wide gap provides enormous noise immunity: even if a circuit component introduces some voltage noise, the system can still reliably determine whether the intended state was 0 (low) or 1 (high). This reliability is the fundamental engineering reason that binary became the basis for digital computing. It is not that binary is mathematically superior — it is that binary maps most naturally and reliably onto the physical behavior of electronic components.

Switches, Logic Gates, and Boolean Operations

At the most fundamental hardware level, a computer is a collection of billions of transistors — tiny electronic switches that can be turned ON (1) or OFF (0) by controlling the voltage applied to them. Each transistor is physically tiny (modern processors contain billions of transistors in an area smaller than a fingernail) but logically simple: it responds to a binary input with a binary output.

Groups of transistors are arranged into logic gates — circuits that implement the basic operations of Boolean algebra. An AND gate produces a 1 output only when both inputs are 1. An OR gate produces a 1 output when either input is 1. A NOT gate inverts its input (0 becomes 1, 1 becomes 0). From these three basic building blocks, every computation ever performed by a digital computer — arithmetic, comparison, string manipulation, graphics rendering, encryption — can ultimately be constructed.

This is the profound connection that Claude Shannon identified: the abstract algebra of Boolean logic corresponds exactly to the physical behavior of electronic switching circuits. When a logic gate evaluates a Boolean expression, it is simultaneously performing a binary arithmetic operation. The hardware and the mathematics are the same thing, expressed in different languages.

Why Not Use Decimal Directly?

A natural question arises: why not simply build computers that work in decimal, using 10 states instead of 2? This would require fewer 'characters' to represent large numbers — the decimal number 1,000 requires 4 digits, while the same number in binary requires 10 bits. Surely a decimal computer would be more efficient?

The answer is that the efficiency gain in representation is vastly outweighed by the engineering difficulty of reliably implementing 10 distinct states in electronic circuits. Researchers and engineers have periodically explored decimal computing — notably, early IBM machines used decimal arithmetic, and some specialized financial computing chips implement decimal operations for precision arithmetic. But in every practical comparison, binary systems have proven more reliable, faster, cheaper to manufacture, and easier to design at the circuit level.

Consider the switch analogy: a binary switch needs to distinguish only two positions — ON and OFF — and there is no ambiguity about which state it is in. A decimal switch would need to distinguish ten positions (0 through 9), with nine boundaries between states and nine opportunities for misclassification. In a system with billions of switches performing billions of operations per second, the compounded probability of misclassification makes decimal hardware practically infeasible at modern speeds and scales.

This is why engineers and scientists settled on binary: not because it is theoretically optimal, but because it is the number system that most reliably maps onto the physical reality of electronic circuits. The ON/OFF nature of electronic switches and the 0/1 nature of binary digits are not a coincidence — they are the same underlying concept, expressed in hardware and mathematics respectively.

Binary vs. Decimal hardware: the engineering case

Why Binary? A Simple Comparison: Decimal switch: must distinguish 10 voltage levels 0V | 0.5V | 1V | 1.5V | 2V | 2.5V | 3V | 3.5V | 4V | 4.5V Problem: noise can cause misclassification between adjacent levels Binary switch: must distinguish only 2 voltage levels LOW (0-1.5V = binary 0) | HIGH (2.5-5V = binary 1) Wide noise margin: ~1.5V gap between states Result: extremely reliable even in noisy conditions Conclusion: Binary's simplicity enables reliability at any scale.

Binary in Real-World Applications

Text Encoding: ASCII, Unicode, and UTF-8

One of the most immediately practical applications of binary is text encoding — the system by which letters, numbers, and symbols are represented as binary values that computers can store, transmit, and process. The original standard for text encoding was ASCII (American Standard Code for Information Interchange), which assigned 7-bit binary codes to 128 characters: the 26 uppercase letters, 26 lowercase letters, 10 digits, common punctuation marks, and 33 non-printing control characters.

In ASCII, the letter 'A' is represented as 01000001₂ (decimal 65), 'B' as 01000010₂ (decimal 66), and so on. When you type 'Hello' on a keyboard, the computer stores the binary sequence: 01001000 01100101 01101100 01101100 01101111 — 40 bits, or 5 bytes, representing the five characters. This is exactly the binary sequence displayed on the cover page of this document.

The limitation of ASCII — its restriction to 128 characters covering only the English alphabet and basic symbols — became increasingly problematic as computing spread globally. The Unicode standard, developed in the 1990s, extended the concept to cover every writing system in use today: over 140,000 characters representing 154 scripts including Latin, Arabic, Chinese, Japanese, Korean, Devanagari, and dozens more. The UTF-8 encoding of Unicode represents characters using 1 to 4 bytes of binary, with ASCII characters retaining their original single-byte representation for backward compatibility.

Binary in Digital Images

Every digital image is fundamentally a grid of pixels, and every pixel is fundamentally a collection of binary numbers. In a typical 24-bit color image, each pixel is described by three values — red, green, and blue — each stored as an 8-bit binary number (0–255). A completely red pixel is stored as 11111111 00000000 00000000 (255, 0, 0 in decimal). A white pixel is 11111111 11111111 11111111 (255, 255, 255). A black pixel is 00000000 00000000 00000000 (0, 0, 0).

A 12-megapixel photograph therefore consists of 12,000,000 pixels × 24 bits per pixel = 288,000,000 bits = 36,000,000 bytes = approximately 36 megabytes of raw binary data. Image compression formats like JPEG and PNG use sophisticated algorithms to represent this binary data more efficiently, but the underlying representation is always binary numbers encoding pixel color values.

Binary in Sound and Music

Digital audio applies the same principle to sound. An analog audio signal — the continuous pressure wave that constitutes sound — is sampled thousands of times per second, and each sample is converted to a binary number representing the amplitude (volume) of the sound wave at that instant. CD-quality audio samples 44,100 times per second, with each sample represented as a 16-bit binary number. This means one second of CD-quality stereo audio requires 44,100 samples × 16 bits × 2 channels = 1,411,200 bits, or approximately 176 kilobytes per second.

When you play a music file, your device's digital-to-analog converter (DAC) reads these binary numbers and reconstructs the audio waveform by setting the electrical output voltage to the level specified by each sample. The binary numbers in the file become voltages, which become movement in a speaker cone, which becomes pressure waves in air, which become sound in your ears. Binary numbers, properly sequenced and converted, are music.

Binary in Networking and Communication

When data travels across a network — whether a local Wi-Fi connection or the global internet — it travels as binary. Every email, every web page, every video call, every social media post is ultimately transmitted as a sequence of bits: 0s and 1s encoded as radio waves (Wi-Fi), electrical pulses (Ethernet), or light pulses (fiber optic cables). The networking protocols that govern how this data is packaged, addressed, routed, and reassembled at its destination — TCP/IP, HTTP, DNS — all operate on binary data at every level.

An IP address (such as 192.168.1.1) is a human-readable representation of a 32-bit binary number: 11000000.10101000.00000001.00000001. IPv6 addresses, used in modern networks, are 128-bit binary numbers — representing so many possible addresses (2¹²⁸ ≈ 3.4 × 10³⁸) that assigning a unique IP address to every atom on Earth would exhaust less than one percent of the available space.

🌐 How Much Binary Is Transmitted Every Second? Global internet traffic has grown to approximately 5 exabytes (5 × 10¹⁸ bytes) per day as of the mid-2020s — equivalent to approximately 40 quadrillion (40,000,000,000,000,000) binary bits per day, or about 460 billion bits per second at peak. Every bit of this traffic — every cat video, every financial transaction, every medical record, every scientific dataset — consists of the same two digits that Leibniz formalized in 1703: 0 and 1.

Binary Operations — How Computers Calculate

Binary Addition

Arithmetic in binary follows the same rules as arithmetic in decimal, with one simplification: there are only four possible combinations of two binary digits to add. The addition table for binary is: 0 + 0 = 0; 0 + 1 = 1; 1 + 0 = 1; 1 + 1 = 0 with a carry of 1 (since 2 in decimal is 10 in binary). This carry propagation is exactly analogous to the carrying that occurs in decimal addition when a column sum exceeds 9.

Binary addition with carry propagation

Binary Addition Examples: 0011 (= 3 in decimal) + 0101 (= 5 in decimal) ------ 1000 (= 8 in decimal) -- carry propagates 1010 (= 10 in decimal) + 0110 (= 6 in decimal) ------ 10000 (= 16 in decimal) -- result requires 5 bits Rules: 0+0=0 | 0+1=1 | 1+0=1 | 1+1=0 carry 1

Binary Subtraction and Two's Complement

Binary subtraction could be performed using direct borrow-based subtraction (analogous to decimal subtraction), but modern computers use a more elegant technique called two's complement. In two's complement representation, negative numbers are stored in a form that allows addition and subtraction to be performed using the same hardware circuit — eliminating the need for separate addition and subtraction units.

The two's complement of a binary number is found by inverting all its bits (flipping 0s to 1s and vice versa — this is called the one's complement) and then adding 1. The result represents the negative of the original number. This seemingly unintuitive representation has a remarkable property: adding a number to its two's complement always produces all zeros (with any overflow bit discarded), which is exactly the behavior expected when adding a number to its negative.

Logical Operations: AND, OR, XOR, NOT

Beyond arithmetic, computers perform logical operations on binary numbers — operations that manipulate individual bits according to the rules of Boolean algebra. These operations are implemented directly in hardware as logic gates and are fundamental to every computation from the simplest comparison to the most complex cryptographic algorithm.

BINARY LOGICAL OPERATIONS
AND	Output is 1 only when BOTH inputs are 1. Example: 1010 AND 1100 = 1000. Use: masking — extracting specific bits.
OR	Output is 1 when EITHER input is 1. Example: 1010 OR 1100 = 1110. Use: setting specific bits to 1.
XOR	Output is 1 when inputs DIFFER. Example: 1010 XOR 1100 = 0110. Use: encryption, error detection, toggle bits.
NOT	Inverts all bits (0 becomes 1, 1 becomes 0). Example: NOT 10110100 = 01001011. Use: two's complement, masking.
NAND	AND followed by NOT — universal gate (all other gates can be built from NAND). Use: transistor-level circuit design.
NOR	OR followed by NOT — also universal. Example: 1010 NOR 1100 = 0001. Use: circuit design alternative.
Left Shift	Shifts bits left, adding 0s on right. Equivalent to multiplying by powers of 2. Example: 0001 << 2 = 0100 (1 x 4 = 4).
Right Shift	Shifts bits right, discarding rightmost bits. Equivalent to integer division by powers of 2. Example: 1000 >> 2 = 0010 (8 / 4 = 2).

Practical Binary Skills for Everyday Use

Reading File Sizes and Storage Capacities

Understanding binary helps decode the often-confusing world of digital storage measurements. Storage manufacturers and operating systems have historically used different definitions of 'kilobyte' and 'megabyte,' leading to confusion when a 1-terabyte hard drive appears to contain only 931 gigabytes in Windows.

The discrepancy arises because storage manufacturers define 1 kilobyte as 1,000 bytes (base 10), while computing systems traditionally define it as 1,024 bytes (2¹⁰ = 1,024 — the power of 2 closest to 1,000). This 2.4% difference compounds across multiple levels (kilo, mega, giga, tera) to produce a 9.1% discrepancy for terabytes: 1 trillion bytes ÷ 1,073,741,824 bytes/gigabyte = approximately 931 gigabytes.

Understanding Color Codes

Web designers and developers encounter binary regularly in the form of hexadecimal color codes. The CSS color #FF5733 specifies a red-orange color: FF (255 decimal, 11111111 binary) for the red channel, 57 (87 decimal, 01010111 binary) for the green channel, and 33 (51 decimal, 00110011 binary) for the blue channel. Understanding that each two-digit hex value is an 8-bit binary number helps make sense of the 16,777,216 possible colors in 24-bit RGB color space (256³ = 16,777,216).

Network Subnetting and IP Addresses

Network administrators use binary extensively in IP address management. A subnet mask like 255.255.255.0 is meaningfully understood as 11111111.11111111.11111111.00000000 in binary: 24 consecutive 1s (indicating the 24-bit network prefix) followed by 8 zeros (indicating 8 bits available for host addresses within the subnet, allowing 256 possible addresses, of which 254 are usable). The binary representation makes the structure immediately visible in a way that the decimal notation obscures.

Conclusion: Binary — The Universal Language of the Digital World

From Leibniz's philosophical musings about God and nothingness in 17th-century Germany to the billions of transistors switching on and off in the device you are using to read this article, binary has traveled an extraordinary intellectual and technological distance. What began as an abstract number system, elegant in its simplicity and intriguing in its philosophical implications, became — through Boole's algebra and Shannon's circuit theory — the universal language of digital information processing.

The power of binary lies not in its expressive richness but in its simplicity. Two states. Two symbols. Zero and one. On and off. True and false. These distinctions are the most basic it is possible to make, and yet from them — combined, sequenced, processed at billions of operations per second — emerge every digital experience of modern life. The text you read, the images you view, the music you hear, the messages you send, the transactions you make, the calculations your devices perform without your awareness: all of it, ultimately, is binary.

Understanding binary is not merely a technical exercise for programmers and engineers. It is a form of digital literacy that illuminates the nature of the technology that now mediates so much of human experience. When you understand that your photograph is a grid of pixels each encoded as a 24-bit binary number, or that your password is transformed by cryptographic operations on binary data before being stored, or that every network packet traveling across the internet is a sequence of binary bits — you gain a clearer view of the world your devices inhabit and a better foundation for navigating it with confidence.

The binary system is, at its heart, an act of simplification: of reducing the infinite complexity of the world to its most basic distinction, and then building that complexity back up from the simplest possible parts. This is, perhaps, why Leibniz found it philosophically profound. And it is why, three centuries after his paper on binary arithmetic, the system he described remains the unshakeable foundation of the digital age.

Frequently Asked Questions (FAQ)

1. What is a binary number system?
The binary number system is a base-2 system that uses only two digits: 0 and 1. Each position represents a power of 2, making it ideal for digital computing.

2. Why do computers use binary instead of decimal?
Computers use binary because electronic circuits can easily represent two states: ON (1) and OFF (0). This makes binary more reliable and efficient than systems with more states like decimal.

3. What is a bit and a byte?
A bit is a single binary digit (0 or 1), while a byte is a group of 8 bits. One byte can represent 256 different values.

4. How do you convert binary to decimal?
You convert binary to decimal by adding the powers of 2 for each position where the bit is 1. For example, 1011 = 8 + 2 + 1 = 11.

5. How do you convert decimal to binary?
Divide the decimal number by 2 repeatedly and record the remainders. Then read the remainders from bottom to top to get the binary number.

6. What is the purpose of binary in computers?
Binary is used to represent all types of data in computers, including text, images, audio, and video. Everything in a computer is stored and processed as binary.

7. What is ASCII in binary?
ASCII is a character encoding standard that assigns binary values to letters, numbers, and symbols. For example, the letter “A” is 01000001 in binary.

8. What is the difference between LSB and MSB?
LSB (Least Significant Bit) is the rightmost bit with the smallest value, while MSB (Most Significant Bit) is the leftmost bit with the largest value.

9. What is Boolean logic in binary?
Boolean logic uses binary values (0 and 1) to perform logical operations like AND, OR, and NOT. These operations are the foundation of computer processing.

10. Can binary represent images and sound?
Yes, binary can represent images (as pixel values) and sound (as sampled waveforms). All digital media is ultimately stored as binary data.