Number of divisors

Exactly two of the divisors of an integer N N are prime numbers. Given that N 2 N^2 has 77 divisors inclusive of 1 and itself, determine the number of divisors of N N .


The answer is 24.

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

Let the two prime divisors of N N be p p and q q and N = p m q n N = p^mq^n , where m m and n n are positive integers. Then N 2 = p 2 m q 2 n N^2=p^{2m}q^{2n} and it is given that N 2 N^2 has 77 77 divisors. That means its number of divisors is given by ( 2 m + 1 ) ( 2 n + 1 ) = 77 (2m+1)(2n+1) = 77 , m = 3 \Rightarrow m = 3 and n = 5 n = 5 or reverse. Therefore, the number of divisors of N N is ( m + 1 ) ( n + 1 ) = 4 × 6 = 24 (m+1)(n+1) = 4 \times 6 = \boxed{24} .

Hey thinking requires mind and brains!

Aparna Kalbande - 5 years, 6 months ago

Log in to reply

Sorry, which part don't you understand? The number of divisors or factors of a number N = p m q n N = p^mq^n is given by ( m + 1 ) ( n + 1 ) (m+1)(n+1) .

Chew-Seong Cheong - 5 years, 6 months ago

Log in to reply

Yes I understood it .Thanks!

Aparna Kalbande - 5 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...