SSC Stenographer /Quantitative Aptitude

Number system

Arithmetic · free study notes

SSC Stenographer – Quantitative Aptitude

Topic: Number System

Audience: High‑school students preparing for the SSC Stenographer exam.
Depth: MIT‑level treatment – we’ll start from first principles, build rigorous theory, explore edge cases, and finish with a challenging problem.

Structure

  1. Definition & basic concepts
  2. Place‑value representation
  3. Conversions (between bases)
  4. Arithmetic in arbitrary bases
  5. Advanced topics & edge cases
  6. Deep theory: radix, representation theory, modular arithmetic
  7. Challenging problem & detailed solution

1. Foundations

Term Definition
Base (radix) The number of distinct digits (including zero) that a positional numeral system uses.
Digit A symbol that represents a value less than the base.
Positional notation A notation in which the value of a digit depends on its position.
Radix point The separator between integer and fractional parts (like the decimal point in base 10).
Leading zeros Zeros appearing to the left of the most significant non‑zero digit; they do not change the value.
Trailing zeros Zeros after the radix point that may or may not affect the value depending on context.

Place value: In base (b), the digit at position (k) (counting from 0 at the radix point to the left) contributes (d_k b^k) to the integer value.


2. Positional Representation

For a number (N) in base (b) with digits (d_{n-1} d_{n-2}\dots d_0.d_{-1}d_{-2}\dots d_{-m}):

[ N = \sum_{k=0}^{n-1} d_k,b^{k}

  • \sum_{k=1}^{m} d_{-k},b^{-k} ]

Example: In base 8, the number 345.67 is

[ 3\cdot 8^2 + 4\cdot 8^1 + 5\cdot 8^0

  • 6\cdot 8^{-1} + 7\cdot 8^{-2} = 192 + 32 + 5 + 0.75 + 0.109375 = 229.859375. ]

Properties

  1. Uniqueness – Every non‑negative integer has a unique representation (ignoring leading zeros).
  2. Non‑uniqueness for negatives – Negatives are usually written with a leading ‘−’.
  3. Fractional part – A finite fractional part in base (b) is rational only if the denominator divides a power of (b).

3. Converting Between Bases

3.1 Integer Part

Repeated Division Algorithm

  1. Divide the integer (N) by (b).
  2. Record the remainder (r_0).
  3. Replace (N) by the floor of the division.
  4. Repeat until (N = 0).
  5. The digits of the representation are (r_{k-1}\dots r_1 r_0) (reverse order).

Proof of correctness: At each step (N = qb + r) with (0 \le r < b). The algorithm reconstructs (N) as (\sum r_i b^i).

3.2 Fractional Part

Repeated Remainder Algorithm

  1. Multiply the fractional part (f) by (b).
  2. Extract the integer part (d_0); this is the next digit.
  3. Replace (f) by the new fractional part.
  4. Repeat.

If, after some step, the fractional part repeats, the expansion is repeating; otherwise it’s terminating.

3.3 Example

Convert (0.625_{10}) to base 2:

Step (f) (f \times 2) Integer part New (f)
1 0.625 1.25 1 0.25
2 0.25 0.5 0 0.5
3 0.5 1.0 1 0

So (0.625_{10} = 0.101_2).


4. Arithmetic in Base‑(b)

Operation Method Edge Cases
Addition Column addition with carry Carries that propagate beyond the most significant digit (e.g., (b-1 + 1)).
Subtraction Borrowing in base‑(b) Borrowing from higher digit may create a chain of borrows.
Multiplication Long multiplication or shift‑and‑add Carry management; product of two (n)-digit numbers can have up to (2n) digits.
Division Long division Remainder in base‑(b) may have repeating fractional part.

4.1 Modular Arithmetic Connection

When adding or multiplying numbers, the carry can be understood as the integer part of a division by (b). For example, in base 10, adding 7 + 8 gives 15: 5 is the digit, and (\lfloor 15/10 \rfloor = 1) is the carry. This is exactly ( (7+8) \bmod 10) and the carry is (\lfloor (7+8)/10 \rfloor).


Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.