Factors of n 2 n^2 and n n

Let n = 2 23 3 17 n=2^{23}3^{17} . How many factors of n 2 n^2 are less than n n , but do not divide n n ?


The answer is 391.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Sathvik Acharya
Apr 4, 2019

Let n = p 1 q 1 p 2 q 2 n=p_1^{q_1}p_2^{q_2} , which implies n 2 = p 1 2 q 1 p 2 2 q 2 n^2=p_1^{2q_1}p_2^{2q_2} for some prime p 1 , p 2 p_1,p_2 . The number of divisors of n n is ( q 1 + 1 ) ( q 2 + 1 ) (q_1+1)(q_2+1) and n 2 n^2 is ( 2 q 1 + 1 ) ( 2 q 2 + 1 ) (2q_1+1)(2q_2+1) .

Consider the factors of n 2 n^2 other than n . n. Note that the number of such factors greater than n n are equal to the factors less than n n (If we group all of these factors (excluding n n ) into pairs that multiply to n 2 n^2 , then one factor per pair is less than n n ). Therefore the number of factors of n 2 n^2 less than n n is ( 2 q 1 + 1 ) ( 2 q 2 + 1 ) 1 2 = 2 q 1 q 2 + q 1 + q 2 \frac{(2q_1+1)(2q_2+1)-1}{2}= 2q_1q_2+q_1+q_2 . Whereas the number of factors of n n other than itself is ( q 1 + 1 ) ( q 2 + 1 ) 1 = q 1 q 2 + q 1 + q 2 (q_1+1)(q_2+1)-1=q_1q_2+q_1+q_2

Thus the number of factors less than n n but do not divide n n are ( 2 q 1 q 2 + q 1 + q 2 ) ( q 1 q 2 + q 1 + q 2 ) = q 1 q 2 (2q_1q_2+q_1+q_2)-(q_1q_2+q_1+q_2)=q_1q_2 . In this case q 1 q 2 = 23 × 17 = 391 . q_1q_2=23 \times 17=\boxed{391}.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...