Let be integers such that where .
Assume .
Show that iff .
Proof:
(since )
Then I used a Lemma that states:
Let and be integers with . If , then .
Where I use , , and . So that gives . My question is, am I allowed to use the theorem if the equivalences are 1 off?:
Proof
Lemma
Thanks