Euler is haunting (2)

ϕ ( n ) = 2 n 5 \large \phi(n)=\dfrac{2n}{5}

Find the total number of positive integers n < 2017 n<2017 that satisfy the equation above.


Notation: ϕ ( ) \phi(\cdot) denotes the Euler's totient function .


The answer is 19.

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.

2 solutions

Mark Hennings
Apr 8, 2017

Since we want 5 ϕ ( n ) = 2 n 5\phi(n) = 2n , we must have n n divisible by 5 5 . Thus n = 5 b m n = 5^bm where b , m 1 b,m \ge 1 and 5 , m 5,m are coprime, and hence 2 × 5 b m = 2 n = 5 ϕ ( n ) = 5 × 4 × 5 b 1 × ϕ ( m ) 2 \times 5^bm \; = \; 2n \; = \; 5\phi(n) \; = \; 5\times 4\times 5^{b-1} \times \phi(m) and so 2 ϕ ( m ) = m 2\phi(m) = m . This means that m m is even, and so m = 2 a k m = 2^ak where a , k 1 a,k \ge 1 and k , 10 k,10 are coprime, and hence 2 a k = m = 2 ϕ ( m ) = 2 × 2 a 1 × ϕ ( k ) 2^ak \; = \; m \; = \; 2\phi(m) \; = \; 2\times 2^{a-1} \times \phi(k) so that ϕ ( k ) = k \phi(k) = k . Thus we obtain k = 1 k=1 , and so n = 2 a 5 b n = 2^a5^b for a , b 1 a,b \ge 1 . There are therefore 19 \boxed{19} such values of n n , namely 10 , 20 , 40 , 50 , 80 , 100 , 160 , 200 , 250 , 320 , 400 , 500 , 640 , 800 , 1000 , 1250 , 1280 , 1600 , 2000 10,20,40,50,80,100,160,200,250,320,400,500,640,800,1000,1250,1280,1600,2000

Cant we write it like this that if ϕ ( n ) = 2 n 5 = 1 2 × 4 5 × n \phi(n) = \dfrac{2n}{5} = \dfrac{1}{2} \times \dfrac{4}{5} \times n .

So we get that n = 5 m × 2 j n= 5^m \times 2^j . Now finding the number of pairs (m,j) which are lesser than 2000 will help as 2000 is maximum will help? @Kushal Bose , dont you think?

Md Zuhair - 4 years, 2 months ago

Log in to reply

Yes you observed this.That's good.But for bigger number it will be difficult to find such pattern.

Kushal Bose - 4 years, 2 months ago

Log in to reply

Okhay. Thanks. Do you have whatsapp? We have a brilliant froup. if you dont mind we can add you

Md Zuhair - 4 years, 2 months ago
Ankit Kumar Jain
Apr 8, 2017

HINT : Try and look at what could be the prime factors of the number.!

@Kushal Bose I will do it. It will edit my solution. :) :)

Thanks!

Ankit Kumar Jain - 4 years, 2 months ago

Post a detailed one either admin will not allow this

Kushal Bose - 4 years, 2 months ago

Since @Mark Hennings sir has already posted the solution, I think I should delete mine rather than making edits.

Ankit Kumar Jain - 4 years, 2 months ago

Log in to reply

If your solution different then you can publish

Kushal Bose - 4 years, 2 months ago

Log in to reply

It is more or less the same.

Ankit Kumar Jain - 4 years, 2 months ago

Better way to find number of n??

Jatin Sharma - 4 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...