Numbers are the fundamental units of mathematics. In this article, we will discuss numbers, their types, important facts, divisibility rules, and other important points about numbers for aptitude preparation.
Types of Numbers
- Integers: All numbers whose fractional part is 0 (zero), like -3, -2, 1, 0, 10, and 100, are integers.
- Natural Numbers: Counting numbers like 1, 2, 3, 4, 5, 6 ... Basically, all integers greater than 0 are natural numbers.
- Whole Numbers: All natural numbers and 0 (zero) are whole numbers.
- Prime Numbers: All numbers having only two distinct factors, the number itself and 1, are called prime numbers. Some prime numbers are 2, 3, 53, 67, and 191.
- Composite Number: All numbers greater than 1 that are NOT prime are composite numbers. Some composite numbers are 4, 60, 91, and 100.
Types of NumbersImportant Points on Prime Numbers
- 0 and 1 are neither prime nor composite.
- 2 is the only even prime number.
- There are 25 prime numbers less than 100. They are : 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.
- To check if a number 'p' is prime, find a number 'n' such that 'n' is the smallest natural number that satisfies n2 >= p. Now, check if 'p' is divisible by any of the prime numbers less than or equal to 'n'. If 'p' is NOT divisible by any such prime numbers, 'p' is a prime number. Otherwise, p is not a prime number.
- Co-primes : Two numbers 'a' and 'b' are called co-prime if their highest common factor (HCF) is 1.
- We can find the count of divisors of a number using prime factorization. If prime factorization of a number n is p1e1 x p2e2 x p3e3 ... pkek. then the number of divisors of n are (e1 + 1) x (e2 + 1) x (e3 + 1) x .... (ek + 1). For example, 200 can be written as 2352. The number of divisors of 200 is (3 + 1) x (2 + 1) = 12.
Read More: Interesting Facts on Prime Numbers and Prime Factorization Tips and Tricks for more details.
Divisibility Rules
Here's a table summarizing the divisibility rule of common numbers:
Divisibility by Number | Rule | Example |
|---|
Divisibility By 2 | The last digit should be even. | 124 last digit is 4( even), so it is divisible by 2. |
|---|
Divisibility By 3 | The sum of its digits should be divisible by 3. | 12321 divisible by 3 because 1 + 2 + 3 + 2 + 1 = 9 and 9 is divisible by 3. |
|---|
Divisibility By 4 | The last two digits should be divisible by 4. | 1232 is divisible by 4 as the last two digits 32 are divisible by 4. |
|---|
Divisibility By 5 | The last digit is either 0 or 5. | 85 last digit is 5, so 5 is divisible by 5. |
|---|
Divisibility By 6 | The number should be divisible by both 2 and 3. | 114 is divisible by 6 as it is divisible by both 2 and 3: - 2(the last digit is 4)
- 3 (1 + 1 + 4 = 6, 6 is divisible by 3).
|
|---|
Divisibility By 7 | Remove last digit from the number then Double the last digit, subtract it from the rest of the number, and if the result is divisible by 7, the number is divisible by 7. | 196 is divisible by 7 - Remove the last digit, we get 19.
- Double the last digit: 12
- Subtract it from the rest of the number: 19 - 12 = 7
- After subtracting 12 (double of removed digit), we get 7.
- Since the last left digit is 7, number is multiple of 7.
|
|---|
Divisibility By 8 | The last three digits should be divisible by 8. | 1232 is divisible by 8 as the last three digits 232 is divisible by 8. |
|---|
Divisibility By 9 | The sum of its digits is divisible by 9. | 12321 is divisible by 3 because 1 + 2 + 3 + 2 + 1 = 9 and 9 is divisible by 9. |
|---|
Divisibility By 11 | The difference between the sum of numbers at even positions and odd positions is either 0 or a multiple of 11. | 121 is divisible by 11 as - The sum of odd position 1 + 1 = 2 and
- The sum of even position 2 as we
Find the difference 2 - 2 = 0. which is divisible by 11. |
|---|
Other Useful Rules
- If we repeat a three-digit number twice, to form a six-digit number. The result will be divisible by 7, 11, and 13, and dividing by all three will give your original three-digit number.
- A number of form 2N has exactly N+1 divisors.
- For example: 4 has 3 divisors, 1, 2, and 4.
Read More: Divisibility Rules 1 to 19
Note : If 'p' and 'q' are co-primes and we have a number 'n' that is divisible by both 'p' and 'q', 'n' will be divisible by p x q.
For example, 48 is divisible by both 3 and 8 and also by 3 x 8 = 24.
But, if 'p' and 'q' are NOT co-prime, then the fact that 'n' would be divisible by p x q given that 'n' is divisible by both 'p' and 'q' is not necessary. For example, 144 is divisible by both 8 and 12 (not co-prime), but it is not divisible by 8 x 12 = 96.
Remainder Facts
The table summarizes the remainder rules for different divisors, providing a quick and easy way to determine the remainder without performing full division. Each rule is accompanied by an example for clarity.
Remainder | Rule | Example |
|---|
Remainder when Dividing by 2 | - If the last digit is odd, the remainder is 1.
- If it's even, the remainder is 0.
| 37 → the last digit is 7 (odd), so remainder = 1 when divided by 2. |
|---|
Remainder when Dividing by 3 | Sum the digits of the number. Find the remainder of this sum when divided by 3. | 23 → Sum of digits 2 + 3 = 5. 5 ÷ 3 = 2. So, remainder = 2. |
|---|
Remainder when Dividing by 4 | Take the last two digits of the number, divide them by 4, and the remainder is the remainder of the original number. | 123 → Take the last two digits 23. 23 ÷ 4 = 5 with remainder 3. So, remainder = 3. |
|---|
Remainder when Dividing by 5 | Divide the last digit of the number by 5 to get the remainder. | 32 → The last digit is 2. 2 ÷ 5 = 0.4 with remainder = 2. So, remainder = 2. |
|---|
Remainder when Dividing by 6 | Apply both the remainder rules for 2 and 3. - If both are 0, the remainder is 0.
- Otherwise, you have to calculate accordingly.
| 35 → Remainder when divided by 2 is 1 (odd number), and remainder when divided by 3 is 2. So, the remainder is 5 when divided by 6. |
|---|
Remainder when Dividing by 7 | - Break the number into groups of three and calculate modulo 7 for each.
- Take the alternating sum of the remainder.
- Then Find the modulo 7 of the alternating sum to get the final result.
| 198 → 8 is removed digit become 19, 8 is doubled and subtracted from 19, results 8. So remainder = 1.
|
|---|
Remainder when Dividing by 8 | Take the last three digits, divide by 8, and the remainder is the remainder of the original number. | 1,476 → Take the last three digits 476. 476 ÷ 8 gives the remainder 4. So, remainder = 4. |
|---|
Remainder when Dividing by 9 | Sum the digits of the number. The remainder when this sum is divided by 9 is the remainder of the original number. | 1234 → Sum of digits 1 + 2 + 3 + 4 = 10. 10 ÷ 9 = 1 remainder. So, remainder = 1. |
|---|
Division Theorem
Dividend = (Divisor x Quotient) + Remainder
1. (xn - an) is divisible by (x - a) for all values of n.
For example:
- For n = 2, x2 - a2 = (x - a) (x + a), which is divisible by (x - a).
- Similarly, for n = 3, x3 - a3 = (x - a) (x2 + a2 + xa), which is divisible by (x - a).
2. (xn - an) is divisible by (x + a) for all even values of n.
For example:
- For n = 2, x2 - a2 = (x - a) (x + a), which is divisible by (x + a).
- Similarly, for n = 3, x3 - a3 = (x - a) (x2 + a2 + xa), which is not divisible by (x + a).
3. (xn + an) is divisible by (x + a) for all odd values of n.
For example:
For n = 3, x3 + a3 = (x + a) (x2 + a2 - xa), which is divisible by (x + a).
Check: Euclid Division Lemma
Cyclicity of Numbers
The cyclicity of any number is mainly focused on its unit digit. Every unit digit has its own repetitive pattern when raised to any power.
- Digits 0, 1, 5, and 6: Here, when each of these digits is raised to any power, the unit digit of the final answer is the number itself.
Examples:
1. 52 = 25: Unit digit is 5
2. 16 = 1: Unit digit is 1
3. 04 = 0: Unit digit is 0
4. 63 = 216: Unit digit is 6
- Digits 4 and 9: Both of these two digits, 4 and 9, have a cyclicity of two different digits as their unit digit.
Examples:
42 = 16: Unit digit is 6.
43 = 64: Unit digit is 4.
92 = 81: Unit digit is 1.
93 = 729: Unit digit is 9.
- Digit 2 has a cyclicity of four different numbers: 2,4,8,6.
- Digit 3 has a cyclicity of four different numbers: 3, 9, 7, 1.
- Digit 7 has a cyclicity of four different numbers: 7, 9, 3, 1.
- Digit 8 has a cyclicity of four different numbers: 8, 4, 2, 6.
Read in Detail: Cyclicity of Numbers
Also Check:
Similar Reads
Vocabulary for CAT and Aptitude Related Exams | Set 2 Prerequisite - Vocabulary for CAT and Aptitude Related Exams This article is about the words that appear regularly in the vocabulary part of the CAT exam and aptitude related exams. This article is all about the words that start with the letter 'B'. S.No. Word Definition 1 babble to talk foolishly o
4 min read
TechMonastic Solutions Interview Experience Coding Round: Print the Nth number of the series: 0,0,550,275,1100,550,1650,825,2200,1100,2750,1375,3300,1650,3850,1925,4400,2200,.... Input: N = 8 Output: 825 Input: N = 11 Output: 2750 Take a string as an input. Then find frequency of a particular character. Secondly, convert first characters of e
1 min read
Cuemath Interview Experience | Set 1 (For Backend Engineer) 1) Technical Round (Skype): Print all palindromic substrings of the given string. In a given binary tree, find the size of the largest BST. 2) Technical Round (Skype): Find the height of a tree. Print all paths with this height. Discussion on projects. 3) Technical Round (Skype): Discussion on proje
1 min read
Hangman Game in Java Hangman is a popular word guessing game where the player endeavors to construct a lost word by speculating one letter at a time. After a certain number of off base surmises, the game finishes and the player loses. The game also finishes when the player accurately distinguishes all the letters of the
6 min read
Factorial Coding Problems Factorial of a number n is defined as the product of all the positive numbers less than n. In other words, Factorial of a number n can be calculated as: n × (n – 1) × (n – 2) × … × 1. Factorial of a number n is denoted as n!. It is widely used in Combinatorics and Algebra to find the number of ways
1 min read