Crazy divisors

Let n = 2 31 × 3 19 n = 2^{31} \times 3^{19} . How many divisors of n 2 n^2 are less than n n but do not divide n n ?


The answer is 589.

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.

3 solutions

Adriana Batalha
Aug 18, 2015

If k n k \neq n is a factor of n 2 n^2 , then so is n 2 / k n^2/k . This means that, other than n n , the factors of n 2 n^2 come in pairs.

If k < n k < n then n 2 k > n \frac{n^2}{k} > n and vice-versa, so we can conclude that half of the factors (different than n n ) are greater than n n and half are less than n n .

Since n 2 = 2 62 × 3 38 n^2 = 2^{62} \times 3^{38} , it has ( 62 + 1 ) ( 38 + 1 ) 1 = 2456 (62+1)(38+1) - 1 = 2456 factors other than n n , of which 2456 2 = 1228 \frac{2456}{2} = 1228 are less than n n .

Now we just have to subtract the ones that are also factors of n n . Since n = 2 31 × 3 19 n = 2^{31} \times 3^{19} , it has ( 31 + 1 ) ( 19 + 1 ) 1 = 639 (31+1)(19+1) - 1 = 639 factors other than n n . Subtracting the two we have 1228 639 = 589 1228 - 639 = 589 .

Kevin Yang
Oct 26, 2018

i) let's start how many dividers n 2 n^2 have. : τ ( n 2 ) = ( 62 + 1 ) ( 38 + 1 ) = 2457 \tau(n^2)=(62+1)*(38+1)=2457 ii) than let's think how many divder's is < n <n : ( τ ( n 2 ) 1 ) / 2 = ( 2457 1 ) / 2 = 1228 (\tau(n^2)-1)/2=(2457-1)/2=1228 (cause except n n , we can pair the divider which is < n <n and > n >n a b = n 2 a*b=n^2 iii) also, let's think how many n n 's divder is < n <n : τ ( n ) 1 = ( 31 + 1 ) ( 19 + 1 ) 1 = 639 \tau(n)-1=(31+1)*(19+1)-1=639 (except n n ) Answer is ii)-iii) 1228 639 = 589 1228-639=589

Chew-Seong Cheong
Jun 13, 2015

The divisors of n 2 n^2 less than n n but do not divide n n are divisors with power of 2 2 , p > 31 p > 31 or power of 3 3 , q > 19 q > 19 and 2 p 3 q < n 2^p3^q < n .

From 2 p 3 q < n p log 2 + q log 3 < log n 2^p3^q < n \Longrightarrow p \log{2} + q \log{3} < \log{n} , we find that the largest p p is log n log 2 = 61 \left \lfloor \frac{\log{n}}{\log{2}}\right \rfloor = 61 and that of q q is log n log 3 = 38 \left \lfloor \frac{\log{n}}{\log{3}}\right \rfloor = 38 . We note that when q = 38 , 37 , 36 q = 38, 37, 36 the largest p q = 0 , 2 , 4 p_{q}= 0,2,4 , therefore the qualified divisors with 3 38 3^{38} , 3 37 3^{37} and 3 36 3^{36} as factors are 1 ( 0 + 1 ) 1(0+1) , 3 ( 2 + 1 ) 3(2+1) and 5 ( 4 + 1 ) 5(4+1) respectively. There are corresponding q p q_p for each p p . Therefore, the total number of these divisors are given by:

N = q = 20 38 ( p q + 1 ) + p = 32 61 ( q p + 1 ) = q = 20 38 ( log n q log 3 log 2 + 1 ) + p = 32 61 ( log n p log 2 log 3 + 1 ) = 297 + 292 = 589 \begin{aligned} N & = \sum_{q=20}^{38} {(p_q+1)} + \sum_{p=32}^{61} {(q_p+1)} \\ & = \sum_{q=20}^{38} {\left( \left \lfloor \frac{\log{n}-q \log{3}}{\log{2}} \right \rfloor +1 \right)} + \sum_{p=32}^{61} {\left( \left \lfloor \frac{\log{n}-p \log{2}}{\log{3}} \right \rfloor +1 \right)} \\ & = 297 + 292 = \boxed{589} \end{aligned}

Moderator note:

Way too complicated. Find a simpler way.

Hint: How many divisors of n 2 n^2 are less than n n and divide n n ?

Hint: How many divisors of n^2 are less than n and divide n? Ans 639. What is the next step?

BK Lim - 5 years, 11 months ago

Log in to reply

(Number of divisors of n^2 less than n that divide n) + (Number of divisors of n^2 less than n that doesn't divide n) = (Number of divisors of n^2)

Pi Han Goh - 5 years, 11 months ago

Log in to reply

And the no. of divisors which are greater than n....???

Sarthak Behera - 5 years, 11 months ago

Note that 31 * 19=589...

Sarthak Behera - 5 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...