Given that p≥7 is a prime number, evaluate1−1⋅2−1+2−1⋅3−1+3−1⋅4−1+⋯+(p−2)−1⋅(p−1)−1(modp).
We can rewrite this as 11×2+12×3+13×4+...+1(p−2)×(p−1). All of these terms are in the form of 1n(n+1), so let's first try to simplify that.
1n(n+1)
1+n−nn(n+1)
1+nn(n+1)−nn(n+1)
1n−1n+1
Now, we can rewrite all of out fractions as (11−12)+(12−13)+(13−14)+...+(1p−2−1p−1)
We can finally simplify this to 1−1p−1 or p−2p−1, which is the final answer.
You could also solve this by induction, because you could notice that 12+12×3=2/3 and that 11×2+12×3+13×4=3/4.