Waste less time on Facebook — follow Brilliant.
×

Proof -2

For all n<p , where n is a natural number and p is a prime , is the statement \({ n }^{ p }\equiv n(mod\quad p)\) true ??

Note by Vighnesh Raut
2 years, 6 months ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

Check out Fermat's Little Theorem Calvin Lin Staff · 2 years, 6 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...