The base case is pretty straightforward. But I'm stuck on the inductive step.
As the base case holds, assume for when n=k holds, show the k+1 case holds true.
Inductive Hypothesis: ak≡bk(modm), then
ak+1≡bk+1(modm)⟺ak+1−bk+1=m(k),k∈Z.
I think I'm missing some steps, I'm not sure how to manipulate what I have to shows it holds.
No comments:
Post a Comment