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}\) ?

No vote yet

1 vote

×

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. – Karthik Venkata · 1 year, 9 months ago

Log in to reply

– Swapnil Das · 1 year, 9 months ago

Hey! I am launching a contest! ON BRILLIANT! Would u participate?Log in to reply

– Karthik Venkata · 1 year, 9 months ago

Ok bro !Log in to reply

– Swapnil Das · 1 year, 9 months ago

It is just mini RMO contest on BRILLIANT!Log in to reply

– Swapnil Das · 1 year, 9 months ago

But why mod 100, 1000?Log in to reply

– Karthik Venkata · 1 year, 9 months ago

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

– Swapnil Das · 1 year, 9 months ago

Oh thanks!Log in to reply