Positional Notation & Inter-Base Conversions
Master positional radix mechanics: place-value weighting polynomials, bi-directional conversions between arbitrary bases and decimal via Horner's rule, radix fractional expansions, and the strict digit validity constraint.
1. The Story & Mental Model: The Odometer & The Finger Counting Legacy
Human civilization predominantly counts in decimal (base 10) for a purely anatomical reason: our ancestors possessed ten fingers. If humans had evolved with eight fingers like cephalopods or cartoon characters, all of global commerce, accounting, and high finance would today operate in octal (base 8).
To see why positional radix notation is one of humanity's greatest mathematical inventions, contrast it with Roman numerals. In Rome, the number was carved as MMMDCCCLXXXVIII—a fifteen-symbol brute-force tally. Multiplying two Roman numbers was so nightmarishly complex that only elite scholars could perform it using an abacus.
The breakthrough invented by ancient Indian mathematicians was positional place-value with a base and the symbol zero ().
Imagine a mechanical odometer inside a vehicle:
-
Each wheel has distinct engraved symbols: .
-
When the rightmost wheel completes one full turn past , it rolls back to and kicks the next wheel to its left forward by .
-
That single click on the second wheel represents a batch of units.
-
The third wheel represents batches of , the fourth , and so forth.
Whether (decimal), (binary switches in a microprocessor), (octal memory blocks), or (hexadecimal byte addressing), the mathematical engine under the hood is identical: every digit scales by based solely on its position.
2. The CAT Question Blueprint: How Exam Setters Frame Radix Problems
CAT and IPMAT question setters rarely test pure memorization; they test whether you can decouple mathematical logic from the decimal habit. They disguise base questions using three classic blueprints:
-
The Alien / Ancient Script Cryptarithm: An alien culture or futuristic AI reports an equation like . You must recognize the polynomial expansion and solve for the unknown base .
-
The Radix Bridge (Arbitrary Base to Arbitrary Base): Converting directly from to (e.g., from base to base ). Because students cannot multiply in non-decimal bases easily, they must use base 10 as the universal intermediate clearinghouse: .
-
The Radix Fraction Periodicity Trap: A fraction that terminates cleanly in decimal (like ) may become an infinitely recurring periodic fraction in binary or base 3, because the denominator shares no common factors with the radix.
-
The Digit Validity Trap: A question gives and asks for roots of a quadratic in . One algebraic root might be . A hasty student marks it, forgetting that a base- number can never contain the digit !
3. Core Concepts, Formulae & Derivations
A. Formal Definition of a Radix- Positional System
Let with be the radix (or base).
The allowable alphabet of digits consists of exactly distinct symbols:
For bases greater than 10, conventional alphanumeric symbols represent values :
B. The Fundamental Radix Expansion Identity
Any real number represented as expands into the convergent polynomial:
C. Horner's Nested Synthetic Scheme (Fast Base )
Calculating high powers induces arithmetic mistakes under exam pressure. Horner's Rule reformulates the polynomial nestedly:
Algorithm: Start with . At each step, multiply the running total by and add the next digit. It requires only multiplications and zero power calculations.
D. Converting Decimal Base
-
Integer Part (Successive Division):
Divide the decimal integer by . Record the integer quotient and remainder. Repeat on the quotient until the quotient is .
The first remainder generated is the least significant digit (). The final remainder generated is the most significant digit ().
-
Fractional Part (Successive Multiplication):
Multiply the decimal fractional part by . The integer part of the product becomes the next fractional digit (). Take the remaining fractional part and multiply by again to obtain , and so forth.
E. Fraction Termination Criterion in Radix
A fully reduced rational fraction (where ) terminates in base with finite fractional digits if and only if every prime factor of is also a prime factor of the base .
4. Common Pitfalls & Speed Shortcuts
[!CAUTION]
The Reverse Remainder Trap:
The most frequent student mistake during successive division is writing the remainders in the order they were produced (top-down). The FIRST remainder obtained is , which is the UNITS digit . Always read remainders bottom-up! Conversely, for fractional multiplication, read the integer parts top-down!
[!WARNING]
The Invisible Radix Constraint:
If a number is written as , write down immediately before doing ANY algebra. If your quadratic equation yields roots and , the root must be discarded immediately because digit cannot exist in base .
[!TIP]
Horner's Speed Shortcut:
To convert to base 10 in 15 seconds:
Value . No computing or !
Formulas
| Polynomial Radix Expansion | |
|---|---|
| Horner's Nested Evaluation Rule | |
| Digit Validity Inequality | |
| Radix Fraction Termination Condition |
Traps and tips
- Remainder direction: Integer division remainders are read BOTTOM-TO-TOP (least significant digit is found first).
- Fraction multiplication direction: Fractional multiplication integer parts are read TOP-TO-BOTTOM (most significant fraction digit is found first).
- The strict base bound: Every base r must strictly exceed every digit symbol appearing in its representation (r > max_digit).
- Horner's synthetic method is 3x faster than computing powers r^2, r^3, r^4 individually and avoids large multiplication errors.
Solved examples
Example 2.1.1: Base $r \to 10$ Conversion via Horner's Synthetic Scheme
An astronomical timing log in a research observatory records pulsar intervals in base as milliseconds. Convert this interval into standard decimal (base 10) milliseconds using both classical polynomial expansion and Horner's synthetic evaluation.
Show solution
Method 1: Classical Polynomial Expansion
Evaluate the powers of :
Multiply by corresponding place digits:
Sum the components:
Method 2: Horner's Nested Synthetic Scheme
Factor nestedly:
Execute step-by-step from inside out:
-
Step 1:
-
Step 2:
-
Step 3:
Both methods yield precisely .
Takeaway: Horner's synthetic scheme avoids calculating large powers of the radix, saving valuable seconds and preventing mental math slips.
Example 2.1.2: Decimal $10 \to$ Base $r$ Integer Conversion via Successive Division
A systems engineer configuring a packet buffer needs to convert the decimal memory allocation size bytes into base notation. Determine the exact representation .
Show solution
Step 1: Perform successive division by base .
Divide repeatedly by and record the integer quotient and remainder at each stage:
2,549 \div 6 &= 424 \quad &\text{remainder } 5 \; (a_0) \\ 424 \div 6 &= 70 \quad &\text{remainder } 4 \; (a_1) \\ 70 \div 6 &= 11 \quad &\text{remainder } 4 \; (a_2) \\ 11 \div 6 &= 1 \quad &\text{remainder } 5 \; (a_3) \\ 1 \div 6 &= 0 \quad &\text{remainder } 1 \; (a_4) \end{aligned}$$ **Step 2: Collect remainders in reverse order (bottom-to-top).** Reading from the final remainder $a_4 = 1$ up to the initial remainder $a_0 = 5$: $$(2,549)_{10} = (15445)_6$$ **Step 3: Verification via polynomial expansion:** $$1 \cdot 6^4 + 5 \cdot 6^3 + 4 \cdot 6^2 + 4 \cdot 6^1 + 5 \cdot 6^0$$ $$= 1(1,296) + 5(216) + 4(36) + 4(6) + 5(1)$$ $$= 1,296 + 1,080 + 144 + 24 + 5 = 2,549_{10}$$ The conversion is verified.Takeaway: Always collect successive division remainders from bottom to top; the first remainder generated is always the units place.
Example 2.1.3: Arbitrary Inter-Base Bridge ($r_1 \to 10 \to r_2$) with Duodecimal Symbols
In an archival duodecimal system (base 12, where and ), an artifact tag is labeled . Transcribe this tag into octal (base 8) notation.
Show solution
Step 1: Convert to decimal (base 10).
Substitute into the base-12 polynomial:
Step 2: Convert to octal (base 8) via successive division.
569 \div 8 &= 71 \quad &\text{remainder } 1 \; (a_0) \\ 71 \div 8 &= 8 \quad &\text{remainder } 7 \; (a_1) \\ 8 \div 8 &= 1 \quad &\text{remainder } 0 \; (a_2) \\ 1 \div 8 &= 0 \quad &\text{remainder } 1 \; (a_3) \end{aligned}$$ **Step 3: Assemble the octal representation.** Reading remainders bottom-up from $a_3$ to $a_0$: $$569_{10} = (1071)_8$$ **Verification:** $$1 \cdot 8^3 + 0 \cdot 8^2 + 7 \cdot 8^1 + 1 \cdot 8^0 = 512 + 0 + 56 + 1 = 569_{10}$$ Thus, $(3B5)_{12} = (1071)_8$.Takeaway: For non-power-of-two radices, base 10 serves as the universal error-free transit hub: convert (N) r1 - decimal - (N) r2.
Example 2.1.4: Radix Fractional Conversion via Successive Multiplication
A precision analog-to-digital converter measures a sensor voltage ratio of . Convert this decimal fraction into: (a) binary (base 2), and (b) quaternary (base 4) notation.
Show solution
Part (a): Binary Conversion via Successive Multiplication by 2
Multiply the fractional part by and harvest the integer parts top-down:
-
Iteration 1: , fractional part
-
Iteration 2: , fractional part
-
Iteration 3: , fractional part
-
Iteration 4: , fractional part
The fractional part has reached . Reading integer digits top-to-bottom:
Verification:
Part (b): Quaternary (Base 4) Conversion
Multiply successive fractional parts by :
-
Iteration 1: , fractional part
-
Iteration 2: , fractional part
Reading top-to-bottom:
(Notice also: pairs bits and , directly yielding !)
Takeaway: Radix fractions are converted by successive multiplication, harvesting integer parts from top to bottom until the fractional remainder vanishes.
Example 2.1.5: Non-Terminating Periodic Radix Fractions
Convert the terminating decimal fraction into ternary (base 3) representation. Identify the length of its repeating period and determine the 50th digit after the radix point.
Show solution
Step 1: Check termination criterion.
The reduced fraction is . The prime factors of the denominator do not divide the radix . Hence, this fraction cannot terminate in base 3; it must recur periodically.
Step 2: Execute successive multiplication by 3.
-
Iteration 1: , fractional part
-
Iteration 2: , fractional part
-
Iteration 3: , fractional part
-
Iteration 4: , fractional part
Notice that the fractional part has returned to , which was our starting value! The sequence of fractional parts is .
Step 3: State the recurring representation.
The repeating block is , which has period length .
Step 4: Find the 50th digit.
Divide the target position by the period length:
The 50th digit corresponds to the 2nd digit of the recurring block 1012, which is .
Takeaway: When the reduced denominator shares no prime factors with the base, the radix expansion is purely periodic; find the cycle length and use modulo arithmetic to pinpoint any digit.
Example 2.1.6: Algebraic Radix Determination with Strict Digit Validity
In an unknown base , the following addition is recorded: , where the symbol denotes the numeric value . Determine the unique value of the radix .
Show solution
Step 1: Formulate the strict digit validity lower bound.
Examine all symbols appearing in the problem statement:
Digits present: .
Because digit appears, the base must be strictly greater than :
Any mathematical root must be rejected.
Step 2: Expand each term into its algebraic polynomial in .
(3A4)_b &= 3b^2 + 10b + 4 \\ (271)_b &= 2b^2 + 7b + 1 \\ (655)_b &= 6b^2 + 5b + 5 \end{aligned}$$ **Step 3: Set up and solve the algebraic equation.** $$(3b^2 + 10b + 4) + (2b^2 + 7b + 1) = 6b^2 + 5b + 5$$ $$5b^2 + 17b + 5 = 6b^2 + 5b + 5$$ Subtract $5b^2 + 17b + 5$ from both sides: $$b^2 - 12b = 0$$ $$b(b - 12) = 0$$ **Step 4: Filter roots through the digit validity condition.** The algebraic roots are $b = 0$ and $b = 12$. - $b = 0$ is rejected (a radix must be an integer $> 1$). - $b = 12$ satisfies $b \ge 11$. Hence, the unique radix is $\mathbf{b = 12}$ (duodecimal).Takeaway: Always establish the lower bound b max(digits) first; it instantly disqualifies extraneous algebraic roots.
Practice questions
Question 1 · CAT Level
Let be the repeating radix fraction . When represented as a repeating fraction in base , can be expressed as , where and are distinct base- digits. Find the value of .
Show answer and explanation
Answer: (B) 34
In base , the repeating fraction evaluates to .
Let be represented in base as , which expands to .
Equating the two fractional values gives , which simplifies to .
Since and are valid base- digits (), dividing by yields and .
Thus, the digits are and , giving .
Question 2 · CAT Level
A positive integer , when expressed in base , is a three-digit number . When expressed in base , it is written with the exact same digits in reverse order, i.e., . What is the decimal value of ?
Show answer and explanation
Answer: (A) 248
Expanding in both positional bases gives and .
Equating the two forms yields , which simplifies to , or .
Since are valid base- digits, we have and .
For to lie in , the integer factor must be exactly , forcing .
From and , the unique integer solution is and .
Substituting back, the decimal value is (or ).
Question 3 · CAT Level
A positive integer has at least three digits in both base and base . If the last two digits of in base are , and the last two digits of in base are , what is the representation of the smallest such integer in base ?
Show answer and explanation
Answer: (C) (1630) 9
A number ending in digits in base satisfies .
Thus, and .
Since , by the Chinese Remainder Theorem, , i.e., .
For to have at least three digits in base , we require , so the smallest valid integer is .
Converting to base via successive division yields .
Question 4 · CAT Level
For how many integer bases does the fraction have a purely periodic expansion with period length , i.e., for some non-zero digit ?
Show answer and explanation
Answer: (A) 7
A purely periodic fraction with period in base takes the form , where is a valid digit satisfying .
Setting yields the linear Diophantine relation .
Since , must be a positive multiple of , so we can write for integer .
Substituting gives .
The digit validity constraint holds for all .
For , we have , which gives .
Hence, there are exactly such valid integer bases.
Question 5 · CAT Level
A positive integer is expressed in base as and in base as , where are non-zero digits. What is the value of ?
Show answer and explanation
Answer: (D) 13
Expanding in bases and gives and .
Equating the two forms gives , which simplifies to .
Since are non-zero base- digits, we have , which implies .
This bounds the expression: .
Testing integer values , only yields a valid integer , giving , which uniquely gives ().
Then , giving the unique digit triplet .
The required sum is (corresponding to ).
Study this concept with interactive practice in PrepSoc.
Open the concept library