Question:

Let p be prime. Using Fermat's little theorem, prove that n:

Last updated: 7/31/2022

Let p be prime. Using Fermat's little theorem, prove that n:

Let p be prime. Using Fermat's little theorem, prove that n: 2ᵖ-² +2 x 5ᵖ-² +10ᵖ-² - 1 is a multiple of p if and only if p ≠ 2,5. [Hint: for p ≠ 2,5, consider 10n.]