New user? Sign up

Existing user? Log in

Why do we deal with Euler's Theorem and perform calculation on mod 100,1000,etc. while solving questions like: What are the last three digits of \(7^{999}\) ?

Note by Swapnil Das 3 years, 5 months ago

Easy Math Editor

*italics*

_italics_

**bold**

__bold__

- bulleted- list

1. numbered2. list

paragraph 1paragraph 2

paragraph 1

paragraph 2

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

> This is a quote

This is a quote

# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"

2 \times 3

2^{34}

a_{i-1}

\frac{2}{3}

\sqrt{2}

\sum_{i=1}^3

\sin \theta

\boxed{123}

Sort by:

Euler theorem helps us to deal with large congruences like mod 100 and mod 1000 with ease.

Log in to reply

Hey! I am launching a contest! ON BRILLIANT! Would u participate?

Ok bro !

@Karthik Venkata – It is just mini RMO contest on BRILLIANT!

But why mod 100, 1000?

For finding out the last and last but one digits , we work in mod 10 and mod 100 systems respectively.

@Karthik Venkata – Oh thanks!

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:

TopNewestEuler theorem helps us to deal with large congruences like mod 100 and mod 1000 with ease.

Log in to reply

Hey! I am launching a contest! ON BRILLIANT! Would u participate?

Log in to reply

Ok bro !

Log in to reply

Log in to reply

But why mod 100, 1000?

Log in to reply

For finding out the last and last but one digits , we work in mod 10 and mod 100 systems respectively.

Log in to reply

Log in to reply