Hi everybody,
Is there any theorem that shows:
when s+1 is prime?
(this is valid for every n>1)
or need to be prooven?
This (in the form you have written) is not valid for every integer only when and are coprime (in which case it is also valid for However, if you re-write it as then it is valid for every integer (including 1).
It is more usual to write the prime as Thus Fermat’s little theorem is usually presented as (which is valid if or (which is valid for any integer