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

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestcould anyone please tell me why my advice got downvoted? It'd be helpful to know this.

Log in to reply

My also comment got downvoted.

Log in to reply

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

Log in to reply

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.

Log in to reply

Thanks I would do it.It's a little tough but I can manage

Log in to reply

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..

Log in to reply

How can you say that 1000! is divisible by 1000??

Log in to reply

\(1000!=1000\times 999\times 998\times \cdots\times 2\times 1\) by the definition of a factorial.

Log in to reply