Find the remainder when is divided by . Let this be equal to . Find sum of digits of
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.
Euler's theorem says a ϕ ( n ) = 1 m o d n where a & n are co-prime.
Therefore let's find out the totient function of n or 4056195 or 2013 2015 = 3 11 61 5 13 31
ϕ ( p ) = p − 1 and ϕ ( a ∗ b ) = ϕ ( a ) ∗ ϕ ( b )
hence,
\(\phi(4056195) = 2*10*60*4*12*30
Now, \(2013!*2015!\) has to have all these numbers in it.
Therefore, 2 2 0 1 3 ! ∗ 2 0 1 5 ! = 1 m o d 4 0 5 6 1 9 5
Z = 1, so, z 2 0 1 4 ( m o d 1 0 0 0 ) = 1 mod 1000 = 1