×

# Remainder???

Hey Brilliantians!!

I just wanted to know how do you solve problems related to finding remainders? Like example- Find the remainder when 1000! is divided by 1000. Please can anyone tell me how to do these kind of problems

Note by Anuj Shikarkhane
2 years, 7 months ago

Sort by:

could anyone please tell me why my advice got downvoted? It'd be helpful to know this. · 2 years, 7 months ago

My also comment got downvoted. · 2 years, 7 months ago

@Calvin Lin I can't see why my comment got downvoted. If you have an idea why, it'd be great to know. · 2 years, 7 months ago

See this post. Read about Euler's Theorem and its special case called Fermat's Little Theorem. Also read about Wilson's theorem, Chinese Remainder Theorem (Extended Euclidean Algorithm is related to it, read about it too.). They are all very useful and worth learning if you want to master modular arithmetic.

The less useful one is the Euler's Theorem's equivalent but with the Carmichael's function $$\lambda$$ used instead of the Euler's Totient function $$\phi$$. We have $$\lambda\le \phi$$, which means the Carmichael's function is 'stronger' sometimes - we could occasionally reduce the exponent more than using the Euler's totient function. You can read more about it and a lot of other stuff here. It is not a popular theorem, though. · 2 years, 7 months ago

Thanks I would do it.It's a little tough but I can manage · 2 years, 7 months ago

Hey there...1000! is divisible by 1000...so remainder is zero...but for more complex problems, u should look up the results and theoroms related to modular mathematics..it should help.. · 2 years, 7 months ago

How can you say that 1000! is divisible by 1000?? · 2 years, 7 months ago

$$1000!=1000\times 999\times 998\times \cdots\times 2\times 1$$ by the definition of a factorial. · 2 years, 7 months ago