Prove or disprove: \[ a^{p-1} \equiv 1 ( \mathrm{mod} p) \] When \( p \) is a prime number and \( p \nmid a \). ( I checked 2, 3, 5, and 7, all of these four satisfies the condition )

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestIsn't it Fermat's Little Theorem? – Hoo Zhi Yee · 3 years, 6 months ago

Log in to reply

troll problem – David Austen · 3 years, 6 months ago

Log in to reply