Divisor squared?

If N N is a positive integer with precisely 18 positive divisors, then which of the following cannot be the total number of positive divisors of N 2 ? N^2?

35 55 75 95

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

Vu Vincent
Aug 19, 2017

Consider N = p 1 k 1 p 2 k 2 . . . p j k j N = p_{1}^{k_1}p_{2}^{k_2}...p_{j}^{k_j} as in canonical representation, then it has τ ( N ) = ( k 1 + 1 ) ( k 2 + 1 ) . . . ( k j + 1 ) \tau(N) = (k_{1} +1)(k_{2} +1)...(k_{j} +1) divisors. We have N 2 = ( p 1 k 1 p 2 k 2 . . . p j k j ) 2 = p 1 2 k 1 p 2 2 k 2 . . . p j 2 k j N^2 = (p_{1}^{k_1}p_{2}^{k_2}...p_{j}^{k_j})^2 = p_{1}^{2k_1}p_{2}^{2k_2}...p_{j}^{2k_j} which has τ ( N 2 ) = ( 2 k 1 + 1 ) ( 2 k 2 + 1 ) . . . ( 2 k j + 1 ) \tau(N^2) = (2k_{1} +1)(2k_{2} +1)...(2k_{j} +1) divisors. Now, this means that if we were to check for the possible values for τ ( N 2 ) \tau(N^2) given τ ( N ) \tau(N) , then we just need to add each of the k i k_i 's to each of the respective product term's ( k i + 1 ) (k_i + 1) in τ ( N ) \tau(N) .

To do this, we are going to try to split 18 into products of terms, then using the "split" 18s, we can compare terms-by-terms correspondence with τ ( N ) \tau(N) , then use that in order to form all possible values of τ ( N 2 ) \tau(N^2) , given that τ ( N ) = 18 \tau(N) = 18 .

There are a total of 4 ways to factorize 18:

18 = 2 × 3 × 3 = 2 × 9 = 6 × 3 = 1 × 18 18 = 2 \times 3 \times 3 = 2 \times 9 = 6 \times 3 = 1 \times 18

We are going to check the solutions for τ ( N ) = 18 \tau(N) = 18 :

Case 1 : τ ( N ) = 2 × 3 × 3 \tau(N) = 2 \times 3 \times 3

We have that ( k 1 + 1 ) ( k 2 + 1 ) ( k 3 + 1 ) = 2 × 3 × 3 ( 2 k 1 + 1 ) ( 2 k 2 + 1 ) ( 2 k 3 + 1 ) = 3 × 5 × 5 = 75 = τ ( N 2 ) (k_{1} +1)(k_{2} +1)(k_{3} +1) = 2 \times 3 \times 3 \Rightarrow (2k_1 + 1)(2k_2 +1)(2k_3 + 1) = 3 \times 5 \times 5 = 75 = \tau(N^2)

Hence τ ( N 2 ) \tau(N^2) can be 75 75 .

Case 2 : τ ( N ) = 2 × 9 \tau(N) = 2 \times 9

We have that ( k 1 + 1 ) ( k 2 + 1 ) = 2 × 9 ( 2 k 1 + 1 ) ( 2 k 2 + 1 ) = 3 × 17 = 51 = τ ( N 2 ) (k_{1} +1)(k_{2} +1) = 2 \times 9 \Rightarrow (2k_1 + 1)(2k_2 +1) = 3 \times 17 = 51 = \tau(N^2)

Hence τ ( N 2 ) \tau(N^2) can be 51 51 .

Case 3 : τ ( N ) = 6 × 3 \tau(N) = 6 \times 3

We have that ( k 1 + 1 ) ( k 2 + 1 ) = 6 × 3 ( 2 k 1 + 1 ) ( 2 k 2 + 1 ) = 11 × 5 = 55 = τ ( N 2 ) (k_{1} +1)(k_{2} +1) = 6 \times 3 \Rightarrow (2k_1 + 1)(2k_2 +1) = 11 \times 5 = 55 = \tau(N^2)

Hence τ ( N 2 ) \tau(N^2) can be 55 55 .

Case 4 : τ ( N ) = 1 × 18 \tau(N) = 1 \times 18

We have that k 1 + 1 = 18 2 k 1 + 1 = 35 = τ ( N 2 ) k_{1} +1 = 18 \Rightarrow 2k_1 + 1 = 35 = \tau(N^2)

Hence τ ( N 2 ) \tau(N^2) can be 35 35 .


In conclusion, the possible values of τ ( N 2 ) \tau(N^2) are 35 , 55 , 51 , 75 {35, 55,51,75 } . We see that 95 95 is not in the list.

Therefore 95 \boxed{95} can not be the total number of positive divisors of N 2 N^2 .

Well articulated. Thank you for your solution!

Bonus question: Is it possible to find a positive integer n n such that all the possible values of τ ( n 2 ) \tau(n^2) follows a/an arithmetic/geometric/harmonic progression?

Pi Han Goh - 3 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...