Question Number 175766 by BaliramKumar last updated on 06/Sep/22

Commented by mr W last updated on 06/Sep/22

Answered by aleks041103 last updated on 06/Sep/22
![let s(n) be the number of composite factors of n. let n=p_1 ^r_1 p_2 ^r_2 ...p_k ^r_k , where p_(1,2,..,k) are primes and r_(1,2,...,k) ∈N={1,2,...} any factor f of n must be of the form: f=p_1 ^t_1 p_2 ^t_2 ...p_k ^t_k , where 0≤t_i ≤r_i . ⇒ for t_i we have r_i +1 possibilities. ⇒#factors of n=Π_(i=1) ^k (1+r_i )=σ(n) out of those σ(n) factors the noncomposite are 1,p_1 ,p_2 ,...,p_k , i.e. k+1. ⇒s(n)=σ(n)−k−1 ⇒s(n)=[Π_(i=1) ^k (1+r_i )]−k−1 Now, the composite factors are 2 types devisible by p_q and not devisible by p_q . The ones not devisible by p_q are all the composite factors of (n/p_q ^r_q ) ⇒The answer is: s(n)−s((n/p_q ^r_q ))= { (([r_q Π_(i=1,i≠q) ^k (1+r_i )]−1 , p_q ∣n)),(([r_q Π_(i=1,i≠q) ^k (1+r_i )] , p_q ∤n)) :} in our case: 2520=2.5.2.2.7.9=2^3 .3^2 .5.7 ⇒ ans.=3(2+1)(1+1)(1+1)−1= =3.3.2.2−1=35 ⇒Ans. 35](https://www.tinkutara.com/question/Q175771.png)
Commented by aleks041103 last updated on 06/Sep/22

Commented by mr W last updated on 06/Sep/22

Commented by BaliramKumar last updated on 06/Sep/22

Commented by aleks041103 last updated on 07/Sep/22
