Find the number of positive integers < 3600 which are coprime to 3600.
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.
Are you Serious, Is this really a RMO problem?
I don't think it is a RMO problem.
Log in to reply
Without using Euler's Totient func. it will be RMO lvl question then
use euler's phi function.
what i have done wrong if i count the factors of 3600 then subtract it from 3600
Log in to reply
54 is not a factor of 3600 but gcd(54, 3600) != 1.
can u give a little more explanation
Yes exactly....
Hi.Rajarshi! Why didn't you show up in tution? (Dont think this a comment)
Log in to reply
which tution
Log in to reply
the one i which u forgot your name ,ha ha
Problem Loading...
Note Loading...
Set Loading...
ϕ ( 3 6 0 0 ) = ϕ ( 5 2 ) ϕ ( 3 2 ) ϕ ( 2 4 )
ϕ ( 5 2 ) = 5 2 − 5 1
ϕ ( 3 2 ) = 3 2 − 3 1
ϕ ( 2 4 ) = 2 4 − 2 3
Thus ϕ ( 3 6 0 0 ) = 2 0 ∗ 6 ∗ 8 = 9 6 0
The answer is 9 6 0