Jharkhand TET (Teacher Eligibility) /Quantitative Aptitude

Number system

Arithmetic · free study notes

Number System – Advanced University‑Level Notes

Subject – Quantitative Aptitude (Jharkhand TET)
Audience – Students preparing for competitive exams who want a rigorous, MIT‑style understanding of the number system.

Goal: Build a solid foundation from first principles, explore deep properties, and practice with a challenging problem that tests the limits of your knowledge.


Table of Contents

  1. Mathematical Foundations
  2. Natural Numbers, Integers, and Rational Numbers
  3. Divisibility, Prime Numbers, and Factorisation
  4. Modular Arithmetic
  5. Number Bases and Representations
  6. Factorials, Permutations, and Combinatorial Identities
  7. Special Integer Sequences
  8. Edge Cases & Common Pitfalls
  9. Challenging Problem & Full Solution
  10. References & Further Reading

1. Mathematical Foundations <a name="mathematical-foundations"></a>

Symbol Meaning Domain
ℕ Set of natural numbers (positive integers) ℕ = {1, 2, 3, …}
ℤ Set of integers ℤ = {…,-2,-1,0,1,2,…}
ℚ Set of rational numbers ℚ = {p/q
ℝ Set of real numbers ℝ = ℚ ∪ Irrational numbers
ℤₙ Ring of integers modulo n ℤₙ = {0,1,…,n–1}

First Principle: All arithmetic operations are built on the axioms of a commutative ring with unity (ℤ). All higher structures (fields, groups, etc.) are built from ℤ by adding further axioms.


2. Natural Numbers, Integers, and Rational Numbers <a name="natural-integers-rational"></a>

2.1 Peano Axioms

The natural numbers ℕ can be constructed from a single primitive element 0 (or 1) and the successor function S.
Key axioms:

  1. Zero is a natural number.
  2. Successor of a number is a number.
  3. Zero is not a successor.
  4. Distinct numbers have distinct successors.
  5. Induction – any property true of zero and preserved under the successor is true for all natural numbers.

Proof of Induction follows directly from axiom 5.

2.2 Integers (ℤ)

Integers are equivalence classes of pairs of natural numbers (a,b) under the relation
[ (a,b) \sim (c,d) \iff a+d = b+c . ] The class of (a,b) is denoted [a,b], and we identify [a,b] with the integer a−b. This construction guarantees:

  • Additive identity: [0,0]
  • Additive inverse: −[a,b] = [b,a]
  • Multiplication defined via
    [ [a,b] \cdot [c,d] = [ac+bd,, ad+bc]. ]

Thus ℤ is an integral domain.

2.3 Rational Numbers (ℚ)

Similarly, rationals are equivalence classes of pairs of integers (p,q) with q≠0 under
[ (p,q) \sim (r,s) \iff ps = qr . ]

Identification: [p,q] ↦ p/q. This gives a field structure on ℚ.

Key Property: ℚ is dense in ℝ – between any two real numbers there is a rational.


3. Divisibility, Prime Numbers, and Factorisation <a name="divisibility"></a>

3.1 Divisibility

For a,b∈ℤ with b≠0, we write b | a iff ∃ k∈ℤ such that a = bk.
Basic properties:

  1. Reflexivity: a | a.
  2. Transitivity: If b | a and c | b then c | a.
  3. Unit divisors: ±1 | a for all a.

Euclidean Algorithm (from first principles) gives the greatest common divisor (gcd):

Theorem (Euclid): For a,b ∈ ℤ, b≠0, there exist integers q,r with
[ a = qb + r,\qquad 0 \le r < |b|. ] Iterating yields gcd(a,b) = gcd(b,r).

Proof Sketch: Induction on |a|.

3.2 Prime Numbers

A prime p ∈ ℕ satisfies: if p | ab then p | a or p | b. Equivalent: p has exactly two positive divisors: 1 and p.

Fundamental Theorem of Arithmetic (FTA)
Every integer n>1 can be uniquely expressed (up to order) as a product of primes: [ n = p_1^{e_1} p_2^{e_2} \dots p_k^{e_k},

Your note

Page 1

Doubt hai is topic me?

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