 Therefore, the greatest common divisor "g" must divide "r""N"−1, which implies that "g" ≤ "r""N"−1.Since the first part of the argument showed the reverse ("r""N"−1 ≤ "g"), it follows that "g" = "r""N"−1.Thus, "g" is the greatest common divisor of all the succeeding pairs