Video summary

Rajasthan Computer Anudeshak Bharti 2026 | Maths Class – संख्या पद्धति (Number System) Part 04

Main summary

Key takeaways

Educational

Main ideas & lessons (Number System + MCQ practice)

  • The class focuses on Maths (Number System) with Theory + PYQ/MCQ.
  • The instructor emphasizes that the exam will mostly ask MCQs, with theory interspersed.
  • A recurring exam skill is reading the question carefully, especially wording like “between A and B” (i.e., whether endpoints are included or excluded).
  • Many questions are taught using pattern/logic from counting, not only rote recall—though the instructor notes that some answers may come from memory.
  • For prime-related MCQs, the key emphasis is:
    • Prime definitions/properties
    • Using divisibility rules to test primality quickly.

Detailed methodology / instruction-style content (as taught)

1) Identify what a “decimal system” is called (MCQ logic)

  • The decimal number system is also known as:
    • Indo-Arabic number system
  • Exam questions may include distractors; choose the option that matches the alternate name of the decimal system.

2) “Zero principle” attribution (concept check)

  • The instructor distinguishes:
    • “Zero principle” vs the discovery of zero (two different ideas).
  • As per the lesson framing, the credited answer for “zero principle” is:
    • Nagarjuna
  • Aryabhata is mentioned in connection with discovering zero, but the MCQ specifically asks for the “zero principle.”

3) Finding the “smallest integer whose cube equals itself”

Use the condition (x^3 = x) and test small integers:

  • ((-1)^3 = -1) ✅
  • ((0)^3 = 0) ✅
  • ((1)^3 = 1) ✅
  • ((2)^3 = 8) ❌ (not equal)

Then choose the smallest valid value: -1.

4) “Integers between -100 and +100” (critical reading: endpoints)

  • The instructor warns about the exam trap:
    • If the wording is “between -100 and +100” (as interpreted in the session), then -100 and +100 are not counted, but 0 is counted.
  • Integers run effectively from -99 to 99, including 0.
  • Count length:
    • From -99 to 99 gives 199 integers (option C in the session).
  • The instructor notes: if endpoints were explicitly included, the answer would change.

5) Counting digit occurrences in writing numbers (1 to 100 and beyond)

General pattern taught for numbers written in sequence (as per the session’s scheme):

  • For digits 2 through 9, each appears 20 times.
  • Digit 1 appears most frequently (as per the instructor’s taught counting scheme).
  • Digit 0 appears the least.

Examples/extensions from the session:

  • Digit 5 occurrences from 1 to 100 → 20 times
  • Digit 7 occurrences from 0 to 108:
    • Extending beyond 100 (into 101–108) adds one extra repetition
    • Final result: 21 times (option C as claimed)
  • Digit 0 occurrences from 1 to 100:
    • 11 times

6) Total digits required to write numbers in a range (1 to n)

Digit-length segmentation method:

  • 1 to 9:
    • 1-digit numbers: 9 numbers → 9 digits
  • 10 to 99:
    • 2-digit numbers: 90 numbers → (90 \times 2 = 180) digits
  • 100 to 999 (when needed):
    • 3-digit numbers: 900 numbers → (900 \times 3 = 2700) digits
  • For 1 to 100, the session computes:
    • Total digits = (9 + 180 + 3 = \mathbf{192})

7) “How many digits needed for all binary/2-digit numbers” (MCQ style)

Interpreting “binary digit numbers” as 2-digit numbers (count of all 2-digit numerals):

  • Number of 2-digit integers = 90
  • Digits needed = (90 \times 2 = \mathbf{180})

8) Differences between largest n-digit and smallest (n+1)-digit numbers

  • Largest n-digit numbers: 9, 99, 999, …
  • Smallest (n+1)-digit numbers: 10, 100, 1000, …
  • The session notes a consistent pattern in reasoning, and for the practiced MCQ example, the selected difference corresponds to 1.
  • A concrete example practiced in class:
    • Between 97 (largest 2-digit prime) and 11 (smallest 2-digit prime) → 86

9) Prime-number MCQs: definitions + divisibility rule method

Smallest non-negative prime integer

  • “Non-negative prime” means prime number ≥ 0 (not negative).
  • Smallest such prime: 2

Statement: “A prime number has only two divisors”

  • Prime numbers are divisible only by 1 and itself → exactly 2 divisors.

“Which statement is not true?”

  • Distractor identified:
    • “All prime numbers are odd” is false because 2 is an even prime.
  • Selected option: D (as per session).

Counting primes less than a number (memorized thresholds)

The instructor provides counts to remember:

  • Primes from 1 to 50 = 15
  • Primes from 1 to 100 = 25
  • Primes from 1 to 200 = 46
  • Primes from 1 to 1000 = 168

Also:

  • For “less than 50,” the taught interpretation uses the 1 to 50 count: 15.

Sum of first nine primes (process reminder)

  • The transcript shows confusion, but the intended core idea:
    • Use a known set of the first primes (later listing includes values like 2, 3, 5, 7, 11, 13, 17, 19, …).

“Which number is not a prime?”

Method:

  • Apply divisibility rules:
    • If divisible by any number other than 1 and itself, it’s not prime.
  • Example:
    • 231 divisible by 7 → not prime

“Which number is prime?”

Method:

  • Use divisibility checks by small prime factors based on options.
  • Example result from class:
    • Only 173 remains prime (as claimed).

Single-digit primes total & differences

  • Single-digit primes: 2, 3, 5, 7
  • Total: 4
  • Difference between largest and smallest:
    • (7 - 2 = \mathbf{5})

10) Twin primes and “co-prime” distinction (important conceptual separation)

Twin primes

  • Also called:
    • binary difference primes
    • double difference primes
  • Definition taught:
    • Two primes with difference = 2
  • Examples listed:
    • (3,5), (5,7), (11,13), (17,19), (41,43), (71,73), etc.

Coprime (co-prime)

  • Definition taught:
    • Two numbers are coprime if their HCF (GCD) = 1
  • Instructor emphasizes:
    • Twin primes are always prime pairs.
    • Coprime pairs can include composite numbers (example discussions: 10 and 21).

Overall structure of the session

  • Warm-up and motivation for exam preparation.
  • MCQ-by-MCQ practice across:
    • Number system names and zero principle
    • Integer properties and digit/counting problems
    • Total digits required for writing ranges
    • Prime definitions, prime counting, and primality testing
    • Special topic: twin primes vs coprimes
  • Ends with guidance to be regular in practicing PYQs/MCQs and revisiting linked theory.

Speakers / sources featured

  • Single instructor/teacher speaker (referred to with greetings/names like “Chaudhary saheb” and “D Kumar ji,” but appearing as the same main teacher throughout).
  • Student voices mentioned in subtitles:
    • D Kumar ji, Rachna, DK / D Kumar, Piyush Kabra ji, Vicky ji, Rihanna Sheikh, Dhar Saheb, Tie Master, Amrish, Tanishq ji, Divya Char, Kabra ji (same as Piyush Kabra reference), Vicky Chaudhary sahab, Tanvi ji.
  • Historical/mathematical sources named within lessons/questions:
    • Nagarjuna
    • Aryabhatta (Aryabhata)
    • Varahamira (appearing as an option)
    • Kanishka (mentioned while defining Nagarjuna in the transcript)

Original video