Non-Decimal Base Arithmetic
Master column addition with base-r carries, subtraction with base-r borrows across zeros, long column multiplication, and squaring directly within arbitrary radices without converting to base 10.
1. The Story & Mental Model: Reprogramming the Arithmetic Reflex
When a first-grader adds , they are not performing magic. They are doing two distinct operations:
-
Recognizing that exceeds the decimal threshold .
-
Decomposing , writing down and carrying into the tens column.
Similarly, when subtracting , we borrow from the tens place, adding to the units place to turn into .
We do this reflexively because we have practiced it for thousands of hours. But the number is not a law of physics—it is merely the overflow threshold of base 10!
In Base 7, the overflow threshold is :
-
If a column sum is , we do not write and carry . We divide by :
-
If we must borrow from the adjacent column in base 7, that borrowed brings over units, NOT !
Direct base arithmetic means learning to see the radix as the modular overflow valve for addition and multiplication, and the bucket volume for subtraction borrows.
2. The CAT Question Blueprint: How Radix Arithmetic Appears in the Exam
CAT and premier management exams test base arithmetic in three primary styles:
-
Direct Multi-Digit Base Operations: Add or subtract two or three numbers given in base , base , or base . Converting all operands to base 10, computing, and converting back to base consumes more time and multiplies error risk.
-
Subtraction with Cascading Borrows Across Zeros: For example, . Questions are specifically engineered with chains of zero digits to catch students who accidentally borrow or mishandle intermediate zeroes.
-
Column Multiplication and Squaring: Evaluating or directly. Exam setters test whether students can manage carries generated during partial cross-products in base .
-
Alphametic / Cryptarithmetic Puzzles: Letter equations where operations obey base- addition rules, requiring column-by-column modular deduction.
3. Core Concepts, Formulae & Derivations
A. Column Addition in Radix
For any column with digit inputs , , and incoming carry :
-
Compute the raw sum in ordinary integers:
-
Decompose via Euclidean division by :
If , carry is . If , carry is . If , carry is .
B. Column Subtraction and the Base- Borrow Rule
To subtract from with incoming borrow :
-
If , no borrow is required:
-
If , we must borrow from the next higher non-zero column. Borrowing adds exactly to the current column:
C. Borrowing Across Zeros in Radix
When borrowing across a column containing digit :
-
The borrow travels leftward until it finds the first non-zero digit, decreasing it by .
-
Every intermediate zero that is passed over turns into .
-
The destination column receives the full radix value .
(This is identical to decimal, where borrowing across turns it into . In base , the intermediate zero becomes !)
D. Column Multiplication in Radix
To multiply a multi-digit number by a single digit in base :
For each digit and incoming carry :
When multiplying multi-digit numbers, generate partial products, shift each subsequent row leftward by appending zeros, and sum the partial products using base- column addition.
E. The Digital Root Check Modulo
In base 10, "casting out nines" works because .
In any base , since , the digital sum modulo is an arithmetic invariant:
This provides an instant checksum to verify additions and multiplications in base .
4. Common Pitfalls & Speed Shortcuts
[!CAUTION]
The Phantom Decimal Borrow Trap:
The most insidious error in base subtraction is instinctively adding instead of the base when borrowing!
- In base , if you have and borrow from the next column, your new value is , NOT !
- If you must subtract , the result is .
[!WARNING]
The Multi-Unit Carry Trap:
In base 10, adding two digits produces a carry of at most (). But when adding THREE numbers in a small base like base 4, digits .
In base 4: , not ! Always divide by explicitly.
[!TIP]
The Base Squaring Expansion:
To square a two-digit number directly:
Compute the terms , , and , convert each to base , and ripple carries leftward. It is twice as fast as long multiplication!
Formulas
| Base-r Addition Carry & Digit | |
|---|---|
| Base-r Subtraction Borrow Rule | |
| Borrow Across Zero Invariant | |
| Digital Root Check Modulo (r-1) |
Traps and tips
- Base borrow magnitude: When borrowing in base r, you add r to the current digit, NEVER 10.
- Borrow across zero: A zero borrowed across in base r becomes (r - 1), just as a zero in base 10 becomes 9.
- Multiple carries: When adding three or more numbers in a small base, the carry can be 2, 3, or more (carry = floor(sum / r)).
- Fast verification: Take the sum of digits modulo (r - 1) on both sides of the equation to detect arithmetic slips instantly.
Solved examples
Example 2.3.1: Multi-Digit Addition in Base 7 with Cascading Carries
Evaluate the addition directly in base 7 without converting intermediate values to decimal.
Show solution
Step 1: Set up the numbers in columns.
\begin{array}{r@{\quad}c@{\quad}c@{\quad}c} & 5 & 6 & 4 \\ & 4 & 5 & 5 \\ + & 3 & 4 & 6 \\ \hline \end{array}
Step 2: Add Column 0 (Units place, ):
Divide by radix :
Step 3: Add Column 1 (Sevens place, ):
Divide by radix :
Step 4: Add Column 2 (Forty-nines place, ):
Divide by radix :
Step 5: Write the highest place carry:
Assemble the digits:
Verification via Decimal:
-
-
-
-
Sum
-
. Exact!
Takeaway: Divide each column sum by the radix r: write down the remainder and carry the quotient.
Example 2.3.2: Multi-Digit Subtraction with Borrow Across Zeros in Base 6
Evaluate the subtraction directly within base 6.
Show solution
Step 1: Set up the subtraction column-by-column.
\begin{array}{r@{\quad}c@{\quad}c@{\quad}c@{\quad}c} & 5 & 0 & 0 & 2 \\ - & 2 & 3 & 4 & 5 \\ \hline \end{array}
Step 2: Trace the cascading borrow mechanism.
-
Units column (): We must compute . Since , we must borrow from the left.
-
The columns to the left ( and ) both contain . The borrow must originate from the column (digit ):
-
Digit at column reduces to .
-
The intermediate zero at column becomes .
-
The intermediate zero at column becomes .
-
The units column receives a full radix value , so its effective value becomes .
-
Step 3: Perform subtraction in each column.
-
Units column ():
-
Column 1 ():
-
Column 2 ():
-
Column 3 ():
Assemble the difference:
Verification via Decimal:
-
-
-
Difference
-
. Perfect match!
Takeaway: When borrowing cascades across zeros in base r, each intermediate zero turns into (r - 1) and the target digit gains +r.
Example 2.3.3: Two-Digit Column Multiplication in Base 5
Evaluate the product directly using long multiplication in base 5.
Show solution
Step 1: Set up the long multiplication layout.
\begin{array}{r@{\quad}c@{\quad}c} & 4 & 3 \\ \times & 3 & 4 \\ \hline \end{array}
Step 2: Compute Partial Product 1:
-
Units digit: . In base 5: .
-
Fives digit: . In base 5: .
-
Next place: write carry .
Step 3: Compute Partial Product 2: (shifted left by 1 place)
-
Units digit: . In base 5: .
-
Fives digit: . In base 5: .
-
Next place: write carry .
Step 4: Sum the partial products in base 5:
\begin{array}{r@{\quad}c@{\quad}c@{\quad}c@{\quad}c} & & 3 & 3 & 2 \\ + & 2 & 3 & 4 & 0 \\ \hline \end{array}
-
column:
-
column:
-
column:
-
column:
Assemble the product:
Verification via Decimal:
. .
.
. Exact!
Takeaway: Multiply single digits in base 10, decompose each product into quotient (carry) and remainder (digit) modulo r, and sum partial products in base r.
Example 2.3.4: Base Squaring via Binomial Place-Value Expansion
Calculate the square of directly in base 8 using the algebraic identity .
Show solution
Step 1: Expand into its radix components.
Squaring both sides algebraically:
Step 2: Resolve place-value carries in base 8 from right to left.
-
Units term (): .
-
Eights term (): .
-
Sixty-fours term (): .
-
Five-hundred-twelves term ():
Step 3: Assemble the square in base 8.
Verification via Decimal:
.
.
. Complete verification!
Takeaway: Square two-digit numbers via (ar + b)^2 = a^2 r^2 + 2ab r + b^2, resolving carries base r from right to left.
Example 2.3.5: Error Detection via Digital Roots Modulo $(r - 1)$
A student solves an addition problem in base 9 and claims that . Apply the base-9 digital root test (casting out eights) to determine whether this answer is possible. If false, find the correct sum.
Show solution
Step 1: Understand the theoretical foundation.
In any base , . Therefore, .
For base 9, , so every number is congruent to the sum of its digits modulo 8:
Step 2: Test the student's equation modulo 8.
-
Left Operand 1:
-
Left Operand 2:
-
Sum of Left Sides:
Now check the student's claimed answer:
- Right Side:
Since , the student's claim violates the digital root invariant. The answer is definitely incorrect!
Step 3: Compute the correct sum directly in base 9.
-
column: , carry .
-
column: , carry .
-
column: , carry .
-
column: carry .
The correct sum is .
Verification check: . Congruence holds!
Takeaway: The digital sum modulo (r - 1) is invariant under addition and multiplication; use it to instantly spot erroneous options in CAT.
Example 2.3.6: Long Division and Quotient-Remainder Extraction in Base 5
Find the quotient and remainder when is divided by directly within base 5.
Show solution
Step 1: Set up long division in base 5.
We divide by .
Step 2: Execute division digit-by-digit:
-
Position 1 (leading digit ):
-
Position 2 (bring down ):
The current value is . Since , the quotient digit is , and the remainder is .
-
Position 3 (bring down ):
In base 5, bringing down next to remainder forms the two-digit number :
Divide by :
-
Position 4 (bring down ):
The current value is . Since , the quotient digit is , and the remainder is .
Step 3: State the results in base 5.
Verification via Decimal:
-
-
Divisor
-
-
, remainder .
Both match precisely!
Takeaway: In base division, when bringing down the next digit after remainder R, the new dividend value is R r + digit.
Practice questions
Question 1 · CAT Level
Evaluate the product directly within base . What is the resulting product expressed in base ?
Show answer and explanation
Answer: (B) (1431) 7
Convert factors to decimal: , and .
The product in decimal is .
Convert to base by successive division: (rem 1).
(rem 3), (rem 4), (rem 1).
Reading remainders bottom to top gives .
Question 2 · CAT Level
Perform the subtraction within base . What is the resulting difference in base ?
Show answer and explanation
Answer: (B) (1335) 6
Converting to decimal: .
.
Difference in decimal: .
Converting to base : , , , .
Collecting remainders gives .
Question 3 · CAT Level
When the number is divided by in base , let be the quotient. What is the sum of the digits of ?
Show answer and explanation
Answer: (B) 3
Convert dividend and divisor to decimal: .
.
Dividing by in decimal yields quotient with remainder .
Converting to base : .
The sum of digits of is .
Question 4 · CAT Level
Evaluate the square of in base . What is the value of expressed in octal representation?
Show answer and explanation
Answer: (B) (1511) 8
Convert to decimal: .
Squaring in decimal: .
Convert to octal: (rem 1).
(rem 1), (rem 5), (rem 1).
Reading remainders yields .
Question 5 · CAT Level
If the base arithmetic equation holds true for an unknown integer base , what is the value of ?
Show answer and explanation
Answer: (C) 9
Express all terms in base polynomial form: .
Expanding the left side: .
Rearranging into standard quadratic form: .
Factoring gives .
Since base (as digit 4 appears in the equation), the only valid root is .
Study this concept with interactive practice in PrepSoc.
Open the concept library