Free CAT library

CAT Number Systems (Radix & Bases): Concepts and Formulas

7 concepts for CAT Number Systems (Radix & Bases) (Number Systems), from basics to CAT-level shortcuts.

  1. 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…
  2. Power-of-Two Base Grouping Shortcuts
    Exploit isomorphic power-of-two base relations (Base 2, 4, 8, 16) to execute direct inter-base conversions via bit-grouping (triplets and nibbles) and proper directional padding, completely…
  3. 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.
  4. 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…
  5. Radix Combinatorics, Weights & Digital Properties
    Master radix combinatorics: digit-count logarithmic formulas, weight-partitioning theorems (single-pan binary vs. two-pan balanced ternary), base-shift right concatenation, and generalized radix…
  6. Practice Set 1: Foundation & Conceptual Drill
    Comprehensive 15-question practice drill mirroring Chapter 9 Exercise 1 with fresh thematic scenarios and mathematically verified solutions.
  7. Practice Set 2: Advanced & CAT Exam-Level Drill
    Rigorous 15-question advanced drill mirroring Chapter 9 Exercise 2 with multi-variable constraints and authentic CAT-level traps.

Key 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
Logarithmic Grouping Theorem

r2=r1k  ⟹  1 digit of r2≡k digits of r1r_2 = r_1^k \implies 1 \text{ digit of } r_2 \equiv k \text{ digits of } r_1

Exact power-of-two base grouping ratio (k=3 for octal, k=4 for hex)
Integer Grouping Direction

⋯←leftward from radix pointa2a1a0\dots \xleftarrow{\text{leftward from radix point}} a_2 a_1 a_0

Group leftward; pad leading zeros on the far left of the integer part
Fractional Grouping Direction

b1b2b3⋯→rightward from radix pointb_1 b_2 b_3 \dots \xrightarrow{\text{rightward from radix point}}

Group rightward; pad trailing zeros on the far right of the fractional part
Octal-to-Hex Transcoding Bridge

(N)8→3-bit unpack(N)2→4-bit pack(N)16(N)_8 \xrightarrow{\text{3-bit unpack}} (N)_2 \xrightarrow{\text{4-bit pack}} (N)_{16}

Converts directly between octal and hex without evaluating decimal values
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

Recent CAT questions on Number Systems (Radix & Bases)

  1. CAT 2025 Slot 1 Quant Q4
    The number of distinct pairs of integers (x, y) satisfying the inequalities x y 3 and x + y < 14 is
  2. CAT 2025 Slot 1 Quant Q7
    In a 3-digit number N, the digits are non-zero and distinct such that none of the digits is a perfect square, and only…
  3. CAT 2025 Slot 2 Quant Q2
    Suppose a,b,c are three distinct natural numbers, such that 3ac = 8(a+b) . Then, the smallest possible value of…
  4. CAT 2025 Slot 2 Quant Q5
    If m and n are integers such that (m+2n)(2m+n) = 27 , then the maximum possible value of 2m-3n is
  5. CAT 2025 Slot 2 Quant Q9
    The sum of digits of the number (625)^65 (128)^36 , is
  6. CAT 2025 Slot 2 Quant Q12
    The number of divisors of (2^6 3^5 5^3 7^2) , which are of the form (3r+1) , where r is a non-negative integer, is
  7. CAT 2025 Slot 3 Quant Q5
    For a 4-digit number (greater than 1000), sum of the digits in the thousands, hundreds, and tens places is 15. Sum of…
  8. CAT 2025 Slot 3 Quant Q8
    The sum of all the digits of the number (10^50+10^25-123) , is