A fictional library code system explains exponential counting, change of base, logarithmic equations, domains and minimum whole-number lengths.
Logarithm and code-count guide
- A library label with only three available symbols
- The exponential capacity formula
- Turn the question around
- A logarithm asks for the exponent
- What if the calculator has no log base-three key?
- Apply the change-of-base formula
- Why we round up rather than to the nearest integer
- Verify the answer by the original powers
- The exact logarithm identity behind the formula
- Why the base must be positive and not equal to one
- Why the logarithm’s input must be positive
- Use a simple exact check before trusting decimals
- A second exact example with a negative output
- How does changing the symbol set affect the code length?
- What about four symbols per position?
- A comparison of four code alphabets
- The danger of assuming a catalogue number is an ordinary integer
- Why three symbols need not mean exactly three letters
- Base-ten and natural logarithms produce the same recovered exponent
- What the calculator buttons actually represent
- Reverse a logarithmic result to verify it
- A base smaller than one as mathematical enrichment
- A logarithmic equation with a variable inside
- A false logarithm rule to avoid
- Why negative logarithm results are not an error
- A threshold equation is not quite a counting decision
- What if the code target changes to exactly 729?
- Seven common errors and what they reveal
- A six-minute independent practice set
- What parents can ask without learning logarithm tables
- How a focused A-Math tutorial can repair the first error
- Where this belongs in Singapore G3 Additional Mathematics
- Frequently asked questions
- More Additional Mathematics explanations
- Official syllabus and limits
What is Additional Mathematics when we know how many different outcomes are needed but do not know the number of repeated choices required to produce them?
A fictional library catalogue code offers one answer. Imagine a system that assigns fixed-length labels to books using a small set of symbols. Each new position in the label multiplies the number of possible codes.
The forward calculation uses powers. The reverse calculation uses logarithms. And if the calculator does not have a button for the logarithm base we need, the change-of-base formula allows us to calculate it using ordinary log or ln.
This is a mathematical model of code counting, not a description of any actual library or information-security system. The lesson is how logarithms reverse exponentials, why their arguments must be positive and how continuous algebra is interpreted when a real-world variable must be a whole number.
A library label with only three available symbols
Imagine an entirely fictional library that uses three symbols for every position in a catalogue label:
A, B and C.
Suppose a label must contain exactly n positions. Any of the three symbols may be used in any position, and repeats are allowed.
For a one-position label, the possibilities are:
A, B and C.
There are three choices.
For a two-position label, there are three choices for the first position and three for the second.
Therefore:
3 × 3 = 9 possible codes.
For three positions, the count is:
3 × 3 × 3 = 3³ = 27.
The multiplication is repeated once for every position.
The exponential capacity formula
Let n be a positive whole number representing the exact number of code positions.
Let N be the number of possible distinct labels.
With three independently selected symbols at each position:
N = 3ⁿ.
The exponent n counts how many symbol choices are multiplied together.
We can list the capacities:
| Code positions n | Possible codes 3ⁿ |
|---|---|
| 1 | 3 |
| 2 | 9 |
| 3 | 27 |
| 4 | 81 |
| 5 | 243 |
| 6 | 729 |
| 7 | 2187 |
| 8 | 6561 |
The capacity grows rapidly because adding one position triples the number of possible labels.
That is what exponential growth means here.
The symbols have not gained new identities. We simply have more independent positions in which to arrange them.
Turn the question around
Suppose the hypothetical library needs at least 1000 distinct labels.
How many positions are required?
The capacity condition is:
3ⁿ ≥ 1000.
This is different from a simple multiplication equation such as 3n = 1000.
The unknown n is in the exponent, not multiplied directly by three.
We can see from the table that six positions provide only 729 codes, which is insufficient.
Seven positions provide 2187 codes, which is sufficient.
Therefore the minimum whole-number length is seven positions.
But how would we find the answer systematically if the target were less convenient or the number of available symbols were different?
Logarithms provide the general method.
A logarithm asks for the exponent
The statement:
3ⁿ = 1000
is equivalent to:
n = log₃(1000).
The notation log₃ means logarithm to base three.
Read it as:
What exponent of three produces 1000?
Since:
3⁶ = 729
and:
3⁷ = 2187,
the value log₃(1000) must lie strictly between six and seven.
The logarithm does not magically round the result to a whole number.
It returns the real exponent that would make 3 raised to that power exactly 1000.
The code-length question has an additional whole-number restriction.
What if the calculator has no log base-three key?
Many calculators have keys labelled:
log
and:
ln.
The ordinary log key often means base-ten logarithm.
The ln key means natural logarithm, using base e.
But our problem asks for log₃(1000).
The change-of-base formula allows us to calculate it with either common logarithms or natural logarithms:
logₐ b = log b / log a,
for positive a not equal to one and positive b.
Equivalently:
logₐ b = ln b / ln a.
Both fractions give the same value because the logarithm base used in numerator and denominator is consistent.
Apply the change-of-base formula
For the fictional catalogue:
n = log₃(1000).
Using natural logarithms:
n = ln 1000 / ln 3.
Using base-ten logarithms:
n = log₁₀ 1000 / log₁₀ 3.
Both calculate the same quantity.
Numerically:
log₃(1000) ≈ 6.29.
The exact calculator display depends on precision, but the result lies between six and seven as predicted.
For an equation 3ⁿ = 1000 with n allowed to be real, the solution is approximately 6.29.
For a code that must contain a whole number of positions, this is not a usable label length.
The whole-number condition controls the final interpretation.
Why we round up rather than to the nearest integer
Our task asks for at least 1000 codes.
Six positions provide only 729.
Seven positions provide 2187.
The real threshold log₃(1000) is approximately 6.29.
Rounding to the nearest integer would give six, but that would fail the capacity requirement.
We must choose the smallest whole number greater than or equal to the threshold.
That means:
n = 7.
In mathematical notation, the ceiling function would express this as:
n = ⌈log₃(1000)⌉.
Ceiling notation is useful enrichment for describing an integer decision. It is not a claim that the ceiling function is separately required by the 2027 G3 Additional Mathematics syllabus.
The important reasoning is the direct capacity check.
Verify the answer by the original powers
A strong solution should return to the actual code-counting problem.
For n = 6:
3⁶ = 729 < 1000.
For n = 7:
3⁷ = 2187 ≥ 1000.
Therefore seven is enough and six is not.
This establishes two facts: the proposed answer works, and the immediately shorter length does not.
Without the second fact, we would show only sufficiency, not minimality.
This is a general principle in optimisation or threshold questions involving whole-number choices.
A mathematical result must answer the precise wording of the question.
The exact logarithm identity behind the formula
Why does:
logₐ b = ln b / ln a
work?
Let:
x = logₐ b.
By definition of a logarithm:
aˣ = b.
Take natural logarithms of both sides:
ln(aˣ) = ln b.
Use the logarithm power law:
x ln a = ln b.
Because a is positive and not equal to one, ln a is nonzero.
Divide:
x = ln b / ln a.
Since x was logₐ b, we obtain:
logₐ b = ln b / ln a.
This is a derivation, not merely a formula to memorise.
It explains both the quotient and the restrictions on the logarithm base.
Why the base must be positive and not equal to one
For a real logarithm function logₐ x, the conventional base must satisfy:
a > 0,
and:
a ≠ 1.
Why exclude a = 1?
Because 1 raised to every real exponent equals one.
There would not be a unique exponent giving a general positive input.
Also:
ln 1 = 0,
so the change-of-base fraction would divide by zero.
Why exclude negative bases in this real-function definition?
A negative base raised to arbitrary real powers does not define the required real-valued exponential function across all real exponents.
The standard logarithm definition uses a positive base other than one.
These restrictions are mathematical conditions, not notation preferences.
Why the logarithm’s input must be positive
The real logarithm:
logₐ x
is defined only when x > 0.
The possible count of codes N is positive, so our example meets that condition.
But an equation such as:
log₃(−9)
has no real value in the usual logarithm function.
The fact that we can calculate negative exponents does not mean a logarithm can take a negative argument.
For example:
3⁻² = 1/9.
Therefore:
log₃(1/9) = −2.
The argument 1/9 remains positive. The logarithm output is negative.
This is the important distinction.
Use a simple exact check before trusting decimals
Consider:
log₃ 81.
Because:
3⁴ = 81,
we know exactly:
log₃ 81 = 4.
Use change of base:
ln 81 / ln 3.
Since 81 = 3⁴:
ln 81 = 4 ln 3.
Thus:
ln 81 / ln 3 = 4.
Both methods agree.
This exact example helps students understand why the formula works without becoming dependent on a numerical approximation.
A second exact example with a negative output
Now evaluate:
log₃(1/9).
Because 1/9 = 3⁻²:
log₃(1/9) = −2.
Use change of base:
ln(1/9)/ln 3.
Since:
ln(1/9) = ln(3⁻²) = −2 ln 3,
the ratio is:
−2.
The logarithm input is positive while the result is negative.
A student who thinks “logs cannot be negative” is confusing input restrictions with output possibilities.
This distinction appears repeatedly in exponential and logarithmic equations.
How does changing the symbol set affect the code length?
Suppose we use only two symbols per position rather than three.
The capacity becomes:
N = 2ⁿ.
For at least 1000 labels, we need:
2ⁿ ≥ 1000.
The real threshold is:
n ≥ log₂(1000) = ln 1000 / ln 2.
This is approximately 9.97.
A whole-number label needs at least ten positions.
Check:
2⁹ = 512, insufficient.
2¹⁰ = 1024, sufficient.
Thus ten positions are required for the two-symbol model, compared with seven for the three-symbol model.
The base of the exponential changes the required number of positions.
What about four symbols per position?
Now suppose each position may contain one of four symbols.
The capacity is:
N = 4ⁿ.
We want:
4ⁿ ≥ 1000.
By logarithms:
n ≥ log₄(1000).
The real threshold is approximately 4.98.
The minimum whole-number length is five positions.
Verify:
4⁴ = 256 < 1000.
4⁵ = 1024 ≥ 1000.
So five positions suffice.
The comparison is sensible: more symbol choices per position allow a shorter code to represent the same number of distinct possibilities.
That is a mathematical consequence of multiplication, not a recommendation for real catalogue design.
A comparison of four code alphabets
| Symbols available per position | Capacity formula | Minimum positions for at least 1000 |
|---|---|---|
| 2 | 2ⁿ | 10 |
| 3 | 3ⁿ | 7 |
| 4 | 4ⁿ | 5 |
| 10 | 10ⁿ | 3 |
The ten-symbol row assumes ten choices at each position and permits leading zeroes or equivalent symbols.
For example, a three-position sequence from a ten-symbol set gives:
10 × 10 × 10 = 1000 possibilities.
If someone instead interprets the code as an ordinary three-digit integer and forbids leading zeroes, the number of choices changes.
This is why assumptions about what counts as a valid code must be stated clearly.
The maths does not determine the rules of a real library system.
The danger of assuming a catalogue number is an ordinary integer
A code such as 007 could be a legitimate three-position label in a fictional string-based code system.
But if it were interpreted as the integer seven without leading zeroes, those symbols would no longer describe a distinct three-digit integer.
Our capacity formula bⁿ assumes each of the n positions can independently take any of b symbols.
It does not automatically describe systems with restrictions such as no repeated symbols, no leading zero, reserved combinations or check digits.
A change in the allowed choices changes the counting formula before any logarithm is applied.
This illustrates a broader mathematical lesson: correct equations depend on correct assumptions.
Why three symbols need not mean exactly three letters
The base three is a count of choices at each position.
The choices could be abstract symbols, numbered tokens or otherwise distinguishable categories.
The mathematical formula uses the number of options, not the visual nature of each option.
The code example is therefore a way to understand repeated multiplication.
It is not a claim that letters behave differently from digits in the exponent rule.
Recognising the abstraction makes it easier to transfer from a catalogue story to another mathematical problem involving repeated independent choices.
Base-ten and natural logarithms produce the same recovered exponent
Consider:
log₃(1000) = ln 1000 / ln 3.
Now use base-ten logarithms:
log₃(1000) = log₁₀ 1000 / log₁₀ 3.
Although the numerator and denominator values are different in those two fractions, their ratios are equal.
That is the point of the change-of-base formula.
A common error is to mix bases inconsistently:
ln 1000 / log₁₀ 3.
That is generally not the required logarithm.
The two logarithms in the quotient must use the same base.
Consistency is more important than which valid base the student chooses.
What the calculator buttons actually represent
For most scientific calculators:
log means base ten.
ln means base e, approximately 2.71828.
Some calculators may also offer direct log-base entry.
All can produce log₃(1000) if used correctly.
With a base-ten calculator:
Enter log(1000) divided by log(3).
With natural logs:
Enter ln(1000) divided by ln(3).
A learner should understand why the operation is division rather than simply selecting whichever displayed number looks familiar.
The exact expression remains meaningful even without a calculator.
Reverse a logarithmic result to verify it
Suppose a calculator gives:
log₃(1000) ≈ 6.29.
The definition of logarithm says this exponent should satisfy:
3ˣ = 1000
when used at full precision.
If we raise three to a rounded value 6.29, the result will be near, but not exactly, 1000.
That small difference reflects rounding.
In the actual whole-number decision, the stronger final verification is:
3⁶ < 1000 ≤ 3⁷.
This check requires only integer powers and avoids confusing a rounded real exponent with a valid discrete label length.
A base smaller than one as mathematical enrichment
The standard logarithm base may be between zero and one, though our code-choice bases are all integers greater than one.
For example:
log_(1/2) 8 = −3,
because:
(1/2)⁻³ = 8.
Here the exponential function decreases as its exponent increases.
The logarithm still exists for positive arguments, but its monotonic direction differs from a log with base greater than one.
In our catalogue context, a “number of choices per position” cannot be one-half.
So this mathematical base is useful for understanding logarithms generally, but not a valid alphabet size for the counting model.
The difference between a permissible function base and a meaningful physical parameter must be recognised.
A logarithmic equation with a variable inside
Consider:
log₃(x − 2) = 4.
Convert to exponential form:
x − 2 = 3⁴.
Since 3⁴ = 81:
x − 2 = 81.
Therefore:
x = 83.
Check the logarithm domain:
x − 2 > 0.
So x > 2, and 83 is admissible.
Substitute:
log₃(83 − 2) = log₃ 81 = 4.
This shows that logarithmic equation solving combines the inverse relationship with a domain check.
The same logic is part of the official exponential and logarithmic functions syllabus.
A false logarithm rule to avoid
A student might write:
log₃(x + y) = log₃ x + log₃ y.
That is not generally true.
The correct product law is:
log₃(xy) = log₃ x + log₃ y,
for positive x and y.
The plus sign inside the logarithm cannot simply be split into two logarithms.
For a counterexample, choose x = 1 and y = 1.
The false left side would be log₃ 2, which is positive.
The false right side would be log₃ 1 + log₃ 1 = 0.
They are not equal.
Checking a simple special case can disprove an incorrect proposed identity.
Why negative logarithm results are not an error
Recall:
log₃(1/9) = −2.
This is correct because the logarithm asks for the exponent −2.
The base is positive and greater than one.
The argument is positive but smaller than one.
A negative logarithm output is natural in this situation.
Students should distinguish: a negative logarithm result, which may be valid; a negative logarithm argument, which is outside the real-log domain.
The position of the negative sign changes the mathematical meaning.
A threshold equation is not quite a counting decision
For the equation:
3ⁿ = 1000,
the real solution is approximately 6.29.
For the threshold inequality:
3ⁿ ≥ 1000,
the real solution set is n ≥ log₃(1000), because the base three exponential is increasing.
But for actual fixed-length codes, n is a whole number.
Therefore the minimum admissible n is seven.
Students should distinguish these three levels:
- Solve the equality over real numbers.
- Solve the inequality over real numbers.
- Apply the integer restriction to answer the catalogue question.
Each level has a different output.
What if the code target changes to exactly 729?
For three symbols per position:
3⁶ = 729.
If the target is at least 729 distinct labels, six positions are sufficient.
There is no need to round up from a non-integer threshold, because:
log₃(729) = 6
exactly.
This boundary example helps clarify the integer decision.
If we had 730 required labels instead, six positions would fail and seven would be needed.
The minimum whole-number length changes at the exact points where the integer-power capacity is exceeded.
Seven common errors and what they reveal
Error 1: treating 3ⁿ as 3n
Repeated independent choices multiply. Adding positions changes the exponent, not a simple linear coefficient.
Error 2: using different logarithm bases in the change-of-base fraction
Use log/log or ln/ln, not an unconverted mixture.
Error 3: rounding a minimum length to the nearest integer
A fractional threshold of 6.29 requires seven whole positions, because six do not meet the capacity requirement.
Error 4: using a logarithm argument of zero or less
Real logarithms require positive arguments.
Error 5: forgetting that the base cannot be one
The function log₁ x is not defined as an ordinary real logarithm because 1ˣ is constant.
Error 6: reporting the rounded logarithm as the number of positions
A code cannot contain 6.29 whole positions. Interpret the algebra in the stated discrete context.
Error 7: counting codes without checking the rules
If repeats, leading symbols or certain combinations are restricted, bⁿ may no longer be the correct capacity formula.
A six-minute independent practice set
1. Find log₃ 81 exactly. 2. Find log₃(1/9) exactly. 3. Express log₃ 1000 using ln. 4. Find the minimum length for 1000 codes using two symbols per position. 5. Do the same with four symbols per position. 6. Explain why 6.29 rounds to seven, not six, in the three-symbol catalogue problem. 7. Solve log₃(x − 2) = 4 and check its domain. 8. Explain why log₃(x + y) cannot generally be split into log₃ x + log₃ y.
Answers: four; negative two; ln 1000 / ln 3; ten positions; five positions; because six positions provide only 729 codes; x = 83 with x > 2; because the logarithm law applies to products, not sums.
The reasons are the actual learning target. The numbers alone are not enough.
What parents can ask without learning logarithm tables
Ask your child why an extra code position multiplies capacity instead of simply adding three possibilities.
Ask why logarithms appear when the unknown is the exponent.
Ask why the calculator can use natural logs to answer a base-three question.
Then ask why a real-number answer of about 6.29 means seven whole positions in this particular problem.
These questions test modelling and interpretation as much as calculation.
How a focused A-Math tutorial can repair the first error
One learner may understand code counting but not recognise the exponential equation.
Another may write log₃ 1000 correctly but forget the change-of-base denominator.
Another may calculate approximately 6.29 and report six as the minimum length.
A fourth may ignore a logarithm domain restriction in a related equation.
A targeted tutorial can diagnose the first incorrect line, repair that concept and ask the student to solve a changed alphabet-size problem independently.
The goal is to move from a memorised calculator sequence to dependable mathematical reasoning.
Where this belongs in Singapore G3 Additional Mathematics
The official 2027 Singapore–Cambridge Secondary Education Certificate G3 Additional Mathematics syllabus K341 includes exponential and logarithmic functions, the laws of logarithms, equivalence of exponential and logarithmic forms and change of base of logarithms under Algebra A6.
The catalogue model uses those explicitly prescribed relationships. Its integer threshold and code-counting features are a supplementary real-world-style interpretation, not a claim that library codes are an announced examination context.
SEAB lists G3 Additional Mathematics under K341 for 2027, with earlier GCE O-Level code 4049 shown for reference. G2 Additional Mathematics K232 has its own subject scope.
Frequently asked questions
What is change of base of logarithms?
It is a formula that rewrites a logarithm using another valid logarithm base: logₐ b = ln b/ln a or log b/log a.
Why can I use ln to calculate a base-three logarithm?
Because both numerator and denominator use the same base, and the ratio gives the original logarithm’s exponent.
Can a logarithm have a negative answer?
Yes. For example, log₃(1/9) = −2.
Can a real logarithm take a negative argument?
No. The real logarithm requires a positive argument.
Why must the base be positive and different from one?
Those conditions make the conventional exponential inverse meaningful and prevent a zero denominator in the change-of-base formula.
Why do we round code length upwards?
The model requires enough whole positions to provide at least the target number of labels. Rounding down would not provide sufficient capacity.
Is this a real library numbering method?
No. It is an invented fixed-length code model used to illustrate exponential counting and logarithms.
Are logarithm laws and change of base examined in G3 Additional Mathematics?
Yes. Both are explicitly listed in Algebra A6 of the official 2027 K341 syllabus.
What should students revise first?
Indices, powers, inequalities, inverse operations, factorisation of simple expressions, positive domains and accurate calculator input.
More Additional Mathematics explanations
The savings target and logarithmic time explains another case where an unknown lies in an exponent.
The science table that turns a power law into a straight line uses logarithms to recover gradients and coefficients from transformed relationships.
The cooling cup that connects exponentials, logarithms and derivatives illustrates the inverse relationship in a decaying model.
For the subject overview, see What Is Additional Mathematics? and How Additional Mathematics Works.
The immutable Clementi Mathematics small-group tutor reference explains how students develop strong algebraic foundations and receive precise feedback as concepts become more abstract.
Official syllabus and limits
The primary curriculum source is SEAB’s 2027 G3 Additional Mathematics K341 syllabus (PDF), Algebra A6, together with the SEAB’s 2027 G3 subject listing.
All catalogue symbols, code targets and assumptions are invented. No actual library catalogue, identifier system or security property is represented by this model.
The enduring mathematical lesson is to use logarithms when the exponent is unknown, change their base consistently and then interpret the result according to the problem’s real constraints.