|
claim: <i>Let x1, x2, ..., xn be any finite sequence of integers. Then x1 = x2 = x3 = ... = xn (all the integers are equal).</i> |
claim: Let x1, x2, ..., xn be any finite sequence of integers. Then x1 = x2 = x3 = ... = xn (all the integers in the sequence are equal). |
But since x_2 is in both sequences, this implies |
But since x2 is in both sequences, this implies |
lower bounds). |
lower bounds). |