ϕ ( n ) = 5 2 n
Find the total number of positive integers n < 2 0 1 7 that satisfy the equation above.
Notation:
ϕ
(
⋅
)
denotes the
Euler's totient function
.
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.
Cant we write it like this that if ϕ ( n ) = 5 2 n = 2 1 × 5 4 × n .
So we get that n = 5 m × 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?
Log in to reply
Yes you observed this.That's good.But for bigger number it will be difficult to find such pattern.
Log in to reply
Okhay. Thanks. Do you have whatsapp? We have a brilliant froup. if you dont mind we can add you
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!
Post a detailed one either admin will not allow this
Since @Mark Hennings sir has already posted the solution, I think I should delete mine rather than making edits.
Log in to reply
If your solution different then you can publish
Better way to find number of n??
Problem Loading...
Note Loading...
Set Loading...
Since we want 5 ϕ ( n ) = 2 n , we must have n divisible by 5 . Thus n = 5 b m where b , m ≥ 1 and 5 , m are coprime, and hence 2 × 5 b m = 2 n = 5 ϕ ( n ) = 5 × 4 × 5 b − 1 × ϕ ( m ) and so 2 ϕ ( m ) = m . This means that m is even, and so m = 2 a k where a , k ≥ 1 and k , 1 0 are coprime, and hence 2 a k = m = 2 ϕ ( m ) = 2 × 2 a − 1 × ϕ ( k ) so that ϕ ( k ) = k . Thus we obtain k = 1 , and so n = 2 a 5 b for a , b ≥ 1 . There are therefore 1 9 such values of n , namely 1 0 , 2 0 , 4 0 , 5 0 , 8 0 , 1 0 0 , 1 6 0 , 2 0 0 , 2 5 0 , 3 2 0 , 4 0 0 , 5 0 0 , 6 4 0 , 8 0 0 , 1 0 0 0 , 1 2 5 0 , 1 2 8 0 , 1 6 0 0 , 2 0 0 0