Given that p≥7 is a prime number, evaluate 1−1⋅2−1+2−1⋅3−1+3−1⋅4−1+⋯+(p−2)−1⋅(p−1)−1(modp).
1−1⋅2−1+2−1⋅3−1+...+(p−2)−1⋅(p−1)−1=12+16+...+1(p−1)(p−2)=(1−12)+(12−13)+...+(1p−1−1p−2)=1−1p−2=p−3p−2
So our work is to evaluate
p−3p−2(modp).
Don't know how to do that, if I were you, I would try some primes.
So let's try it.
When p = 7,
p−3p−2(modp)=45mod7=1215mod7=5
When p = 11,
p−3p−2(modp)=89(mod11)=4045(mod11)=7
When p = 13,
p−3p−2(modp)=1011(mod13)=6066(mod13)=8
When p = 17,
1415(mod17)=112120(mod17)=10
Welp can't see a pattern :(
a mod b- the remainder of the division a/b.
(P-3)/(P-2) mod P- the remainder of the division ((P-3)/(P-2))/P. P>(P-3)/(P-2),
therefore ((P-3)/(P-2))/P<1, therefore (P-3)/(P-2) mod P=(P-3)/(P-2)-P*0=(P-3)/(P-2)
Guest,
We can still get a 'proper' answer with a fraction.
Example:
417(mod13)≡27(mod13) because 41 mod 13 = 2≡414(mod13)≡41(mod13) similarly, because 14 mod 13 = 1≡4(mod13)≡4
Or
ab(modc)We first find numbers m and n that bm=cn+1=ambm(modc)=amcn+1(modc)=am(modc) (because (cn + 1) mod c = 1)So we find the answer.