Free CAT library

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 8+5=138 + 5 = 13, they are not performing magic. They are doing two distinct operations:

  1. Recognizing that 1313 exceeds the decimal threshold 1010.

  2. Decomposing 13=1×10+313 = 1 \times 10 + 3, writing down 33 and carrying 11 into the tens column.

Similarly, when subtracting 32−1732 - 17, we borrow 11 from the tens place, adding 1010 to the units place to turn 22 into 1212.

We do this reflexively because we have practiced it for thousands of hours. But the number 1010 is not a law of physics—it is merely the overflow threshold of base 10!

In Base 7, the overflow threshold is 77:

  • If a column sum is 1111, we do not write 11 and carry 11. We divide 1111 by 77:

    11=1×7+4  ⟹  write 4, carry 111 = 1 \times 7 + 4 \implies \text{write } 4, \text{ carry } 1

  • If we must borrow from the adjacent column in base 7, that borrowed 11 brings over 77 units, NOT 1010!

Direct base arithmetic means learning to see the radix rr 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:

  1. Direct Multi-Digit Base Operations: Add or subtract two or three numbers given in base 66, base 77, or base 88. Converting all operands to base 10, computing, and converting back to base rr consumes 3×3\times more time and multiplies error risk.

  2. Subtraction with Cascading Borrows Across Zeros: For example, (4002)5−(1344)5(4002)_5 - (1344)_5. Questions are specifically engineered with chains of zero digits to catch students who accidentally borrow 1010 or mishandle intermediate zeroes.

  3. Column Multiplication and Squaring: Evaluating (43)5×(34)5(43)_5 \times (34)_5 or ((75)8)2((75)_8)^2 directly. Exam setters test whether students can manage carries generated during partial cross-products in base rr.

  4. Alphametic / Cryptarithmetic Puzzles: Letter equations where operations obey base-rr addition rules, requiring column-by-column modular deduction.


3. Core Concepts, Formulae & Derivations

A. Column Addition in Radix rr

For any column with digit inputs aa, bb, and incoming carry cinc_{\text{in}}:

  1. Compute the raw sum in ordinary integers:

    S=a+b+cinS = a + b + c_{\text{in}}

  2. Decompose SS via Euclidean division by rr:

    cout=⌊S/r⌋(carry to next column)c_{\text{out}} = \lfloor S / r \rfloor \quad (\text{carry to next column})

    d=S(modr)(digit written in current column)d = S \pmod r \quad (\text{digit written in current column})

If S<rS < r, carry is 00. If r≤S<2rr \le S < 2r, carry is 11. If 2r≤S<3r2r \le S < 3r, carry is 22.

B. Column Subtraction and the Base-rr Borrow Rule

To subtract bb from aa with incoming borrow borrowin\text{borrow}_{\text{in}}:

  • If (a−borrowin)≥b(a - \text{borrow}_{\text{in}}) \ge b, no borrow is required:

    d=(a−borrowin)−b,borrowout=0d = (a - \text{borrow}_{\text{in}}) - b, \quad \text{borrow}_{\text{out}} = 0

  • If (a−borrowin)<b(a - \text{borrow}_{\text{in}}) < b, we must borrow 11 from the next higher non-zero column. Borrowing 11 adds exactly rr to the current column:

    d=(a−borrowin+r)−b,borrowout=1d = (a - \text{borrow}_{\text{in}} + r) - b, \quad \text{borrow}_{\text{out}} = 1

C. Borrowing Across Zeros in Radix rr

When borrowing across a column containing digit 00:

  1. The borrow travels leftward until it finds the first non-zero digit, decreasing it by 11.

  2. Every intermediate zero that is passed over turns into (r−1)(r - 1).

  3. The destination column receives the full radix value +r+r.

(This is identical to decimal, where borrowing across 00 turns it into 9=10−19 = 10 - 1. In base rr, the intermediate zero becomes r−1r - 1!)

D. Column Multiplication in Radix rr

To multiply a multi-digit number by a single digit mm in base rr:

For each digit aa and incoming carry cinc_{\text{in}}:

P=a×m+cinP = a \times m + c_{\text{in}}

cout=⌊P/r⌋,d=P(modr)c_{\text{out}} = \lfloor P / r \rfloor, \quad d = P \pmod r

When multiplying multi-digit numbers, generate partial products, shift each subsequent row leftward by appending zeros, and sum the partial products using base-rr column addition.

E. The Digital Root Check Modulo (r−1)(r - 1)

In base 10, "casting out nines" works because 10≡1(mod9)10 \equiv 1 \pmod 9.

In any base rr, since r≡1(modr−1)r \equiv 1 \pmod{r - 1}, the digital sum modulo (r−1)(r - 1) is an arithmetic invariant:

(N)r≡∑ai(modr−1)(N)_r \equiv \sum a_i \pmod{r - 1}

This provides an instant checksum to verify additions and multiplications in base rr.


4. Common Pitfalls & Speed Shortcuts

[!CAUTION]

The Phantom Decimal Borrow Trap:

The most insidious error in base subtraction is instinctively adding 1010 instead of the base rr when borrowing!

  • In base 66, if you have 22 and borrow from the next column, your new value is 2+6=82 + 6 = \mathbf{8}, NOT 1212!
  • If you must subtract 55, the result is 8−5=38 - 5 = \mathbf{3}.

[!WARNING]

The Multi-Unit Carry Trap:

In base 10, adding two digits produces a carry of at most 11 (9+9=189 + 9 = 18). But when adding THREE numbers in a small base like base 4, digits 3+3+3=93 + 3 + 3 = 9.

In base 4: 9=2×4+1  ⟹  carry is 29 = 2 \times 4 + 1 \implies \text{carry is } \mathbf{2}, not 11! Always divide by rr explicitly.

[!TIP]

The Base Squaring Expansion:

To square a two-digit number (ab)r(ab)_r directly:

((ab)r)2=(a⋅r+b)2=a2r2+2ab⋅r+b2((ab)_r)^2 = (a \cdot r + b)^2 = a^2 r^2 + 2ab \cdot r + b^2

Compute the terms b2b^2, 2ab2ab, and a2a^2, convert each to base rr, and ripple carries leftward. It is twice as fast as long multiplication!

Formulas

Base-r Addition Carry & Digit

S=a+b+cin  ⟹  cout=⌊S/r⌋,  d=S(modr)S = a + b + c_{\text{in}} \implies c_{\text{out}} = \lfloor S/r \rfloor, \; d = S \pmod r

Decomposes column sum into overflow carry and result digit in base r
Base-r Subtraction Borrow Rule

d=(a+r−borrowin)−b(when a<b)d = (a + r - \text{borrow}_{\text{in}}) - b \quad (\text{when } a < b)

Borrowing 1 unit from the adjacent place adds exactly r to current place
Borrow Across Zero Invariant

(…100…0)r−1=(…0(r−1)(r−1)…(r−1)⏟k times)r(\dots 100\dots0)_r - 1 = (\dots 0 \underbrace{(r-1)(r-1)\dots(r-1)}_{k \text{ times}})_r

Intermediate zeros become (r-1) when a borrow cascades across them
Digital Root Check Modulo (r-1)

(N)r≡∑i=0nai(modr−1)(N)_r \equiv \sum_{i=0}^n a_i \pmod{r - 1}

Invariance check generalizing 'casting out nines' to any radix r

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 (564)7+(455)7+(346)7(564)_7 + (455)_7 + (346)_7 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, 707^0):

Sum=4+5+6=15\text{Sum} = 4 + 5 + 6 = 15

Divide by radix r=7r = 7:

15=2×7+115 = 2 \times 7 + 1

  ⟹  Digit d0=1,Carry c1=2\implies \text{Digit } d_0 = 1, \quad \text{Carry } c_1 = 2

Step 3: Add Column 1 (Sevens place, 717^1):

Sum=6+5+4+carry 2=17\text{Sum} = 6 + 5 + 4 + \text{carry } 2 = 17

Divide by radix r=7r = 7:

17=2×7+317 = 2 \times 7 + 3

  ⟹  Digit d1=3,Carry c2=2\implies \text{Digit } d_1 = 3, \quad \text{Carry } c_2 = 2

Step 4: Add Column 2 (Forty-nines place, 727^2):

Sum=5+4+3+carry 2=14\text{Sum} = 5 + 4 + 3 + \text{carry } 2 = 14

Divide by radix r=7r = 7:

14=2×7+014 = 2 \times 7 + 0

  ⟹  Digit d2=0,Carry c3=2\implies \text{Digit } d_2 = 0, \quad \text{Carry } c_3 = 2

Step 5: Write the highest place carry:

d3=2d_3 = 2

Assemble the digits:

(564)7+(455)7+(346)7=(2031)7(564)_7 + (455)_7 + (346)_7 = (2031)_7

Verification via Decimal:

  • (564)7=5(49)+6(7)+4=245+42+4=291(564)_7 = 5(49) + 6(7) + 4 = 245 + 42 + 4 = 291

  • (455)7=4(49)+5(7)+5=196+35+5=236(455)_7 = 4(49) + 5(7) + 5 = 196 + 35 + 5 = 236

  • (346)7=3(49)+4(7)+6=147+28+6=181(346)_7 = 3(49) + 4(7) + 6 = 147 + 28 + 6 = 181

  • Sum =291+236+181=70810= 291 + 236 + 181 = 708_{10}

  • (2031)7=2(343)+0(49)+3(7)+1=686+21+1=70810(2031)_7 = 2(343) + 0(49) + 3(7) + 1 = 686 + 21 + 1 = 708_{10}. 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 (5002)6−(2345)6(5002)_6 - (2345)_6 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 (606^0): We must compute 2−52 - 5. Since 2<52 < 5, we must borrow from the left.

  • The columns to the left (616^1 and 626^2) both contain 00. The borrow must originate from the 636^3 column (digit 55):

    • Digit 55 at column 636^3 reduces to 44.

    • The intermediate zero at column 626^2 becomes r−1=6−1=5r - 1 = 6 - 1 = \mathbf{5}.

    • The intermediate zero at column 616^1 becomes r−1=6−1=5r - 1 = 6 - 1 = \mathbf{5}.

    • The units column receives a full radix value +6+6, so its effective value becomes 2+6=82 + 6 = \mathbf{8}.

Step 3: Perform subtraction in each column.

  • Units column (606^0): 8−5=38 - 5 = \mathbf{3}

  • Column 1 (616^1): 5−4=15 - 4 = \mathbf{1}

  • Column 2 (626^2): 5−3=25 - 3 = \mathbf{2}

  • Column 3 (636^3): 4−2=24 - 2 = \mathbf{2}

Assemble the difference:

(5002)6−(2345)6=(2213)6(5002)_6 - (2345)_6 = (2213)_6

Verification via Decimal:

  • (5002)6=5(216)+2=1,080+2=1,082(5002)_6 = 5(216) + 2 = 1,080 + 2 = 1,082

  • (2345)6=2(216)+3(36)+4(6)+5=432+108+24+5=569(2345)_6 = 2(216) + 3(36) + 4(6) + 5 = 432 + 108 + 24 + 5 = 569

  • Difference =1,082−569=51310= 1,082 - 569 = 513_{10}

  • (2213)6=2(216)+2(36)+1(6)+3=432+72+6+3=51310(2213)_6 = 2(216) + 2(36) + 1(6) + 3 = 432 + 72 + 6 + 3 = 513_{10}. 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 (43)5×(34)5(43)_5 \times (34)_5 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: (43)5×45(43)_5 \times 4_5

  • Units digit: 3×4=12103 \times 4 = 12_{10}. In base 5: 12=2×5+2  ⟹  write 2, carry 212 = 2 \times 5 + 2 \implies \text{write } 2, \text{ carry } 2.

  • Fives digit: 4×4+carry 2=16+2=18104 \times 4 + \text{carry } 2 = 16 + 2 = 18_{10}. In base 5: 18=3×5+3  ⟹  write 3, carry 318 = 3 \times 5 + 3 \implies \text{write } 3, \text{ carry } 3.

  • Next place: write carry 33.

Partial Product 1=(332)5\text{Partial Product 1} = (332)_5

Step 3: Compute Partial Product 2: (43)5×35(43)_5 \times 3_5 (shifted left by 1 place)

  • Units digit: 3×3=9103 \times 3 = 9_{10}. In base 5: 9=1×5+4  ⟹  write 4, carry 19 = 1 \times 5 + 4 \implies \text{write } 4, \text{ carry } 1.

  • Fives digit: 4×3+carry 1=12+1=13104 \times 3 + \text{carry } 1 = 12 + 1 = 13_{10}. In base 5: 13=2×5+3  ⟹  write 3, carry 213 = 2 \times 5 + 3 \implies \text{write } 3, \text{ carry } 2.

  • Next place: write carry 22.

Partial Product 2=(2340)5\text{Partial Product 2} = (2340)_5

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}

  • 505^0 column: 2+0=22 + 0 = 2

  • 515^1 column: 3+4=7=1×5+2  ⟹  write 2, carry 13 + 4 = 7 = 1 \times 5 + 2 \implies \text{write } 2, \text{ carry } 1

  • 525^2 column: 3+3+carry 1=7=1×5+2  ⟹  write 2, carry 13 + 3 + \text{carry } 1 = 7 = 1 \times 5 + 2 \implies \text{write } 2, \text{ carry } 1

  • 535^3 column: 2+carry 1=32 + \text{carry } 1 = 3

Assemble the product:

(43)5×(34)5=(3222)5(43)_5 \times (34)_5 = (3222)_5

Verification via Decimal:

(43)5=4(5)+3=2310(43)_5 = 4(5) + 3 = 23_{10}. (34)5=3(5)+4=1910(34)_5 = 3(5) + 4 = 19_{10}.

23×19=4371023 \times 19 = 437_{10}.

(3222)5=3(125)+2(25)+2(5)+2=375+50+10+2=43710(3222)_5 = 3(125) + 2(25) + 2(5) + 2 = 375 + 50 + 10 + 2 = 437_{10}. 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 (75)8(75)_8 directly in base 8 using the algebraic identity ((ab)r)2=a2r2+2ab⋅r+b2((ab)_r)^2 = a^2 r^2 + 2ab \cdot r + b^2.

Show solution

Step 1: Expand (75)8(75)_8 into its radix components.

(75)8=7⋅8+5(75)_8 = 7 \cdot 8 + 5

Squaring both sides algebraically:

((75)8)2=(7⋅8+5)2=72⋅82+2(7)(5)⋅8+52((75)_8)^2 = (7 \cdot 8 + 5)^2 = 7^2 \cdot 8^2 + 2(7)(5) \cdot 8 + 5^2

=49⋅82+70⋅8+25= 49 \cdot 8^2 + 70 \cdot 8 + 25

Step 2: Resolve place-value carries in base 8 from right to left.

  • Units term (808^0): 251025_{10}.

    25=3×8+125 = 3 \times 8 + 1

      ⟹  Units digit d0=1,Carry to 81=3\implies \text{Units digit } d_0 = 1, \quad \text{Carry to } 8^1 = 3

  • Eights term (818^1): 70+carry 3=731070 + \text{carry } 3 = 73_{10}.

    73=9×8+173 = 9 \times 8 + 1

      ⟹  Eights digit d1=1,Carry to 82=9\implies \text{Eights digit } d_1 = 1, \quad \text{Carry to } 8^2 = 9

  • Sixty-fours term (828^2): 49+carry 9=581049 + \text{carry } 9 = 58_{10}.

    58=7×8+258 = 7 \times 8 + 2

      ⟹  Sixty-fours digit d2=2,Carry to 83=7\implies \text{Sixty-fours digit } d_2 = 2, \quad \text{Carry to } 8^3 = 7

  • Five-hundred-twelves term (838^3):

    d3=7d_3 = 7

Step 3: Assemble the square in base 8.

((75)8)2=(7211)8((75)_8)^2 = (7211)_8

Verification via Decimal:

(75)8=7(8)+5=6110(75)_8 = 7(8) + 5 = 61_{10}.

612=3,7211061^2 = 3,721_{10}.

(7211)8=7(512)+2(64)+1(8)+1=3,584+128+8+1=3,72110(7211)_8 = 7(512) + 2(64) + 1(8) + 1 = 3,584 + 128 + 8 + 1 = 3,721_{10}. 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 (745)9+(683)9=(1540)9(745)_9 + (683)_9 = (1540)_9. 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 rr, r≡1(modr−1)r \equiv 1 \pmod{r - 1}. Therefore, rk≡1k≡1(modr−1)r^k \equiv 1^k \equiv 1 \pmod{r - 1}.

For base 9, r−1=8r - 1 = 8, so every number is congruent to the sum of its digits modulo 8:

(N)9≡∑ai(mod8)(N)_9 \equiv \sum a_i \pmod 8

Step 2: Test the student's equation modulo 8.

  • Left Operand 1: (745)9  ⟹  7+4+5=16≡0(mod8)(745)_9 \implies 7 + 4 + 5 = 16 \equiv 0 \pmod 8

  • Left Operand 2: (683)9  ⟹  6+8+3=17≡1(mod8)(683)_9 \implies 6 + 8 + 3 = 17 \equiv 1 \pmod 8

  • Sum of Left Sides: 0+1≡1(mod8)0 + 1 \equiv \mathbf{1 \pmod 8}

Now check the student's claimed answer:

  • Right Side: (1540)9  ⟹  1+5+4+0=10≡2(mod8)(1540)_9 \implies 1 + 5 + 4 + 0 = 10 \equiv \mathbf{2 \pmod 8}

Since 1≢2(mod8)1 \not\equiv 2 \pmod 8, the student's claim violates the digital root invariant. The answer is definitely incorrect!

Step 3: Compute the correct sum directly in base 9.

  • 909^0 column: 5+3=8<9  ⟹  digit 85 + 3 = 8 < 9 \implies \text{digit } 8, carry 00.

  • 919^1 column: 4+8=12=1×9+3  ⟹  digit 34 + 8 = 12 = 1 \times 9 + 3 \implies \text{digit } 3, carry 11.

  • 929^2 column: 7+6+carry 1=14=1×9+5  ⟹  digit 57 + 6 + \text{carry } 1 = 14 = 1 \times 9 + 5 \implies \text{digit } 5, carry 11.

  • 939^3 column: carry 11.

The correct sum is (1538)9(1538)_9.

Verification check: 1+5+3+8=17≡1(mod8)1 + 5 + 3 + 8 = 17 \equiv 1 \pmod 8. 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 (4312)5(4312)_5 is divided by (4)5(4)_5 directly within base 5.

Show solution

Step 1: Set up long division in base 5.

We divide (4312)5(4312)_5 by 454_5.

Step 2: Execute division digit-by-digit:

  • Position 1 (leading digit 44):

    4÷4=1,remainder 04 \div 4 = 1, \quad \text{remainder } 0

    Quotient digit q3=1\text{Quotient digit } q_3 = 1

  • Position 2 (bring down 33):

    The current value is 33. Since 3<43 < 4, the quotient digit is 00, and the remainder is 33.

    Quotient digit q2=0,remainder 3\text{Quotient digit } q_2 = 0, \quad \text{remainder } 3

  • Position 3 (bring down 11):

    In base 5, bringing down 11 next to remainder 33 forms the two-digit number (31)5(31)_5:

    (31)5=3×5+1=1610(31)_5 = 3 \times 5 + 1 = 16_{10}

    Divide 161016_{10} by 44:

    16÷4=4,remainder 016 \div 4 = 4, \quad \text{remainder } 0

    Quotient digit q1=4,remainder 0\text{Quotient digit } q_1 = 4, \quad \text{remainder } 0

  • Position 4 (bring down 22):

    The current value is 22. Since 2<42 < 4, the quotient digit is 00, and the remainder is 22.

    Quotient digit q0=0,remainder 2\text{Quotient digit } q_0 = 0, \quad \text{remainder } 2

Step 3: State the results in base 5.

Quotient=(1040)5,Remainder=(2)5\text{Quotient} = (1040)_5, \quad \text{Remainder} = (2)_5

Verification via Decimal:

  • (4312)5=4(125)+3(25)+1(5)+2=500+75+5+2=58210(4312)_5 = 4(125) + 3(25) + 1(5) + 2 = 500 + 75 + 5 + 2 = 582_{10}

  • Divisor =4= 4

  • 582=145×4+2582 = 145 \times 4 + 2

  • (1040)5=1(125)+0(25)+4(5)+0=125+20=14510(1040)_5 = 1(125) + 0(25) + 4(5) + 0 = 125 + 20 = 145_{10}, remainder =2= 2.

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 (45)7×(23)7(45)_7 \times (23)_7 directly within base 77. What is the resulting product expressed in base 77?

  1. A

    (1421)7(1421)_7

  2. B

    (1431)7(1431)_7

  3. C

    (1441)7(1441)_7

  4. D

    (1531)7(1531)_7

Show answer and explanation

Answer: (B) (1431) 7

Convert factors to decimal: (45)7=4×7+5=3310(45)_7 = 4 \times 7 + 5 = 33_{10}, and (23)7=2×7+3=1710(23)_7 = 2 \times 7 + 3 = 17_{10}.

The product in decimal is 33×17=5611033 \times 17 = 561_{10}.

Convert 56110561_{10} to base 77 by successive division: 561=7×80+1561 = 7 \times 80 + 1 (rem 1).

80=7×11+380 = 7 \times 11 + 3 (rem 3), 11=7×1+411 = 7 \times 1 + 4 (rem 4), 1=7×0+11 = 7 \times 0 + 1 (rem 1).

Reading remainders bottom to top gives (1431)7(1431)_7.

Question 2 · CAT Level

Perform the subtraction (5214)6−(3435)6(5214)_6 - (3435)_6 within base 66. What is the resulting difference in base 66?

  1. A

    (1325)6(1325)_6

  2. B

    (1335)6(1335)_6

  3. C

    (1345)6(1345)_6

  4. D

    (1435)6(1435)_6

Show answer and explanation

Answer: (B) (1335) 6

Converting to decimal: (5214)6=5(216)+2(36)+1(6)+4=1080+72+6+4=116210(5214)_6 = 5(216) + 2(36) + 1(6) + 4 = 1080 + 72 + 6 + 4 = 1162_{10}.

(3435)6=3(216)+4(36)+3(6)+5=648+144+18+5=81510(3435)_6 = 3(216) + 4(36) + 3(6) + 5 = 648 + 144 + 18 + 5 = 815_{10}.

Difference in decimal: 1162−815=347101162 - 815 = 347_{10}.

Converting 347347 to base 66: 347=6×57+5347 = 6 \times 57 + 5, 57=6×9+357 = 6 \times 9 + 3, 9=6×1+39 = 6 \times 1 + 3, 1=6×0+11 = 6 \times 0 + 1.

Collecting remainders gives (1335)6(1335)_6.

Question 3 · CAT Level

When the number (3021)4(3021)_4 is divided by (23)4(23)_4 in base 44, let (Q)4(Q)_4 be the quotient. What is the sum of the digits of (Q)4(Q)_4?

  1. A

    22

  2. B

    33

  3. C

    44

  4. D

    55

Show answer and explanation

Answer: (B) 3

Convert dividend and divisor to decimal: (3021)4=3(64)+0(16)+2(4)+1=192+8+1=20110(3021)_4 = 3(64) + 0(16) + 2(4) + 1 = 192 + 8 + 1 = 201_{10}.

(23)4=2(4)+3=1110(23)_4 = 2(4) + 3 = 11_{10}.

Dividing 201201 by 1111 in decimal yields quotient Q=18Q = 18 with remainder 33.

Converting Q=1810Q = 18_{10} to base 44: 18=4×4+2=(102)418 = 4 \times 4 + 2 = (102)_4.

The sum of digits of (Q)4(Q)_4 is 1+0+2=31 + 0 + 2 = 3.

Question 4 · CAT Level

Evaluate the square of (35)8(35)_8 in base 88. What is the value of (35)82(35)_8^2 expressed in octal representation?

  1. A

    (1411)8(1411)_8

  2. B

    (1511)8(1511)_8

  3. C

    (1521)8(1521)_8

  4. D

    (1611)8(1611)_8

Show answer and explanation

Answer: (B) (1511) 8

Convert (35)8(35)_8 to decimal: 3(8)+5=29103(8) + 5 = 29_{10}.

Squaring in decimal: 292=8411029^2 = 841_{10}.

Convert 841841 to octal: 841=8×105+1841 = 8 \times 105 + 1 (rem 1).

105=8×13+1105 = 8 \times 13 + 1 (rem 1), 13=8×1+513 = 8 \times 1 + 5 (rem 5), 1=8×0+11 = 8 \times 0 + 1 (rem 1).

Reading remainders yields (1511)8(1511)_8.

Question 5 · CAT Level

If the base arithmetic equation (23)b×(4)b=(103)b(23)_b \times (4)_b = (103)_b holds true for an unknown integer base bb, what is the value of bb?

  1. A

    77

  2. B

    88

  3. C

    99

  4. D

    1111

Show answer and explanation

Answer: (C) 9

Express all terms in base bb polynomial form: (2b+3)×4=b2+0⋅b+3(2b + 3) \times 4 = b^2 + 0 \cdot b + 3.

Expanding the left side: 8b+12=b2+38b + 12 = b^2 + 3.

Rearranging into standard quadratic form: b2−8b−9=0b^2 - 8b - 9 = 0.

Factoring gives (b−9)(b+1)=0(b - 9)(b + 1) = 0.

Since base b>4b > 4 (as digit 4 appears in the equation), the only valid root is b=9b = 9.

Study this concept with interactive practice in PrepSoc.

Open the concept library