eduKate Singapore

VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Next useful routeCanonical hubHELP

Mathematics in Bukit Timah | Binary Numbers, Place Value and Digital Patterns

—

by

eduKate Asia
Original editorial illustration comparing scattered independent binary symbols with long runs of repeating binary symbols, arranged as two abstract rows without labels.

A pupil sees the digits 1011 and reads one thousand and eleven. That is correct if the numeral uses familiar decimal place values. But a computer-related Mathematics worksheet might write 1011₂, which uses base two. It means eleven, because its columns represent eight, four, two and one rather than thousands, hundreds, tens and units.

This Mathematics in Bukit Timah lesson uses invented classroom number cards, imaginary switches and short digital patterns to teach number bases, binary place value, conversion, carrying, powers of two, fractional representation and basic error checking. Every classroom code and equipment scenario is fictional. None is a real student identifier or an issued technology specification for a Bukit Timah school.

The immediate rule is to match each digit with its column’s power of the chosen base. Thus 1011₂ = 1×8 + 0×4 + 1×2 + 1×1 = 11₁₀. Changing the base changes how a numeral is written without changing the underlying quantity.

Article contents

Original editorial illustration of different sequences of binary symbols, used to introduce place value and representations without showing any real school identification code.

Quick answer: the base controls the place values

In base ten, a four-digit numeral has columns of value 1000,100,10 and 1. In base two, four columns have values 8,4,2 and 1.

A positional numeral means the sum of each digit multiplied by its column value. The subscript ₂ identifies base two and ₁₀ identifies base ten. Without a declared base, a short sequence of digits may be ambiguous.

Binary digits are restricted to zero and one. A written form such as 102₂ is not a valid binary numeral because digit two is not available in the base-two digit alphabet.

Why use a Bukit Timah learning story?

Children around Beauty World or Sixth Avenue may have seen calculators, laptops or simple on–off switches. A number represented by several selected or unselected cards can help connect Mathematics to those familiar objects.

But the numerical exercises do not claim to describe data actually recorded by local schools. The binary strings were constructed so a learner can check every conversion independently.

The lasting skill is positional reasoning. It is useful whether the context is a mathematical number puzzle, a computing lesson or a new representation introduced later.

Powers of two begin at exponent zero

From the rightmost binary digit, place values are 2⁰=1, then 2¹=2, 2²=4, 2³=8, 2⁴=16, 2⁵=32 and so on.

A common mistake is to make the rightmost digit worth two. That doubles the final decoded number because every column is shifted one power too high.

A reliable habit is to write the column values above the number before adding. The zero power gives one, not zero and not two.

Worked example 1: decode 11010₂

Label the positions 16,8,4,2,1. The digits 1,1,0,1,0 select sixteen, eight and two.

Calculate 16+8+2=26. Therefore 11010₂=26₁₀.

The zeros are important placeholders: one excludes the four-unit column, and the other excludes the one-unit column. Removing a middle zero would shift the values of other digits and change the number.

Place-value cards make the idea visible

Prepare five paper cards labelled 1,2,4,8 and 16. Turn over a card to indicate zero or leave it face up to indicate one.

To make thirteen, display the eight, four and one cards while hiding the two card. Reading the 8,4,2,1 positions as present or absent gives 1101₂.

This concrete representation introduces the structure before a pupil needs formal binary algorithms. The transition is from selected groups to a column notation for the same sum.

Worked example 2: convert thirteen to binary

The largest power of two not exceeding thirteen is eight. Subtract eight, leaving five.

Four fits into the remaining five; subtract it, leaving one. The two-unit card does not fit, so record zero. The one-unit card fits, so record one.

Reading positions 8,4,2,1 gives 1101₂, and the reverse check 8+4+0+1=13 confirms the conversion.

A bit is a binary digit, not automatically a number label

A bit is one binary position holding either zero or one. A four-bit string has four positions, each with two possible states.

There are 2×2×2×2=16 possible four-bit strings. Under ordinary unsigned interpretation, these represent integer values zero through fifteen.

The same patterns could represent categories or machine states under another explicit encoding. A bit string gains its interpretation from the convention chosen for it.

Worked example 3: count the four-bit possibilities

Four independent binary positions offer 2⁴=16 patterns. They include 0000,0001,0010 and so on up to 1111.

The maximum unsigned four-bit value is 8+4+2+1=15. The number of possible values is sixteen because zero is counted.

This distinction prevents the mistaken conclusion that “four bits mean sixteen is the biggest value”. Sixteen is the count of distinct patterns, not the maximum unsigned value.

Repeated division gives a second conversion method

To express a nonnegative decimal integer in binary, repeatedly divide by two, recording each remainder. Continue with the quotient until it reaches zero.

The first remainder describes the least significant bit. Read all remainders from the last recorded one back to the first.

This method is systematic even when the number is too large for convenient mental decomposition into powers of two.

Worked example 4: convert nineteen by division

Nineteen divided by two gives quotient nine, remainder one. Nine gives quotient four, remainder one. Four gives quotient two, remainder zero.

Two gives quotient one, remainder zero. One gives quotient zero, remainder one. Reading those remainders upward produces 10011₂.

The reverse check is 16+0+0+2+1=19. Both methods agree because they are two descriptions of the same place-value structure.

Why the remainder list must be reversed

The initial division by two strips out the one-unit digit. The next division extracts the two-unit digit, and later divisions reveal progressively higher powers.

The first remainder therefore belongs at the far right of the completed binary numeral. Reading the list forward would reverse the intended place-value order.

Instead of memorising “bottom to top”, ask what the first remainder represents. Understanding its role makes the reversal inevitable.

Worked example 5: an even number has a final zero

Convert decimal eighteen: 18÷2 gives quotient nine, remainder zero. Subsequent divisions give remainders one, zero, zero and one.

Reverse the remainder list to obtain 10010₂. Its value is 16+2=18.

The rightmost zero reveals evenness without full conversion because every other selected binary place value is a multiple of two.

Parity can be read from the final bit

In ordinary unsigned binary, an integer ending in zero is even. An integer ending in one is odd.

The reason is that every binary place above the units column has value 2,4,8,16 and so on, all even. Only the rightmost one-unit column can change an even total into an odd total.

This is a general proof, not a pattern inferred from just a few example numbers.

Worked example 6: identify oddness immediately

Consider 110111₂. Its rightmost bit is one, so the value is odd.

Decode to verify: 32+16+0+4+2+1=55, indeed odd.

The quick rule answers a parity question, but it does not tell the exact value unless the remaining positions are evaluated.

Binary addition carries after two units

In decimal addition, ten units carry into the next column. In binary addition, two units carry because only digits zero and one are permitted in each position.

Thus 1₂+1₂=10₂. The result is two in value, written as zero units with one two-unit place.

The carrying concept is familiar; the new base changes the group size needed before a carry occurs.

Worked example 7: add five and three

Binary five is 101₂, and binary three is 11₂. Align the three positions as 101 and 011.

In the units column, 1+1 gives zero with carry one. In the twos column, 0+1 plus carry gives zero and a new carry. In the fours column, 1+0 plus carry again produces zero with a carry to the eights column.

The final result is 1000₂, or eight. Verify in decimal: 5+3=8.

Why a long carry chain is not a mistake

Adding 111₂ and 1₂ produces 1000₂. The answer gains one more digit even though the quantity increases by just one.

The starting pattern 111₂ is seven, and all lower places already contain one. Adding one carries successively through units, twos and fours to create a new eight-unit place.

This is similar to 999+1=1000 in decimal. Positional bases share the same structural idea.

Worked example 8: seven plus one

Write seven as 111₂ and one as 001₂ for column alignment. Add right to left, carrying each pair of ones into the next position.

The result is 1000₂. Its decoded value eight confirms the arithmetic.

An invalid outcome containing digit two in one column shows that a carry was not performed correctly.

Binary subtraction borrows two lower-place units

When subtracting one from a binary zero in a given column, borrow a unit from the next higher place. That borrowed unit is worth two units in the current position.

Thus 1000₂−1₂=111₂. In decimal, eight minus one gives seven.

Learners who know decimal borrowing can use the same reasoning with groups of two, provided they keep the power-of-two columns aligned.

Worked example 9: subtract three from ten

Represent ten as 1010₂ and three as 0011₂. Subtract with binary borrowing to obtain 0111₂.

The result equals 4+2+1=7, matching decimal 10−3=7.

The initial zero in 0111 is optional in an ordinary unsigned integer but useful when a fixed four-column layout makes the calculation easier to check.

Leading zeros can have a formatting purpose

Numerals 101₂, 0101₂ and 00000101₂ all have decimal value five under an unsigned integer convention.

However, a device or classroom format may require exactly eight bit positions. In that case the leading zeros preserve the format, even though they do not change numerical value.

Students must distinguish a number’s mathematical value from a fixed-width field’s written pattern.

Worked example 10: display five in eight bits

Start with 101₂. Add five leading zeros to reach eight digits: 00000101.

The eight place values are 128,64,32,16,8,4,2,1. Only the four and one columns are selected, so the value is still five.

Calling the pattern a school identifier would require an actual coding convention; in this lesson it is only an invented bit-string example.

Eight bits represent a finite set of unsigned integers

Eight binary positions can form 2⁸=256 patterns. Under the unsigned interpretation, those patterns encode values 0 through 255.

The largest one is 11111111₂, whose selected values sum to 128+64+32+16+8+4+2+1=255.

The difference between pattern count 256 and maximum value 255 is explained by the inclusion of zero.

Worked example 11: overflow in a fixed-width model

Suppose an invented eight-bit unsigned counter stores the maximum 255 and receives an instruction to add one.

The mathematical result is 256, represented as 100000000₂ using nine bits. An eight-bit field cannot represent it under the same unsigned encoding.

A real computing system might detect, reject, saturate or wrap the operation depending on the language and rules. Do not silently assume one handling method when none has been specified.

Left shifts correspond to powers of two

For a nonnegative unsigned integer with enough available bits, shifting its binary numeral one position left and appending zero multiplies its value by two.

For instance, 101₂ represents five and 1010₂ represents ten. Shifting again to 10100₂ represents twenty.

This property follows because every selected digit moves from weight 2^k to weight 2^(k+1). It is a positional relation, not a special rule confined to computing.

Worked example 12: multiply by four through a shift

Binary 110₂ represents six. Shifting left by two positions gives 11000₂.

That value is 16+8=24, which equals 6×4. Two left shifts multiply by 2²=4 when no relevant bits are discarded.

Fixed-width overflow can change what remains stored, so the exact rule belongs to the arithmetic representation being used.

Binary multiplication uses the distributive property

Multiplying a binary numeral by another can be carried out through shifted copies of the multiplicand corresponding to the one bits of the multiplier.

For example, 101₂×11₂ means five times three. Since binary 11₂ has a one-unit bit and a two-unit bit, add 101₂ and 1010₂.

The sum is 1111₂, which represents fifteen. Ordinary multiplication and binary long multiplication obey the same distributive law.

Worked example 13: five multiplied by three

Take 101₂ (five). Add one unchanged copy and one copy shifted left: 101₂+1010₂=1111₂.

Decode 1111₂: 8+4+2+1=15. Check 5×3=15.

The method explains why shift-and-add multiplication works without treating it as an unexplained computer trick.

Binary fractions use negative powers

To the right of the binary point, the first place is 2⁻¹=1/2, followed by 2⁻²=1/4, 2⁻³=1/8 and so on.

The numeral 0.101₂ means 1/2+0/4+1/8=5/8=0.625 in decimal.

The point resembles a decimal point, but the column values are powers of two rather than powers of ten. A pupil who reads .101₂ as 0.101 decimal has ignored the specified base.

Worked example 14: convert 10.11₂

The whole-number portion 10₂ equals two. The fractional portion .11₂ equals one half plus one quarter, or 0.75.

Thus 10.11₂=2.75₁₀. The calculation combines powers of two above and below exponent zero.

This shows that binary can represent non-integer quantities as well as whole numbers, although some fractions require infinitely long expansions.

Why one tenth has no finite exact binary expansion

A finite binary fraction has a denominator that divides some power of two when written as a reduced rational number.

Decimal 0.1 equals 1/10. The reduced denominator contains a factor of five, so it cannot divide any pure power of two.

Therefore 0.1 in decimal does not have a terminating binary fractional expansion. A fixed-width binary representation generally approximates it rather than representing it exactly.

Worked example 15: distinguish one half from one tenth

One half is 0.1₂ because it occupies the first fractional place. One tenth is 0.1₁₀, and that printed form belongs to decimal notation.

These two strings look similar but their values differ: 0.5 versus 0.1 in decimal.

The base label is essential. This is an effective diagnostic for a learner who understands integer binary but switches place-value systems after a point.

Binary bit patterns can encode different meanings

The bit string 01000001₂ represents unsigned integer 65. Under the ASCII character coding convention, the same eight-bit pattern represents the capital Latin letter A.

The bits do not themselves say “number” or “letter”. The encoding rule determines their interpretation.

This gives pupils a careful way to connect number representation with computers without claiming that every sequence of bits represents text.

Worked example 16: one string with two interpretations

Decode 01000001₂ as unsigned integer: 64+1=65.

If the problem specifies ASCII character encoding, code 65 corresponds to A. The sequence can therefore represent a number or character under two different declared conventions.

Both statements are correct only when the intended encoding is identified. A school-created code may follow an entirely different mapping.

Signed integers use another interpretation rule

Under conventional eight-bit two’s complement, the possible signed integer range is −128 through 127. The highest bit contributes negative positional weight.

Thus the eight-bit pattern 11111110 represents 254 under unsigned interpretation but −2 under two’s complement.

This is an enrichment concept; students should master unsigned place values before discussing signed bit widths and overflow rules.

Worked example 17: the two’s-complement value

Read 11111110 with highest-place weight −128 and the remaining weights +64,+32,+16,+8,+4,+2,+1.

Sum −128+64+32+16+8+4+2+0=−2. Under unsigned interpretation, the same positions instead total 254.

The difference is a representation convention, not an arithmetic contradiction.

A first bit of one does not always imply negativity

In an unsigned representation, the highest bit has a positive weight. In two’s complement, it has a negative positional interpretation at the selected width.

Therefore reading a leading one as “negative” without identifying signedness can be wrong.

A useful output label states the bit width and whether the representation is unsigned or signed. Those details determine which formula is appropriate.

A modulo rule can describe deliberate wraparound

Suppose a fictional eight-bit unsigned counter explicitly wraps modulo 256. After reaching 255, adding one produces remainder zero when divided by 256.

Similarly, a stipulated stored result for 250+10 would be 260 mod 256 =4.

This is a mathematical conditional example of one overflow rule. It does not assert that every calculator, programming language or computer system implements the same behaviour.

Worked example 18: 250 plus ten with a fixed rule

Take 250 and add ten to obtain 260. Divide by 256 to get quotient one and remainder four.

Under the specified modulo-256 wraparound model, the stored eight-bit unsigned result is 4, represented as 00000100.

If no such wraparound convention were supplied, the proper response would instead flag that 260 exceeds the standard eight-bit unsigned range.

Powers of two count how many patterns exist

Adding one independent binary position doubles the number of possible strings because every earlier string can be followed by zero or one.

Two bits have 4 patterns, three bits have 8, four bits have 16, and ten bits have 1024.

These counts say how many patterns could exist under the combinatorial model. They do not prove that an organisation has issued that many authorised codes or that every pattern is usable for its purpose.

Worked example 19: a ten-bit unsigned range

A ten-bit string has 2¹⁰=1024 possible patterns. As unsigned integers, those range from 0 to 1023.

Its maximum is ten ones, which sums to 2¹⁰−1=1023. The formula follows from adding the geometric series of place values.

This connects basic binary place value to exponential patterns without requiring students to memorise each large binary numeral individually.

Hexadecimal groups binary in fours

Hexadecimal uses base sixteen and permits symbols 0 through 9 and A through F, with A representing ten through F representing fifteen.

Each hexadecimal digit corresponds exactly to four binary bits because 2⁴=16. This makes long binary strings more compact to write.

The representation is still positional. A hexadecimal numeral and a binary numeral can describe the same integer.

Worked example 20: convert 11010110₂ to hexadecimal

Group into fours from the right: 1101 and 0110. The first is 8+4+1=13, written D in base sixteen. The second is six.

Thus 11010110₂=D6₁₆. Convert back to decimal for confirmation: D6₁₆ = 13×16+6=214.

The binary version also totals 128+64+16+4+2=214. All three forms represent the same integer.

A bit count is not its positional numerical value

The Hamming weight of a bit string is the number of ones it contains. It is different from its unsigned positional value.

For instance, 101101₂ contains four ones but has value 32+8+4+1=45.

The distinction is useful for counting active switches or simple parity checks. A count of selected bits is a property of the string, not the amount encoded by its place values.

Worked example 21: decode and count separately

Take the six-bit string 101101. Its Hamming weight is four.

Its unsigned binary value is 45. Both answers can be given correctly in the same problem if their labels make clear which quantity was requested.

Writing only “four” for an unspecified “binary value” question would confuse two different mathematical operations.

Even parity is an error check with limits

In a fictional even-parity scheme, an extra bit is chosen so that the full string contains an even number of ones.

For data string 10110, there are three ones, so parity bit one produces 101101 with four ones. A single flipped bit changes parity and can be detected.

Some multiple-bit errors leave parity unchanged. The rule is a limited consistency test, not authentication and not a guaranteed way to reconstruct the intended data.

Worked example 22: a detected and undetected mistake

The complete even-parity string 101101 has four ones. If one zero changes to one, it then contains five ones and fails the check.

If two suitable bits change, the total number of ones can remain even. For instance, swapping a zero to one and a one to zero preserves the total one-count.

Thus the same rule that catches a single error can miss certain two-bit changes. A precise conclusion names the class of errors detected, not “every possible mistake”.

Number representation is not encryption

Binary numerals express values in base two. Anyone knowing the notation can convert them. No secret key or protection is implied by using zeros and ones.

Check digits and parity checks likewise provide limited error detection rather than proof that an identifier is genuine or access is authorised.

This distinction matters when pupils encounter digital terms. Correctly reading a code is a different task from verifying its source or security.

A conversion is correct only when the values agree

Decoding 1101₂ gives thirteen. Encoding thirteen in binary gives 1101₂ again. This round-trip test is a powerful self-check.

The same idea works for hexadecimal. If a claimed D6₁₆ converts to 214 decimal but the student’s binary value gives 210, at least one conversion is wrong.

Independent representations are useful because they catch errors without simply repeating the identical original arithmetic.

Four errors tutors should diagnose separately

One learner may assign the wrong starting place value. Another may forget to carry in binary addition. A third may ignore a fixed-width overflow condition. A fourth may confuse an encoding convention with the raw number.

The corresponding repairs are different: build power-of-two cards, rehearse a carry, define bit width, or state the chosen interpretation.

A small-group tutorial should target the first invalid thought rather than demand faster completion of the same incorrectly understood procedure.

Primary foundations: doubling and grouping

Young pupils can make groups of one, two, four and eight counters, then select combinations to form small numbers.

Ask why eight and one make nine, and how a card can be marked selected or unselected. This prepares positional reasoning in a concrete form.

Do not introduce two’s-complement arithmetic before whole-number operations and basic powers are understood confidently.

Lower Secondary: indices, conversion and checks

Secondary learners can label 2⁰,2¹,2², convert using remainders and perform short binary sums. They should be encouraged to verify answers in decimal.

The most useful progress marker is the explanation: why the columns double, why the remainders reverse, and why a new leading digit may appear after a carry.

Those principles transfer to other number systems more reliably than memorising one large conversion table.

Upper-level extension: encodings and fixed-width numbers

Interested students can explore signed and unsigned representations, binary fractions, hexadecimal, modulo wraparound and parity schemes.

These topics connect Mathematics to computing, but not every extension is a mandatory item in every SEC Mathematics course.

The responsible teaching sequence moves from representation to arithmetic, then to restrictions, bit width and interpretation.

A twenty-minute home diagnostic

Minutes 1–5: Convert 1011₂ to eleven and 11010₂ to twenty-six. Explain the place-value columns.

Minutes 6–10: Convert decimal thirteen to 1101₂ and decimal nineteen to 10011₂. Confirm both by adding powers.

Minutes 11–15: Add 101₂ and 11₂, obtaining 1000₂. Ask which column carries and why.

Minutes 16–20: Interpret 00000101 as unsigned five, then explain why a different stated encoding might assign the same pattern a different meaning.

A seven-day revision sequence

Day one creates powers-of-two groups. Day two decodes binary integers. Day three converts decimal numbers using selected place values.

Day four practises repeated division. Day five adds and subtracts short bit strings. Day six introduces binary fractional places. Day seven changes the representation convention and asks the learner to distinguish format from value.

Review an earlier mistake after a day or two rather than copying a corrected line immediately. Independent retrieval indicates whether the concept has been learned.

Practice questions and checked answers

A. Convert 111₂ to decimal. Answer: 7.

B. Convert 12₁₀ to binary. Answer: 1100₂.

C. Add 101₂ and 11₂. Answer: 1000₂.

D. Convert 0.101₂ to decimal. Answer: 0.625.

E. How many five-bit patterns are possible? Answer: 2⁵=32.

F. Is 102₂ valid? Answer: no; digit two is not permitted in base two.

Frequently asked questions

Is binary another quantity or another way to write the same number?

It is another positional representation. The underlying quantity is unchanged when a conversion is performed correctly.

Why is 1011₂ eleven rather than 1011 in decimal?

Its positions carry values eight, four, two and one, giving 8+2+1=11.

Can a binary string begin with zero?

Yes. Fixed-width formats can require leading zeros even though they do not change ordinary unsigned integer value.

What happens when two ones are added?

They form binary ten: write zero in the current place and carry one to the next higher place.

Does an eight-bit string always represent 0 to 255?

Only when it is interpreted as an unsigned eight-bit integer. Other conventions give different meanings.

Can a finite binary fraction represent decimal 0.1 exactly?

No. One tenth’s reduced denominator includes factor five, so its binary expansion is not finite.

Is writing a number in binary the same as encrypting it?

No. Base-two representation is openly convertible and does not provide secrecy.

Are these actual Bukit Timah pupil numbers?

No. Every digital label and code in this lesson is fictional.

How can a parent recognise real understanding?

The child can justify place values, carry correctly, verify conversions and explain which bit width or encoding rule gives a string its meaning.

The MOE Primary Mathematics syllabus provides foundational place-value and number skills, and SEAB’s 2027 G3 Mathematics syllabus directory gives Secondary subject context. The signed-binary and encoding extensions are enrichment, not claims that every detail is assessed in the same course.

Continue with Mathematics in Bukit Timah: modular arithmetic and check digits and exponential functions and logarithms for related numerical structures. The immutable Clementi Secondary 1 Mathematics small-group reference anchors the concept-first explanations, diagnosed errors and independent checking.

The durable habit is to state the base, label positional weights, preserve the declared format and verify whether a result is a numerical value, a pattern property or a separate encoded meaning.

Related Mathematics in Bukit Timah articles in this four-part batch: Graph colouring and conflict-free timetables · Standard deviation and variance · Trapezoidal rule and curved-area estimates. Read these connected lessons for different questions about discrete structures, positional numbers, data spread and numerical approximation.

Discover more from eduKate Singapore

Subscribe now to keep reading and get access to the full archive.

Continue reading