Login
OR
Don't worry. We'll fix this for you!
Natural numbers are the most basic and familiar numbers we use in everyday life. They are the numbers we count with - 1, 2, 3, and so on. These numbers help us answer questions like "How many apples are there?" or "What position did you finish in the race?" Because of this, natural numbers are often called the counting numbers.
Natural numbers form the foundation of the entire number system. Understanding them well is crucial before moving on to more complex types of numbers like whole numbers, integers, and rational numbers.
In this chapter, we will explore what natural numbers are, their properties, how they relate to other number sets, and their applications in various mathematical operations and competitive exam problems.
Definition: The set of natural numbers is usually denoted by N and defined as:
N = {1, 2, 3, 4, 5, ...}
These are all the positive integers starting from 1 and increasing without end.
Note: Some texts include 0 in natural numbers, but for clarity and consistency in this book, natural numbers start from 1. Zero belongs to the set of whole numbers, which we will discuss shortly.
Key Properties of Natural Numbers:
These properties make natural numbers a fundamental building block for arithmetic and number theory.
Natural numbers are part of a larger family of numbers. Understanding how they fit into this hierarchy helps clarify their role and properties.
Whole Numbers: These include all natural numbers plus zero. Symbolically, Whole Numbers = N ∪ {0} = {0, 1, 2, 3, ...}.
Integers: These include all whole numbers and their negative counterparts: {..., -3, -2, -1, 0, 1, 2, 3, ...}.
Rational Numbers: Numbers that can be expressed as a fraction \(\frac{p}{q}\), where \(p\) and \(q\) are integers and \(q eq 0\). This set includes integers, fractions, and decimals that terminate or repeat.
This diagram shows the hierarchical inclusion:
Divisibility rules help quickly determine if a natural number is divisible by another without performing full division. This is especially useful in competitive exams where speed matters.
| Divisor | Divisibility Rule | Example |
|---|---|---|
| 2 | Number ends with 0, 2, 4, 6, or 8 | 124 is divisible by 2 |
| 3 | Sum of digits divisible by 3 | 123 -> 1+2+3=6, divisible by 3 |
| 5 | Number ends with 0 or 5 | 135 is divisible by 5 |
| 9 | Sum of digits divisible by 9 | 729 -> 7+2+9=18, divisible by 9 |
| 10 | Number ends with 0 | 230 is divisible by 10 |
Prime Numbers: Natural numbers greater than 1 that have exactly two distinct positive divisors: 1 and the number itself. Examples: 2, 3, 5, 7, 11.
Composite Numbers: Natural numbers greater than 1 that have more than two positive divisors. Examples: 4 (1,2,4), 6 (1,2,3,6), 12 (1,2,3,4,6,12).
Note: The number 1 is neither prime nor composite.
Prime numbers are the "building blocks" of natural numbers because every natural number greater than 1 can be expressed as a product of primes. This is called prime factorization.
Greatest Common Divisor (GCD): The largest natural number that divides two or more numbers without leaving a remainder.
Least Common Multiple (LCM): The smallest natural number that is a multiple of two or more numbers.
Both GCD and LCM are useful in simplifying fractions, solving problems involving ratios, and many other applications.
graph TD Start[Start: Given two numbers a and b] CheckRemainder{Is remainder r = 0?} CalculateRemainder[Calculate r = a mod b] UpdateValues[a = b, b = r] Result[GCD is b] Start --> CalculateRemainder CalculateRemainder --> CheckRemainder CheckRemainder -- No --> UpdateValues UpdateValues --> CalculateRemainder CheckRemainder -- Yes --> ResultThis flowchart shows Euclid's algorithm for finding the GCD efficiently:
Step 1: Find prime factorization of each number.
36 = 2 x 2 x 3 x 3 = \(2^2 \times 3^2\)
48 = 2 x 2 x 2 x 3 = \(2^3 \times 3^1\)
Step 2: For GCD, take the minimum powers of common primes.
GCD = \(2^{\min(2,3)} \times 3^{\min(2,1)} = 2^2 \times 3^1 = 4 \times 3 = 12\)
Step 3: For LCM, take the maximum powers of all primes.
LCM = \(2^{\max(2,3)} \times 3^{\max(2,1)} = 2^3 \times 3^2 = 8 \times 9 = 72\)
Answer: GCD = 12, LCM = 72
Step 1: Check divisibility by 3 by summing digits.
Sum of digits = 1 + 2 + 3 + 4 + 5 = 15
Since 15 is divisible by 3, 12345 is divisible by 3.
Step 2: Check divisibility by 5 by looking at the last digit.
Last digit is 5, so 12345 is divisible by 5.
Answer: 12345 is divisible by both 3 and 5.
Step 1: Start dividing by the smallest prime number 2.
210 / 2 = 105
Step 2: Divide 105 by the next smallest prime, 3.
105 / 3 = 35
Step 3: Divide 35 by 5.
35 / 5 = 7
Step 4: 7 is a prime number.
Step 5: Write the prime factors.
210 = 2 x 3 x 5 x 7
Answer: Prime factorization of 210 is \(2 \times 3 \times 5 \times 7\).
Step 1: Use the divisibility rule for 9: sum of digits.
Sum of digits = 2 + 3 + 4 + 5 + 6 + 7 + 8 = 35
Step 2: Divide 35 by 9.
35 / 9 = 3 remainder 8
Step 3: The remainder when 2,345,678 is divided by 9 is 8.
Answer: Remainder = 8
Step 1: Convert 45 to binary by dividing by 2 repeatedly and recording remainders.
Write remainders in reverse: 101101
So, 45 in binary is 101101.
Step 2: Convert 45 to hexadecimal by dividing by 16.
13 in hexadecimal is D.
Write quotient and remainder: 2 (quotient), D (remainder)
So, 45 in hexadecimal is 2D.
Answer: Binary: 101101, Hexadecimal: 2D
When to use: To avoid long division when checking large numbers.
When to use: When dealing with multiple numbers or when Euclid's algorithm is less convenient.
When to use: Competitive exams where time is limited.
When to use: Converting decimal to binary, octal, or hexadecimal.
When to use: When prime factorization is time-consuming or difficult.
Progress tracking is paywalled — subscribe to mark subtopics as understood and save your streak.
Go to practice →
Your Score
Your Rank
| Rank | Name | Score |
|---|