Objectives
- Factors and Multiples
- Prime factorization method
- Number of factors of a given number
- Number of ways to express a number as the product of two factors
- Sum of all the factors of a given number
- Number of ways to express a number as the product of two co-prime factors
- Euler's
ϕ
- function
- Sum of all co-prime factors of given number
- LCM and HCF application on Remainders
- Factorial and its properties
- Largest power of a factor in n!
- Unit digit of an exponential expression
- Last two digits of an exponential expression
Multiple
If x is a multiple of y, where x and y are natural numbers, then;, k should be natural number.
In general, if
and
Divisibility
Ifis divisible by
16 is a multiple of 4 but not a multiple of -4.
16 is divisible by both 4 and -4.
Note: 0 (zero) is divisible by all integers except '0'.
16 is divisible by both 4 and -4.
Note: 0 (zero) is divisible by all integers except '0'.
Important concepts on factors
Concept I: Factors of natural number
Let us consider a number 12. Factors of 12 are 1, 2, 3, 4, 6 and 12. There are 6 factors for 12.Similarly factors of 30 are 1, 2, 3, 5, 6, 10, 15 and 30. There are 8 factors for 30.
Key points
- All perfect squares have an odd number of factors
- Perfect square of any prime number has exactly 3 factors
- All non-perfect squares have even number of factors
- Perfect numbers: If the sum of all factors (except that number itself) of a number is equal to the number itself is called a perfect number
1, 2, 3
Sum of above factors = 1 + 2 + 3 = 6
28 and 496 are the other perfect numbers in the first 1000 natural numbers.
Concept II: Prime factorization
All natural numbers except 1 can be expressed in its prime factorization form. Simply a natural number greater than 1 is the suitable combination of its prime factors.Eg:
Concept III: Number of factors of a natural number
If 'N' a natural number and..., where a, b, c... are the distinct prime factors of N and p, q, r... are natural numbers which are representing the occurrence of corresponding prime factors in N.
Number of factors of N (including 1 and N) = (p+1)(q+1)(r+1)
...
Find the number of factors of 10, 30 100 and 1024
Concept IV: Number of ways to express a number as the product of two factors
If N is a non-perfect square (number of factors should be even)
Then the number of ways to express N as the product of two factors = number of factors2
If N is a perfect square
Then the number of ways to express N as the product of any two factors = number of factors +12
If N is a perfect square
Then the number of ways to express N as the product of two DISTINCT factors = number of factors −12
Let us consider the number 30, it can be expressed as the product of two factors in the following ways:
,
i.e. 30 can be expressed as the product of two factors in 4 ways. This is half the total number of factors of 30. i.e. the total number of factors of 30 is 8.
Consider another number 36, it's factors are: 1, 2, 3, 4, 6, 9, 12, 18, 36 (Total 9 factors)
36 can be expressed as the product of two factors in the following ways:
,
Concept V: Sum of all factors
If 'N' a natural number and..., where a, b, c... are the distinct prime factors of N and p, q, r... are natural numbers which are representing the occurrence of corresponding prime factors in N.
Sum of all factors of N (including 1 and N)
Sum of all factors of N (including 1 and N) = (a0+a1+a2+...+ap)(b0+b1+b2+...+bq)(c0+c1+c2+...+cr)...
OR
Find the sum of all factors of 60?
Sum of all factors of 60
Concept VI: Number of ways to express a number as the product of two relatively prime factors
If 'N' a natural number and..., where a, b, c... are the distinct prime factors of N and p, q, r.... are natural numbers which are representing the occurrence of corresponding prime factors in N.
Then the number of ways to express N as the product of two co-primes = 2n−1
, where n is the number of distinct prime factors of N.
How many different ways 30 can be expressed as the product of two relatively prime factors ?
And the required expressions are
. Note: 1 is relatively prime to all natural numbers except 1.
Euler's ϕ
function or relatively prime to N, which are less than N.
Euler's ϕ
(phy) function is defined as
the number of all co-primes to N, which are less than N.
..., where a, b, c... are the distinct prime factors of N and p, q, r.... are natural numbers which are representing the occurrence of corresponding prime factors in N.
... `
If p is relatively prime to 24 and p < 24. How
many such values are possible for p? OR Find the number of co-primes to
24, which are less than 24.?
Hence there are 8 possible values for p(1, 5, 7, 11, 13, 17, 19, 23).
Concept VIII: Sum of all relatively prime numbers to N, which are less than N.
This is the extension of the above result. Here we are finding the sum of all co-primes to N which are less than N.
Find the sum of all co-primes to 24, which are less than 24.?
No comments:
Post a Comment