Free CAT library

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 3,8883,888 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 rr and the symbol zero (00).

Imagine a mechanical odometer inside a vehicle:

  • Each wheel has rr distinct engraved symbols: {0,1,2,…,r−1}\{0, 1, 2, \dots, r-1\}.

  • When the rightmost wheel completes one full turn past r−1r-1, it rolls back to 00 and kicks the next wheel to its left forward by 11.

  • That single click on the second wheel represents a batch of r1r^1 units.

  • The third wheel represents batches of r2r^2, the fourth r3r^3, and so forth.

Whether r=10r = 10 (decimal), r=2r = 2 (binary switches in a microprocessor), r=8r = 8 (octal memory blocks), or r=16r = 16 (hexadecimal byte addressing), the mathematical engine under the hood is identical: every digit aia_i scales by rir^i 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:

  1. The Alien / Ancient Script Cryptarithm: An alien culture or futuristic AI reports an equation like (43)r+(35)r=(111)r(43)_r + (35)_r = (111)_r. You must recognize the polynomial expansion and solve for the unknown base rr.

  2. The Radix Bridge (Arbitrary Base to Arbitrary Base): Converting directly from (N)r1(N)_{r_1} to (N)r2(N)_{r_2} (e.g., from base 77 to base 55). Because students cannot multiply in non-decimal bases easily, they must use base 10 as the universal intermediate clearinghouse: (N)r1→evaluate(N)10→successive division(N)r2(N)_{r_1} \xrightarrow{\text{evaluate}} (N)_{10} \xrightarrow{\text{successive division}} (N)_{r_2}.

  3. The Radix Fraction Periodicity Trap: A fraction that terminates cleanly in decimal (like 0.2=150.2 = \frac{1}{5}) may become an infinitely recurring periodic fraction in binary or base 3, because the denominator shares no common factors with the radix.

  4. The Digit Validity Trap: A question gives (384)r(384)_r and asks for roots of a quadratic in rr. One algebraic root might be r=6r = 6. A hasty student marks it, forgetting that a base-66 number can never contain the digit 88!


3. Core Concepts, Formulae & Derivations

A. Formal Definition of a Radix-rr Positional System

Let r∈Zr \in \mathbb{Z} with r>1r > 1 be the radix (or base).

The allowable alphabet of digits Σr\Sigma_r consists of exactly rr distinct symbols:

Σr={0,1,2,…,r−1}\Sigma_r = \{0, 1, 2, \dots, r-1\}

For bases greater than 10, conventional alphanumeric symbols represent values ≥10\ge 10:

A=10,B=11,C=12,D=13,E=14,F=15,…A = 10, \quad B = 11, \quad C = 12, \quad D = 13, \quad E = 14, \quad F = 15, \quad \dots

B. The Fundamental Radix Expansion Identity

Any real number NN represented as (anan−1…a1a0.b1b2…bm)r(a_n a_{n-1} \dots a_1 a_0 . b_1 b_2 \dots b_m)_r expands into the convergent polynomial:

N=∑i=0nairi+∑j=1mbjr−jN = \sum_{i=0}^n a_i r^i + \sum_{j=1}^m b_j r^{-j}

N=anrn+an−1rn−1+⋯+a1r+a0+b1r+b2r2+⋯+bmrmN = a_n r^n + a_{n-1} r^{n-1} + \dots + a_1 r + a_0 + \frac{b_1}{r} + \frac{b_2}{r^2} + \dots + \frac{b_m}{r^m}

C. Horner's Nested Synthetic Scheme (Fast Base r→10r \to 10)

Calculating high powers r4,r5r^4, r^5 induces arithmetic mistakes under exam pressure. Horner's Rule reformulates the polynomial nestedly:

(a3a2a1a0)r=((a3⋅r+a2)⋅r+a1)⋅r+a0(a_3 a_2 a_1 a_0)_r = ((a_3 \cdot r + a_2) \cdot r + a_1) \cdot r + a_0

Algorithm: Start with ana_n. At each step, multiply the running total by rr and add the next digit. It requires only nn multiplications and zero power calculations.

D. Converting Decimal 10→10 \to Base rr

  • Integer Part (Successive Division):

    Divide the decimal integer by rr. Record the integer quotient and remainder. Repeat on the quotient until the quotient is 00.

    N=q0r+a0(0≤a0<r)N = q_0 r + a_0 \quad (0 \le a_0 < r)

    q0=q1r+a1(0≤a1<r)q_0 = q_1 r + a_1 \quad (0 \le a_1 < r)

    …\dots

    The first remainder generated is the least significant digit (a0a_0). The final remainder generated is the most significant digit (ana_n).

    (N)r=(anan−1…a1a0)r(Read remainders from bottom to top)\mathbf{(N)_r = (a_n a_{n-1} \dots a_1 a_0)_r \quad \text{(Read remainders from bottom to top)}}

  • Fractional Part (Successive Multiplication):

    Multiply the decimal fractional part by rr. The integer part of the product becomes the next fractional digit (b1b_1). Take the remaining fractional part and multiply by rr again to obtain b2b_2, and so forth.

    (0.F)r=(0.b1b2b3… )r(Read integer parts from top to bottom)\mathbf{(0.F)_r = (0. b_1 b_2 b_3 \dots)_r \quad \text{(Read integer parts from top to bottom)}}

E. Fraction Termination Criterion in Radix rr

A fully reduced rational fraction pq\frac{p}{q} (where gcd⁡(p,q)=1\gcd(p, q) = 1) terminates in base rr with finite fractional digits if and only if every prime factor of qq is also a prime factor of the base rr.

If q=p1e1p2e2…pkek, then pq terminates in base r  ⟺  ∀i,  pi∣r\text{If } q = p_1^{e_1} p_2^{e_2} \dots p_k^{e_k}, \text{ then } \frac{p}{q} \text{ terminates in base } r \iff \forall i, \; p_i \mid r


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 N(modr)N \pmod r, which is the UNITS digit a0a_0. 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 (x72)b(x 7 2)_b, write down b≥8b \ge 8 immediately before doing ANY algebra. If your quadratic equation yields roots b=5b = 5 and b=9b = 9, the root b=5b = 5 must be discarded immediately because digit 77 cannot exist in base 55.

[!TIP]

Horner's Speed Shortcut:

To convert (3542)6(3542)_6 to base 10 in 15 seconds:

  • 3×6+5=233 \times 6 + 5 = 23
  • 23×6+4=138+4=14223 \times 6 + 4 = 138 + 4 = 142
  • 142×6+2=852+2=854142 \times 6 + 2 = 852 + 2 = 854

Value =85410= 854_{10}. No computing 63=2166^3 = 216 or 62=366^2 = 36!

Formulas

Polynomial Radix Expansion

(an…a0.b1…bm)r=∑i=0nairi+∑j=1mbjr−j(a_n \dots a_0 . b_1 \dots b_m)_r = \sum_{i=0}^n a_i r^i + \sum_{j=1}^m b_j r^{-j}

Fundamental definition relating positional digits to real numbers
Horner's Nested Evaluation Rule

(a3a2a1a0)r=((a3r+a2)r+a1)r+a0(a_3 a_2 a_1 a_0)_r = ((a_3 r + a_2) r + a_1) r + a_0

Evaluates base r to base 10 using only n sequential multiplications
Digit Validity Inequality

0≤ai<r  ⟹  r>max⁡(ai)0 \le a_i < r \quad \implies \quad r > \max(a_i)

Every digit in radix r must be strictly smaller than the base
Radix Fraction Termination Condition

pq terminates in base r  ⟺  rad(q)∣r\frac{p}{q} \text{ terminates in base } r \iff \text{rad}(q) \mid r

All prime factors of reduced denominator q must divide radix r

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 77 as (5423)7(5423)_7 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

Value=5⋅73+4⋅72+2⋅71+3⋅70\text{Value} = 5 \cdot 7^3 + 4 \cdot 7^2 + 2 \cdot 7^1 + 3 \cdot 7^0

Evaluate the powers of 77:

71=7,72=49,73=3437^1 = 7, \quad 7^2 = 49, \quad 7^3 = 343

Multiply by corresponding place digits:

5×343=1,7155 \times 343 = 1,715

4×49=1964 \times 49 = 196

2×7=142 \times 7 = 14

3×1=33 \times 1 = 3

Sum the components:

Value=1,715+196+14+3=1,92810\text{Value} = 1,715 + 196 + 14 + 3 = 1,928_{10}

Method 2: Horner's Nested Synthetic Scheme

Factor r=7r = 7 nestedly:

Value=((5×7+4)×7+2)×7+3\text{Value} = ((5 \times 7 + 4) \times 7 + 2) \times 7 + 3

Execute step-by-step from inside out:

  • Step 1: 5×7+4=35+4=395 \times 7 + 4 = 35 + 4 = 39

  • Step 2: 39×7+2=273+2=27539 \times 7 + 2 = 273 + 2 = 275

  • Step 3: 275×7+3=1,925+3=1,928275 \times 7 + 3 = 1,925 + 3 = 1,928

Both methods yield precisely 1,928101,928_{10}.

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 N=2,549N = 2,549 bytes into base 66 notation. Determine the exact representation (N)6(N)_6.

Show solution

Step 1: Perform successive division by base r=6r = 6.

Divide repeatedly by 66 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 A=10A = 10 and B=11B = 11), an artifact tag is labeled (3B5)12(3B5)_{12}. Transcribe this tag into octal (base 8) notation.

Show solution

Step 1: Convert (3B5)12(3B5)_{12} to decimal (base 10).

Substitute B=11B = 11 into the base-12 polynomial:

Decimal Value=3⋅122+11⋅121+5⋅120\text{Decimal Value} = 3 \cdot 12^2 + 11 \cdot 12^1 + 5 \cdot 12^0

=3(144)+11(12)+5= 3(144) + 11(12) + 5

=432+132+5=56910= 432 + 132 + 5 = 569_{10}

Step 2: Convert 56910569_{10} 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 (0.6875)10(0.6875)_{10}. 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 22 and harvest the integer parts top-down:

  • Iteration 1: 0.6875×2=1.375  ⟹  integer digit b1=10.6875 \times 2 = 1.375 \implies \text{integer digit } b_1 = 1, fractional part =0.375= 0.375

  • Iteration 2: 0.375×2=0.75  ⟹  integer digit b2=00.375 \times 2 = 0.75 \implies \text{integer digit } b_2 = 0, fractional part =0.75= 0.75

  • Iteration 3: 0.75×2=1.50  ⟹  integer digit b3=10.75 \times 2 = 1.50 \implies \text{integer digit } b_3 = 1, fractional part =0.50= 0.50

  • Iteration 4: 0.50×2=1.00  ⟹  integer digit b4=10.50 \times 2 = 1.00 \implies \text{integer digit } b_4 = 1, fractional part =0.00= 0.00

The fractional part has reached 00. Reading integer digits top-to-bottom:

(0.6875)10=(0.1011)2(0.6875)_{10} = (0.1011)_2

Verification:

121+022+123+124=12+18+116=8+2+116=1116=0.6875\frac{1}{2^1} + \frac{0}{2^2} + \frac{1}{2^3} + \frac{1}{2^4} = \frac{1}{2} + \frac{1}{8} + \frac{1}{16} = \frac{8 + 2 + 1}{16} = \frac{11}{16} = 0.6875

Part (b): Quaternary (Base 4) Conversion

Multiply successive fractional parts by 44:

  • Iteration 1: 0.6875×4=2.75  ⟹  integer digit c1=20.6875 \times 4 = 2.75 \implies \text{integer digit } c_1 = 2, fractional part =0.75= 0.75

  • Iteration 2: 0.75×4=3.00  ⟹  integer digit c2=30.75 \times 4 = 3.00 \implies \text{integer digit } c_2 = 3, fractional part =0.00= 0.00

Reading top-to-bottom:

(0.6875)10=(0.23)4(0.6875)_{10} = (0.23)_4

(Notice also: (0.1011)2(0.1011)_2 pairs bits (10)2=2(10)_2 = 2 and (11)2=3(11)_2 = 3, directly yielding (0.23)4(0.23)_4!)

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 (0.4)10=25(0.4)_{10} = \frac{2}{5} 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 25\frac{2}{5}. The prime factors of the denominator q=5q = 5 do not divide the radix r=3r = 3. Hence, this fraction cannot terminate in base 3; it must recur periodically.

Step 2: Execute successive multiplication by 3.

  • Iteration 1: 0.4×3=1.2  ⟹  digit 10.4 \times 3 = 1.2 \implies \text{digit } 1, fractional part =0.2= 0.2

  • Iteration 2: 0.2×3=0.6  ⟹  digit 00.2 \times 3 = 0.6 \implies \text{digit } 0, fractional part =0.6= 0.6

  • Iteration 3: 0.6×3=1.8  ⟹  digit 10.6 \times 3 = 1.8 \implies \text{digit } 1, fractional part =0.8= 0.8

  • Iteration 4: 0.8×3=2.4  ⟹  digit 20.8 \times 3 = 2.4 \implies \text{digit } 2, fractional part =0.4= 0.4

Notice that the fractional part has returned to 0.40.4, which was our starting value! The sequence of fractional parts is (0.4→0.2→0.6→0.8→0.4)(0.4 \to 0.2 \to 0.6 \to 0.8 \to 0.4).

Step 3: State the recurring representation.

(0.4)10=(0.101210121012… )3=(0.1012‾)3(0.4)_{10} = (0.101210121012\dots)_3 = (0.\overline{1012})_3

The repeating block is 10121012, which has period length L=4L = 4.

Step 4: Find the 50th digit.

Divide the target position by the period length:

50=4×12+2  ⟹  50≡2(mod4)50 = 4 \times 12 + 2 \implies 50 \equiv 2 \pmod 4

The 50th digit corresponds to the 2nd digit of the recurring block 1012, which is 0\mathbf{0}.

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 bb, the following addition is recorded: (3A4)b+(271)b=(655)b(3A4)_b + (271)_b = (655)_b, where the symbol AA denotes the numeric value 1010. Determine the unique value of the radix bb.

Show solution

Step 1: Formulate the strict digit validity lower bound.

Examine all symbols appearing in the problem statement:

Digits present: 3,A(=10),4,2,7,1,6,53, A(=10), 4, 2, 7, 1, 6, 5.

Because digit A=10A = 10 appears, the base bb must be strictly greater than 1010:

b≥11b \ge 11

Any mathematical root ≤10\le 10 must be rejected.

Step 2: Expand each term into its algebraic polynomial in bb.

(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 FF be the repeating radix fraction (0.23‾)5(0.\overline{23})_5. When represented as a repeating fraction in base 77, FF can be expressed as (0.ab‾)7(0.\overline{ab})_7, where aa and bb are distinct base-77 digits. Find the value of a2+b2a^2 + b^2.

  1. A

    2929

  2. B

    3434

  3. C

    4040

  4. D

    2525

Show answer and explanation

Answer: (B) 34

In base 55, the repeating fraction evaluates to F=(0.23‾)5=2⋅51+352−1=1324F = (0.\overline{23})_5 = \frac{2 \cdot 5^1 + 3}{5^2 - 1} = \frac{13}{24}.

Let FF be represented in base 77 as (0.ab‾)7(0.\overline{ab})_7, which expands to 7a+b72−1=7a+b48\frac{7a + b}{7^2 - 1} = \frac{7a + b}{48}.

Equating the two fractional values gives 7a+b48=1324\frac{7a + b}{48} = \frac{13}{24}, which simplifies to 7a+b=267a + b = 26.

Since aa and bb are valid base-77 digits (0≤a,b<70 \le a, b < 7), dividing 2626 by 77 yields a=3a = 3 and b=5b = 5.

Thus, the digits are a=3a = 3 and b=5b = 5, giving a2+b2=32+52=9+25=34a^2 + b^2 = 3^2 + 5^2 = 9 + 25 = 34.

Question 2 · CAT Level

A positive integer NN, when expressed in base 77, is a three-digit number (abc)7(abc)_7. When expressed in base 99, it is written with the exact same digits in reverse order, i.e., (cba)9(cba)_9. What is the decimal value of NN?

  1. A

    248248

  2. B

    256256

  3. C

    214214

  4. D

    284284

Show answer and explanation

Answer: (A) 248

Expanding NN in both positional bases gives N=49a+7b+cN = 49a + 7b + c and N=81c+9b+aN = 81c + 9b + a.

Equating the two forms yields 49a+7b+c=81c+9b+a49a + 7b + c = 81c + 9b + a, which simplifies to 24a−b−40c=024a - b - 40c = 0, or b=8(3a−5c)b = 8(3a - 5c).

Since a,b,ca, b, c are valid base-77 digits, we have 0≤b≤60 \le b \le 6 and 1≤a,c≤61 \le a, c \le 6.

For b=8(3a−5c)b = 8(3a - 5c) to lie in {0,1,…,6}\{0, 1, \dots, 6\}, the integer factor 3a−5c3a - 5c must be exactly 00, forcing b=0b = 0.

From 3a=5c3a = 5c and 1≤a≤61 \le a \le 6, the unique integer solution is a=5a = 5 and c=3c = 3.

Substituting back, the decimal value is N=5⋅49+0⋅7+3=248N = 5 \cdot 49 + 0 \cdot 7 + 3 = 248 (or 3⋅81+0⋅9+5=2483 \cdot 81 + 0 \cdot 9 + 5 = 248).

Question 3 · CAT Level

A positive integer NN has at least three digits in both base 55 and base 77. If the last two digits of NN in base 55 are 3232, and the last two digits of NN in base 77 are 2323, what is the representation of the smallest such integer NN in base 99?

  1. A

    (1540)9(1540)_9

  2. B

    (1720)9(1720)_9

  3. C

    (1630)9(1630)_9

  4. D

    (1640)9(1640)_9

Show answer and explanation

Answer: (C) (1630) 9

A number ending in digits d1d0d_1 d_0 in base bb satisfies N≡d1⋅b+d0(modb2)N \equiv d_1 \cdot b + d_0 \pmod{b^2}.

Thus, N≡3⋅5+2=17(mod25)N \equiv 3 \cdot 5 + 2 = 17 \pmod{25} and N≡2⋅7+3=17(mod49)N \equiv 2 \cdot 7 + 3 = 17 \pmod{49}.

Since gcd⁡(25,49)=1\gcd(25, 49) = 1, by the Chinese Remainder Theorem, N≡17(mod25⋅49)N \equiv 17 \pmod{25 \cdot 49}, i.e., N≡17(mod1225)N \equiv 17 \pmod{1225}.

For NN to have at least three digits in base 77, we require N≥72=49N \ge 7^2 = 49, so the smallest valid integer is N=1225+17=1242N = 1225 + 17 = 1242.

Converting 12421242 to base 99 via successive division yields 1242=1⋅93+6⋅92+3⋅91+0⋅90=(1630)91242 = 1 \cdot 9^3 + 6 \cdot 9^2 + 3 \cdot 9^1 + 0 \cdot 9^0 = (1630)_9.

Question 4 · CAT Level

For how many integer bases b∈{2,3,4,…,50}b \in \{2, 3, 4, \dots, 50\} does the fraction 57\frac{5}{7} have a purely periodic expansion with period length 11, i.e., 57=(0.d‾)b\frac{5}{7} = (0.\overline{d})_b for some non-zero digit dd?

  1. A

    77

  2. B

    66

  3. C

    88

  4. D

    55

Show answer and explanation

Answer: (A) 7

A purely periodic fraction with period 11 in base bb takes the form (0.d‾)b=db−1(0.\overline{d})_b = \frac{d}{b - 1}, where dd is a valid digit satisfying 1≤d<b1 \le d < b.

Setting 57=db−1\frac{5}{7} = \frac{d}{b - 1} yields the linear Diophantine relation 5(b−1)=7d5(b - 1) = 7d.

Since gcd⁡(5,7)=1\gcd(5, 7) = 1, dd must be a positive multiple of 55, so we can write d=5kd = 5k for integer k≥1k \ge 1.

Substituting d=5kd = 5k gives 5(b−1)=35k  ⟹  b−1=7k  ⟹  b=7k+15(b - 1) = 35k \implies b - 1 = 7k \implies b = 7k + 1.

The digit validity constraint d<b  ⟺  5k<7k+1d < b \iff 5k < 7k + 1 holds for all k≥1k \ge 1.

For 2≤b≤502 \le b \le 50, we have 2≤7k+1≤50  ⟹  1≤7k≤492 \le 7k + 1 \le 50 \implies 1 \le 7k \le 49, which gives k∈{1,2,3,4,5,6,7}k \in \{1, 2, 3, 4, 5, 6, 7\}.

Hence, there are exactly 77 such valid integer bases.

Question 5 · CAT Level

A positive integer NN is expressed in base 88 as (abc)8(abc)_8 and in base 1212 as (cba)12(cba)_{12}, where a,b,ca, b, c are non-zero digits. What is the value of a+b+ca + b + c?

  1. A

    1111

  2. B

    1212

  3. C

    1515

  4. D

    1313

Show answer and explanation

Answer: (D) 13

Expanding NN in bases 88 and 1212 gives N=64a+8b+cN = 64a + 8b + c and N=144c+12b+aN = 144c + 12b + a.

Equating the two forms gives 64a+8b+c=144c+12b+a64a + 8b + c = 144c + 12b + a, which simplifies to 4b=63a−143c4b = 63a - 143c.

Since a,b,ca, b, c are non-zero base-88 digits, we have 1≤a,b,c≤71 \le a, b, c \le 7, which implies 4≤4b≤284 \le 4b \le 28.

This bounds the expression: 4≤63a−143c≤28  ⟹  143c+4≤63a≤143c+284 \le 63a - 143c \le 28 \implies 143c + 4 \le 63a \le 143c + 28.

Testing integer values c∈{1,2,…,7}c \in \{1, 2, \dots, 7\}, only c=3c = 3 yields a valid integer aa, giving 63a∈[433,457]63a \in [433, 457], which uniquely gives a=7a = 7 (63⋅7=44163 \cdot 7 = 441).

Then 4b=441−429=12  ⟹  b=34b = 441 - 429 = 12 \implies b = 3, giving the unique digit triplet (a,b,c)=(7,3,3)(a, b, c) = (7, 3, 3).

The required sum is a+b+c=7+3+3=13a + b + c = 7 + 3 + 3 = 13 (corresponding to N=475N = 475).

Study this concept with interactive practice in PrepSoc.

Open the concept library