New user? Sign up

Existing user? Sign 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 2 years, 6 months ago

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

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