xi < k . In case 1i, with f1k = 0, the number of terms, which we denote Note that Lk−1 jr1j < n1 k implies f1k > s1k 1, which guarantees f1k 2. − ≥ ≥ 49
xi < k . In case 1i, with f1k = 0, the number of terms, which we denote 49 Note that Lk−1 jr1j < n1 − k implies f1k > s1k ≥ 1, which guarantees f1k ≥ 2.
Adam%20Title.docx