Too many divisors??.....

Number Theory Level pending

Let m and n be two positive integers and t ( x ) t(x) =the number of divisors of x .

If, t ( m ) = 2014 t(m)=2014

t ( n ) = 2002 t(n)=2002

t ( g c d ( m , n ) ) = 11 t(gcd(m,n))=11

Then,

t ( l c m ( m , n ) ) = ? t(lcm(m,n))=?


The answer is 366548.

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

Fatin Farhan
Dec 28, 2014

Let m = p 1 × p 2 6 × p 3 10 × p 4 12 m=p_1 \times p_2^6 \times p_3^{10} \times p_4^{12} and n = p 5 × p 6 18 × p 7 52 n=p_5 \times p_6^{18} \times p_7^{52} .

WLOG assume p 3 = p 6 p_3=p_6 .

So, g c d ( m , n ) = p 3 10 gcd(m,n)=p_3^{10}

l c m ( m , n ) = p 1 × p 2 6 × p 3 18 × p 4 12 × p 5 × p 7 52 \therefore lcm(m,n)=p_1 \times p_2^6 \times p_3^{18} \times p_4^{12} \times p_5 \times p_7^{52} .

t ( l c m ( m , n ) ) = 2 7 19 13 2 53 = 366548 \Rightarrow t(lcm(m,n))=2*7*19*13*2*53= 366548 \: _\square

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...