2 for 2

X is a positive integer, such that 2X has 2 more divisors than X.

The most prime factors X can have is:

4 1 3 2

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

If X = p 1 α 1 p n α n X=p_1^{\alpha_1}\dots p_n^{\alpha_n} does not have 2 2 as one of its primes, then

f ( X ) = ( α 1 + 1 ) ( α n + 1 ) , f ( 2 X ) = 2. ( α 1 + 1 ) ( α n + 1 ) f(X)=(\alpha_1+1) \dots (\alpha_n+1) \ , \ f(2X)=2. (\alpha_1+1) \dots (\alpha_n+1)

the difference would be

f ( 2 X ) f ( X ) = ( α 1 + 1 ) ( α n + 1 ) = 2 f(2X)-f(X)=(\alpha_1+1) \dots (\alpha_n+1)=2

As α i 0 \alpha_i \geq 0 there can be only one prime with power 1 1 .

If X = 2 α 1 p n α n X=2^{\alpha_1}\dots p_n^{\alpha_n} , then

f ( X ) = ( α 1 + 1 ) ( α 2 + 1 ) ( α n + 1 ) , f ( 2 X ) = ( α 1 + 2 ) ( α 2 + 1 ) ( α n + 1 ) f(X)=(\alpha_1+1) (\alpha_2+1)\dots (\alpha_n+1) \ , \ f(2X)=(\alpha_1+2) (\alpha_2+1)\dots (\alpha_n+1)

the difference would be

f ( 2 X ) f ( X ) = ( α 2 + 1 ) ( α n + 1 ) = 2 f(2X)-f(X)=(\alpha_2+1)\dots (\alpha_n+1)=2

With the same reasoning as before, there can be only one prime (other than 2 2 ) with power 1 1 .

So, taking the two cases into account, X X can have a maximum of 2 2 prime factors.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...