## Divisors of a Number ( Number of Divisors of a number)

How do we find divisors of a number? For example, how do we calculate the number of divisors of 900?

Answer: 900 = 2^{2} × 3^{2} × 5^{2}. Therefore, any number that is a factor of 900 can have powers of 2 equal to 2^{0}, 2^{1} or 2^{2}. Similarly, for 3, the powers can be 3^{0}, 3^{1}, or 3^{2} and for 5 they will be 5^{0}, 5^{1}, or 5^{2}. Writing the powers in a line we have-

Now any combination of a power of 2, a power of 3, and a power of 5 will give us a divisor. For example, in the figure, 2^{1} × 3^{2} × 5^{1} will be a divisor of 900. As we can select a power of 2 in 3 ways, a power of 3 in 3 ways, and a power of 5 in 3 ways, the total number of combinations will be 3 × 3 × 3 = 27. Therefore, the number of divisors of 900 is 27.

**Find the number of divisors of 15000.**

Answer: 15000 = 2^{3} × 3 × 5^{4}. The powers of various prime factors in a divisor can be:

2 – 2^{0}, 2^{1}, 2^{2}, or 2^{3}.

3 – 3^{0} or 3^{1}

5 – 5^{0}, 5^{1}, 5^{2}, 5^{3}, or 5^{4}.

Again, the total number of combinations- and hence the total number of divisors- will be 4 × 2 × 5 = 40.

**Find the number of odd divisors (divisors which are odd numbers) of 15000.**

Answer: Odd numbers are not divisible by 2, and therefore in an odd divisor, there will not be a power of 2. Therefore, we will only consider powers of 3 and 5. Hence, the total number of combinations- and hence the total number of divisors- in this case, will be 2 × 5 = 10

**Find the number of even divisors of 15000.**

Number of even divisors = Total number of divisors – number of odd divisors

= 40 – 10 = 30.

**Find the number of divisors of 15000 that are perfect squares.**

Answer: **In a perfect square, the power of every prime factor is even**. Therefore, we will only consider those divisors of 15000 in which powers of prime factors are even. In other words, we will only consider even powers of prime factors. We write down only the even powers of prime factors

We can see that now the number of possible combinations = 2 × 1 × 3 = 6.

Therefore, 6 divisors of 15000 are perfect squares.

**Find the number of divisors of 7! that are odd.**

Answer: This question is same as the earlier question except that now we will first have to do prime factorization of 7!. For that, we will have to find powers of the prime factors in 7!. The prime factors present in 7! will be 2, 3, 5 and 7. Their respective powers are:

Therefore, 7! = 2^{4} × 3^{2} × 5 × 7. To find odd divisors of 7!, we ignore the powers of 2 and then calculate the number of combinations of powers of 3, 5, and 7. The number of combinations = 3 × 2 × 2 = 12. Therefore, there are 12 odd divisors of 7!.

http://tathagat.mba/forums/number-system/divisors-2/

http://tathagatclasses.com/cbt/

https://www.facebook.com/TathaGat-TG-322585324466418/?ref=settings

## 3 Comments