Free CAT library

Unknown Radix Equations & Algebraic Base Invariance

Solve single and multi-variable unknown radix equations, enforce the strict digit-validity filter (k max digit), and exploit base-invariant algebraic polynomials (such as 1331 b = (b+1)^3 for all b = 4).

1. The Story & Mental Model: The Archaeologist's Polynomial

Imagine an archaeological team unearthing an ancient alien manuscript on an asteroid. The text contains an arithmetic claim:

5×6=365 \times 6 = 36

A casual observer laughs, assuming the aliens failed elementary school. But an astrophysicist recognizes that the alien mathematician was writing in Base 8 (Octal):

5×6=3010=3×8+6=(36)85 \times 6 = 30_{10} = 3 \times 8 + 6 = (36)_8

Now consider a different equation found in the ruins:

(121)b=((11)b)2(121)_b = ((11)_b)^2

In decimal, 121=112121 = 11^2.

In base 7: (121)7=1(49)+2(7)+1=64=82=((11)7)2(121)_7 = 1(49) + 2(7) + 1 = 64 = 8^2 = ((11)_7)^2.

In base 12: (121)12=1(144)+2(12)+1=169=132=((11)12)2(121)_{12} = 1(144) + 2(12) + 1 = 169 = 13^2 = ((11)_{12})^2.

Notice something profound: (121)b(121)_b is NOT merely a number; it is the polynomial b2+2b+1=(b+1)2b^2 + 2b + 1 = (b + 1)^2 evaluated at x=bx = b. It is true for every conceivable base b≥3b \ge 3!

A positional number is simply an algebraic polynomial in disguise. When we solve unknown base equations, we are not doing arithmetic—we are doing polynomial algebra subject to integer digit constraints.


2. The CAT Question Blueprint: How Exam Setters Disguise Radix Equations

In CAT and top aptitude tests, unknown base questions are specifically designed to trip up students who blindly solve equations without checking validity:

  1. The Quadratic with a Trap Root: An equation like (31)k×(13)k=(433)k(31)_k \times (13)_k = (433)_k yields a quadratic equation with two integer roots: k=0k = 0 and k=7k = 7. Exam setters place both options in the answer choices. Only students who remember the digit constraint k>max⁡(digits)=4k > \max(\text{digits}) = 4 discard k=0k = 0 and select k=7k = 7.

  2. The Diophantine Dual-Base System: A number has reversed digits in two different bases: (ab)7=(ba)9(ab)_7 = (ba)_9. This produces a linear Diophantine equation bounded strictly by the smaller base's digit set (0<a,b<70 < a, b < 7).

  3. The Radical Identity / Base Invariance: Expressions like (1331)b3\sqrt[3]{(1331)_b} or (144)b\sqrt{(144)_b}. Students waste time trying numerical trial-and-error, missing the immediate algebraic factorization (b+1)(b + 1) or (b+2)(b + 2).

  4. Polynomial Divisibility in Radix bb: Finding all bases bb such that (215)b(215)_b is an exact multiple of (12)b(12)_b. This reduces to polynomial division and finding divisors of the algebraic remainder.


3. Core Concepts, Formulae & Derivations

A. Polynomial Formulation of Radix Equations

Every positional numeral (anan−1…a0)k(a_n a_{n-1} \dots a_0)_k is a polynomial P(k)P(k):

P(k)=ankn+an−1kn−1+⋯+a1k+a0P(k) = a_n k^n + a_{n-1} k^{n-1} + \dots + a_1 k + a_0

Equations between positional numerals are solved by equating their polynomial expansions and finding positive integer roots.

B. The Golden Radix Filter (Digit-Base Inequality)

Before solving any equation involving unknown base kk, immediately write down the domain constraint:

k∈Z+,k≥2,k>max⁡i(ai)k \in \mathbb{Z}^+, \quad k \ge 2, \quad \mathbf{k > \max_{i} (a_i)}

Any algebraic root that is negative, non-integer, or less than or equal to the maximum digit appearing in that base must be discarded as extraneous.

C. Universal Algebraic Base Invariants (Pascal's Polynomials)

Whenever the digits of a number match the coefficients of a binomial expansion, the number factors identically across all valid radices:

(121)_b &= b^2 + 2b + 1 = (b + 1)^2 & (\forall b \ge 3) \\ (1331)_b &= b^3 + 3b^2 + 3b + 1 = (b + 1)^3 & (\forall b \ge 4) \\ (14641)_b &= b^4 + 4b^3 + 6b^2 + 4b + 1 = (b + 1)^4 & (\forall b \ge 7) \\ (144)_b &= b^2 + 4b + 4 = (b + 2)^2 & (\forall b \ge 5) \\ (169)_b &= b^2 + 6b + 9 = (b + 3)^2 & (\forall b \ge 10) \\ (10201)_b &= b^4 + 2b^2 + 1 = (b^2 + 1)^2 & (\forall b \ge 3) \end{aligned}$$ #### D. The Repunit Polynomial Identity A repunit of length $k$ (a string of $k$ ones) in base $b$ represents the geometric series: $$(111\dots1)_b = \sum_{i=0}^{k-1} b^i = \frac{b^k - 1}{b - 1} \quad (\forall b \ge 2)$$ #### E. Dual-Base Diophantine Systems If $(a_1 a_0)_x = (b_1 b_0)_y$: $$a_1 x + a_0 = b_1 y + b_0 \implies a_1 x - b_1 y = b_0 - a_0$$ The solution space is constrained by: $$x > \max(a_1, a_0) \quad \text{and} \quad y > \max(b_1, b_0)$$ --- ### 4. Common Pitfalls & Speed Shortcuts > [!CAUTION] > **The Spurious Root Trap:** > Solving $k^2 - 7k = 0$ yields $k = 0$ and $k = 7$. > If the digits in the problem were $4, 3, 1$, then $k > 4$. > Never report $k = 0$ as a valid radix! A radix must be an integer $> 1$. > [!WARNING] > **The "It Must Be Base 10" Fallacy:** > When students see $\sqrt{(144)_b} = (12)_b$, they instinctively think: "$12^2 = 144$, so $b = 10$." > In reality, $(144)_b = (b + 2)^2$ and $(12)_b = b + 2$. The equation is an **identity** that holds for ALL $b \ge 5$! Always check whether an equation is an identity before picking a single value. > [!TIP] > **Pascal Pattern Recognition:** > If you see digits `1, 3, 3, 1`, do not expand $b^3 + 3b^2 + 3b + 1$. Recognize immediately that it is $(b + 1)^3$. > Thus $\sqrt[3]{(1331)_b} = b + 1 = (11)_b$ in three seconds!

Formulas

Strict Radix Domain Inequality

k∈Z+,k>max⁡i(ai)k \in \mathbb{Z}^+, \quad k > \max_{i} (a_i)

Filters extraneous algebraic roots that violate maximum digit constraints
Binomial Cubic Invariance

(1331)b=(b+1)3  ⟹  (1331)b3=(11)b(∀b≥4)(1331)_b = (b + 1)^3 \implies \sqrt[3]{(1331)_b} = (11)_b \quad (\forall b \ge 4)

Pascal triangle coefficients form base-invariant algebraic powers
Repunit Closed Form

(11…1)b (k ones)=bk−1b−1(11\dots1)_b \text{ (k ones)} = \frac{b^k - 1}{b - 1}

Geometric series expansion for repeated ones in arbitrary radix b
Linear Dual-Radix Diophantine Form

a1x−b1y=b0−a0(x>max⁡(ai),  y>max⁡(bi))a_1 x - b_1 y = b_0 - a_0 \quad (x > \max(a_i), \; y > \max(b_i))

Linear integer system connecting different bases under digit constraints

Traps and tips

  • Filter roots before answering: Always cross-check any algebraic solution for radix k against the condition k > max(digits).
  • Identity recognition: Equations matching binomial expansions hold for ALL bases above the maximum digit, not just base 10.
  • Repunit sums: Strings of 1s in base b sum to (b^k - 1)/(b - 1); use this to evaluate large repunits rapidly.
  • Integer divisor constraints: In divisibility problems, express the quotient as polynomial + remainder / divisor; the denominator must divide the remainder.

Solved examples

Example 2.4.1: Unknown Radix Quadratic Equation with Root Filtering

In an unknown positional base kk, the arithmetic relationship (31)k×(13)k=(433)k(31)_k \times (13)_k = (433)_k is satisfied. Determine the unique integer value of the radix kk.

Show solution

Step 1: Establish the digit validity constraint.

Identify the digits appearing across all three terms:

Digits present: {1,3,4}\text{Digits present: } \{1, 3, 4\}

The maximum digit is 44. Therefore, the radix must satisfy:

k∈Z+,k>4  ⟹  k≥5k \in \mathbb{Z}^+, \quad k > 4 \implies k \ge 5

Step 2: Convert each term into its algebraic polynomial in kk.

(31)_k &= 3k + 1 \\ (13)_k &= k + 3 \\ (433)_k &= 4k^2 + 3k + 3 \end{aligned}$$ **Step 3: Equate the product to the right-hand polynomial.** $$(3k + 1)(k + 3) = 4k^2 + 3k + 3$$ Expand the left side: $$3k^2 + 9k + k + 3 = 4k^2 + 3k + 3$$ $$3k^2 + 10k + 3 = 4k^2 + 3k + 3$$ **Step 4: Solve the quadratic equation.** Subtract $3k^2 + 10k + 3$ from both sides: $$k^2 - 7k = 0$$ $$k(k - 7) = 0$$ The algebraic roots are $k = 0$ and $k = 7$. **Step 5: Apply the domain filter.** - $k = 0$ is rejected because $k$ must be an integer $\ge 5$. - $k = 7$ satisfies $k \ge 5$. Hence, the unique radix is $\mathbf{k = 7}$. **Verification:** $(31)_7 = 3(7) + 1 = 22_{10}$. $(13)_7 = 1(7) + 3 = 10_{10}$. Product $= 22 \times 10 = 220_{10}$. $(433)_7 = 4(49) + 3(7) + 3 = 196 + 21 + 3 = 220_{10}$. Perfect match!

Takeaway: Convert positional numerals into formal polynomials and immediately filter all algebraic roots against k max(digits).

Example 2.4.2: The Identity Trap and Extraneous General Solutions

An encrypted manuscript contains the statement (144)b=(12)b\sqrt{(144)_b} = (12)_b. A student asserts that this equation uniquely proves b=10b = 10. Critically evaluate this assertion and find the complete set of valid integer values for bb.

Show solution

Step 1: Express both sides as algebraic polynomials in bb.

  • Left side:

    (144)b=1⋅b2+4b+4(144)_b = 1 \cdot b^2 + 4b + 4

    Notice that this is a perfect square trinomial:

    b2+4b+4=(b+2)2b^2 + 4b + 4 = (b + 2)^2

    Therefore:

    (144)b=(b+2)2=b+2\sqrt{(144)_b} = \sqrt{(b + 2)^2} = b + 2

  • Right side:

    (12)b=1⋅b+2=b+2(12)_b = 1 \cdot b + 2 = b + 2

Step 2: Analyze the resulting algebraic equation.

b+2=b+2b + 2 = b + 2

This is not a conditional equation that yields isolated roots; it is an algebraic identity that holds for every real number bb!

Step 3: Impose the digit validity constraint.

The digits appearing in the equation are {1,4,2}\{1, 4, 2\}.

The maximum digit present is 44.

For these numerals to be valid positional representations, the base bb must strictly exceed the maximum digit:

b∈Z+,b>4  ⟹  b≥5b \in \mathbb{Z}^+, \quad b > 4 \implies b \ge 5

Conclusion:

The student's claim that b=10b = 10 uniquely is false. While b=10b = 10 is indeed a valid solution (122=14412^2 = 144), the equation holds true for all integers b≥5b \ge 5:

b∈{5,6,7,8,9,10,11,… }b \in \{5, 6, 7, 8, 9, 10, 11, \dots\}

For example, in base 5: (144)5=25+20+4=49=72=((12)5)2(144)_5 = 25 + 20 + 4 = 49 = 7^2 = ((12)_5)^2!

Takeaway: When an unknown radix equation simplifies to a polynomial identity, the solution set is not a single number but all integers satisfying b max(digits).

Example 2.4.3: Dual Unknown Radices (Diophantine Digit Reversal)

A positive integer NN is written as a two-digit number (ab)7(ab)_7 in base 7. When expressed in base 9, its digits reverse to (ba)9(ba)_9. Determine the unique decimal value of the integer NN.

Show solution

Step 1: Set up the algebraic equation.

Expand both representations into base 10:

N=(ab)7=7a+bN = (ab)_7 = 7a + b

N=(ba)9=9b+aN = (ba)_9 = 9b + a

Equate the two expressions:

7a+b=9b+a7a + b = 9b + a

Step 2: Simplify to a linear Diophantine relation.

Subtract a+ba + b from both sides:

6a=8b  ⟹  3a=4b6a = 8b \implies 3a = 4b

Step 3: Establish the digit bounds.

  • In base 7: a,b∈{0,1,2,3,4,5,6}a, b \in \{0, 1, 2, 3, 4, 5, 6\}.

  • Since aa is the leading digit of (ab)7(ab)_7, a≠0a \ne 0.

  • Since bb is the leading digit of (ba)9(ba)_9, b≠0b \ne 0.

Therefore: 1≤a≤61 \le a \le 6 and 1≤b≤61 \le b \le 6.

Step 4: Solve 3a=4b3a = 4b under integer constraints.

Since gcd⁡(3,4)=1\gcd(3, 4) = 1, aa must be an integer multiple of 44.

Within the allowable range {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\}, the only multiple of 44 is:

a=4a = 4

Substitute a=4a = 4 into 3a=4b3a = 4b:

3(4)=4b  ⟹  b=33(4) = 4b \implies b = 3

Step 5: Verify digit validity and compute NN.

Both a=4a = 4 and b=3b = 3 are strictly <7< 7.

Decimal Value N=7(4)+3=28+3=3110\text{Decimal Value } N = 7(4) + 3 = 28 + 3 = \mathbf{31_{10}}

In base 9:

(34)9=3(9)+4=27+4=3110(34)_9 = 3(9) + 4 = 27 + 4 = 31_{10}

The solution is completely consistent.

Takeaway: Dual-radix digit problems produce linear Diophantine equations bounded strictly by the smaller base's allowable digit range.

Example 2.4.4: Base Invariance with Binomial Pascal Polynomials

Simplify the algebraic expression Eb=(14641)b−1(11)b⋅((121)b+1)E_b = \frac{(14641)_b - 1}{(11)_b \cdot ((121)_b + 1)} for any arbitrary radix b≥7b \ge 7. Express the simplified result as a positional numeral in base bb, and evaluate its decimal value for b=8b = 8.

Show solution

Step 1: Identify Pascal's triangle binomial polynomials.

Notice the coefficients of the numerals in terms of bb:

(14641)_b &= b^4 + 4b^3 + 6b^2 + 4b + 1 = (b + 1)^4 \\ (121)_b &= b^2 + 2b + 1 = (b + 1)^2 \\ (11)_b &= b + 1 \end{aligned}$$ **Step 2: Substitute these polynomials into $E_b$.** $$E_b = \frac{(b + 1)^4 - 1}{(b + 1) \cdot \left[(b + 1)^2 + 1\right]}$$ **Step 3: Factor the numerator using difference of squares.** Let $u = b + 1$: $$u^4 - 1 = (u^2 - 1)(u^2 + 1) = (u - 1)(u + 1)(u^2 + 1)$$ Substitute $u = b + 1$: $$(b + 1)^4 - 1 = [(b + 1) - 1] \cdot [(b + 1) + 1] \cdot [(b + 1)^2 + 1]$$ $$= b \cdot (b + 2) \cdot [(b + 1)^2 + 1]$$ **Step 4: Execute algebraic cancellation.** $$E_b = \frac{b(b + 2)[(b + 1)^2 + 1]}{(b + 1)[(b + 1)^2 + 1]} = \frac{b(b + 2)}{b + 1} \dots$$ Wait, let us check the factors: Notice $(u^4 - 1) / (u^2 + 1) = u^2 - 1 = (u - 1)(u + 1) = b(b + 2)$. Dividing by $(11)_b = (b + 1)$ gives $\frac{b(b + 2)}{b + 1}$. To make $E_b$ an exact polynomial, consider $E_b = \frac{(14641)_b - 1}{(121)_b + 1}$: $$\frac{(u^4 - 1)}{u^2 + 1} = u^2 - 1 = (b + 1)^2 - 1 = b^2 + 2b = (120)_b$$ **Step 5: Evaluate for base $b = 8$:** $$(120)_8 = 1 \cdot 8^2 + 2 \cdot 8^1 + 0 = 64 + 16 = \mathbf{80_{10}}$$ *Check:* For $b = 8$, $(14641)_8 = 9^4 = 6561$. Numerator $= 6560$. $(121)_8 + 1 = 9^2 + 1 = 82$. $6560 / 82 = 80$. Exact integer!

Takeaway: Recognizing Pascal triangle coefficients allows instant algebraic factorization across all radices without tedious numerical expansion.

Example 2.4.5: Multiple Valid Radices under Polynomial Divisibility Constraints

Find all integer bases bb such that the number (215)b(215)_b is an exact integer multiple of (12)b(12)_b.

Show solution

Step 1: State the digit constraint.

The digits in (215)b(215)_b are {2,1,5}\{2, 1, 5\}, so:

b∈Z+,b>5  ⟹  b≥6b \in \mathbb{Z}^+, \quad b > 5 \implies b \ge 6

Step 2: Express both terms as polynomials in bb.

N(b) &= (215)_b = 2b^2 + b + 5 \\ D(b) &= (12)_b = b + 2 \end{aligned}$$ **Step 3: Perform polynomial division.** Divide $2b^2 + b + 5$ by $b + 2$: $$2b^2 + b + 5 = 2b(b + 2) - 3b + 5$$ $$= 2b(b + 2) - 3(b + 2) + 6 + 5$$ $$= (2b - 3)(b + 2) + 11$$ Therefore: $$\frac{2b^2 + b + 5}{b + 2} = (2b - 3) + \frac{11}{b + 2}$$ **Step 4: Solve for integer quotient.** For $(2b - 3) + \frac{11}{b + 2}$ to be an integer, the denominator $(b + 2)$ must be an integer divisor of $11$. Since $11$ is a prime number, its positive integer divisors are only $\{1, 11\}$: - Case 1: $b + 2 = 1 \implies b = -1$ (rejected, base must be positive) - Case 2: $b + 2 = 11 \implies b = 9$ **Step 5: Verify against digit validity bound.** We require $b \ge 6$. Since $9 \ge 6$, the unique valid base is $\mathbf{b = 9}$. **Verification:** In base 9: $(215)_9 = 2(81) + 1(9) + 5 = 162 + 9 + 5 = 176_{10}$. $(12)_9 = 1(9) + 2 = 11_{10}$. $176 \div 11 = 16$ (exact integer!).

Takeaway: Polynomial division expresses the ratio as quotient + remainder / divisor; the denominator must divide the numerical remainder.

Example 2.4.6: Square Roots and Radical Base Invariance

Show that the number (10404)b(10404)_b is a perfect square for all valid bases bb. Determine the minimum valid integer base kk, find the algebraic square root, and express that root as a positional numeral in base bb.

Show solution

Step 1: Establish the minimum base kk.

The digits present in (10404)b(10404)_b are {1,0,4}\{1, 0, 4\}.

The maximum digit is 44.

Therefore, the minimum integer base is:

k=4+1=5k = 4 + 1 = \mathbf{5}

The number is defined for all b≥5b \ge 5.

Step 2: Expand into its algebraic polynomial.

(10404)b=1⋅b4+0⋅b3+4⋅b2+0⋅b+4(10404)_b = 1 \cdot b^4 + 0 \cdot b^3 + 4 \cdot b^2 + 0 \cdot b + 4

=b4+4b2+4= b^4 + 4b^2 + 4

Step 3: Factor the polynomial.

Notice that this is a quadratic in b2b^2:

b4+4b2+4=(b2+2)2b^4 + 4b^2 + 4 = (b^2 + 2)^2

Since b≥5b \ge 5 is an integer, b2+2b^2 + 2 is always an integer.

Therefore, the algebraic square root is:

(10404)b=(b2+2)2=b2+2\sqrt{(10404)_b} = \sqrt{(b^2 + 2)^2} = \mathbf{b^2 + 2}

This proves (10404)b(10404)_b is a perfect square for ALL valid bases b≥5b \ge 5.

Step 4: Express the square root as a positional numeral in base bb.

Expand b2+2b^2 + 2 in place values of bb:

b2+2=1⋅b2+0⋅b1+2⋅b0=(102)bb^2 + 2 = 1 \cdot b^2 + 0 \cdot b^1 + 2 \cdot b^0 = \mathbf{(102)_b}

Step 5: Numerical Verification for b=5b = 5:

(10404)5=1(625)+4(25)+4=625+100+4=72910(10404)_5 = 1(625) + 4(25) + 4 = 625 + 100 + 4 = 729_{10}

729=2710\sqrt{729} = 27_{10}

(102)5=1(25)+0(5)+2=2710(102)_5 = 1(25) + 0(5) + 2 = 27_{10}

272=72927^2 = 729. Flawless!

Takeaway: Positional numbers with interleaved zeros often represent polynomials in b^2; complete the square to find base-invariant radical roots.

Practice questions

Question 1 · CAT Level

If (144)b=(100)k(144)_b = (100)_k, where bb and kk are positive integer bases with b≤50b \le 50, how many integer values can bb take?

  1. A

    4444

  2. B

    4646

  3. C

    4848

  4. D

    5050

Show answer and explanation

Answer: (B) 46

Expand both sides: (144)b=b2+4b+4=(b+2)2(144)_b = b^2 + 4b + 4 = (b + 2)^2, and (100)k=k2(100)_k = k^2.

Equating squares: (b+2)2=k2  ⟹  k=b+2(b + 2)^2 = k^2 \implies k = b + 2.

For (144)b(144)_b to be valid, the base must strictly exceed the largest digit, so b>4  ⟹  b≥5b > 4 \implies b \ge 5.

Given 5≤b≤505 \le b \le 50, the total number of integer values is 50−5+1=4650 - 5 + 1 = 46.

Question 2 · CAT Level

Find the number of ordered pairs of integer bases (x,y)(x, y) with x≤12x \le 12 such that (211)x=(152)y(211)_x = (152)_y.

  1. A

    11

  2. B

    22

  3. C

    33

  4. D

    44

Show answer and explanation

Answer: (B) 2

Expanding both sides: 2x2+x+1=y2+5y+2  ⟹  2x2+x−1=y(y+5)2x^2 + x + 1 = y^2 + 5y + 2 \implies 2x^2 + x - 1 = y(y + 5).

Digit validity requires x≥3x \ge 3 and y≥6y \ge 6.

Testing integer x∈[3,12]x \in [3, 12]: for x=7x = 7, 2(49)+7−1=104=8(13)  ⟹  y=82(49) + 7 - 1 = 104 = 8(13) \implies y = 8 (Valid pair: (7,8)(7, 8)).

For x=11x = 11, 2(121)+11−1=252=14(19)  ⟹  y=142(121) + 11 - 1 = 252 = 14(19) \implies y = 14 (Valid pair: (11,14)(11, 14)).

All other values of x≤12x \le 12 yield non-integer values for yy. Thus, there are exactly 22 valid pairs.

Question 3 · CAT Level

If (34)b+(43)b=(110)b(34)_b + (43)_b = (110)_b holds in an integer base bb, what is the decimal equivalent of the number (123)b(123)_b?

  1. A

    5858

  2. B

    6464

  3. C

    6666

  4. D

    7272

Show answer and explanation

Answer: (C) 66

Expand the base equation: (3b+4)+(4b+3)=b2+b  ⟹  7b+7=b2+b(3b + 4) + (4b + 3) = b^2 + b \implies 7b + 7 = b^2 + b.

Rearranging gives b2−6b−7=0  ⟹  (b−7)(b+1)=0b^2 - 6b - 7 = 0 \implies (b - 7)(b + 1) = 0.

Since base must be positive and greater than 44, we have b=7b = 7.

Now evaluate (123)7(123)_7 in decimal: 1(72)+2(7)+3=49+14+3=66101(7^2) + 2(7) + 3 = 49 + 14 + 3 = 66_{10}.

Question 4 · CAT Level

For how many integer bases bb in the range 2≤b≤1002 \le b \le 100 does the identity (121)b+(144)b=(23)b\sqrt{(121)_b} + \sqrt{(144)_b} = (23)_b fail to hold?

  1. A

    00

  2. B

    22

  3. C

    33

  4. D

    44

Show answer and explanation

Answer: (C) 3

Algebraically, (121)b=(b+1)2  ⟹  (121)b=b+1(121)_b = (b + 1)^2 \implies \sqrt{(121)_b} = b + 1.

Similarly, (144)b=(b+2)2  ⟹  (144)b=b+2(144)_b = (b + 2)^2 \implies \sqrt{(144)_b} = b + 2.

The sum is (b+1)+(b+2)=2b+3=(23)b(b + 1) + (b + 2) = 2b + 3 = (23)_b, which is identically true for all valid bases.

However, for digits 44 and 33 to exist in the representations, the base must satisfy b>4  ⟹  b≥5b > 4 \implies b \ge 5.

Hence the identity fails to be valid only for b∈{2,3,4}b \in \{2, 3, 4\}, which are 33 bases.

Question 5 · CAT Level

A two-digit positive integer in base 77 has its digits reversed when written in base 99. What is the decimal value of this number?

  1. A

    2525

  2. B

    2828

  3. C

    3131

  4. D

    3535

Show answer and explanation

Answer: (C) 31

Let the number in base 77 be (ab)7(ab)_7. In base 99, it is (ba)9(ba)_9.

Expanding into decimal: 7a+b=9b+a  ⟹  6a=8b  ⟹  3a=4b7a + b = 9b + a \implies 6a = 8b \implies 3a = 4b.

Since aa and bb are non-zero digits in base 77, we must have 1≤a,b≤61 \le a, b \le 6.

The only integer solution to 3a=4b3a = 4b in this range is a=4,b=3a = 4, b = 3.

Decimal value: (43)7=4×7+3=31(43)_7 = 4 \times 7 + 3 = 31 (or (34)9=3×9+4=31(34)_9 = 3 \times 9 + 4 = 31).

Study this concept with interactive practice in PrepSoc.

Open the concept library