# Thread: Divisors from Prime Factors

1. ## Divisors from Prime Factors

Hello all,

Suppose I have prime factors of a number , from the prime factors how can I find distinct divisors of a number.

Eg :
12 = 2*2*3 ( I have 2,2,3 as prime factors )

I need to find divisors of 12 or atleast Number of distinct divisors of 12 ( 4 in this case )
2,3,4,6

2. Well, if n is decomposed as
$\displaystyle n=p1^{\alpha_1}p_2^{\alpha 2}\dots p_k^{\alpha_k}$
all divisors of n are of the form
$\displaystyle n=p1^{\beta_1}p_2^{\beta 2}\dots p_k^{\beta_k}$
where
$\displaystyle 0\leq \beta_j\leq \alpha_j$
Note that
$\displaystyle \beta_j has(\alpha_j+1)$
possible values, hence the total number of divisors of n is
$\displaystyle (\alpha_1+1)(\alpha_2+2)...(\alpha_k+1)$
For example 12=2^2.3^1
$\displaystyle \alpha_1=2,\alpha_2=1$
and 12 has (2+1)(1+1)=6 divisors: 1,2,3,4,6,12.

3. (a1 + 1)(a2 + 2)..... (ak + 1)
are you sure (a2+2) or (a2+1) ?
also assuming its all additive to 1
say 16 = 2^4;
whats the number of divisors from this method ?

Tanvi

Thanks lot for the head start !

4. Of course, I meant (a2+1), it's a typo-

For 16=2^4:

you only have one alpha: alpha_1=4, hence (4+1) divisors: 1,2,4,8, and 16.

Greetings

5. Thanks it helped !!