* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Lemma 3.3
Ethnomathematics wikipedia , lookup
Georg Cantor's first set theory article wikipedia , lookup
List of prime numbers wikipedia , lookup
Brouwer–Hilbert controversy wikipedia , lookup
Foundations of mathematics wikipedia , lookup
Fundamental theorem of algebra wikipedia , lookup
Wiles's proof of Fermat's Last Theorem wikipedia , lookup
Mathematical proof wikipedia , lookup
Collatz conjecture wikipedia , lookup
Quadratic reciprocity wikipedia , lookup
A NOTE ON A LEMMA IN THE ARTICLE: A DIVISIBILITY APPROACH TO THE OPEN BOUNDARY CASES OF CUSICK-LI-STǍNICǍ’S CONJECTURE FRANCIS N. CASTRO, OSCAR E. GONZÁLEZ, AND LUIS A. MEDINA Abstract. In this note we present a proof of Lemma 3.3 in the article: “A divisibility approach to the open boundary cases of Cusick-Li-StǍnicǍ’s conjecture”. 1. Proof of Lemma 3.3 This note is devoted to the proof Lemma 3.3. We re-state the lemma in order to aid the reader. Lemma 3.3. Let a, i, m be natural numbers with i ≥ 3 and m odd. Write m = bs · 2s + bs−1 · 2s−1 + · · · + b1 · 2 + 1 with s ≥ 1. Let bs−l1 , bs−l2 , . . . , bs−lr be all the bt in the expansion of m such that bt = 0. Define ba,i = δ1 · 2a+i−1+(s−l1 ) + · · · + δr · 2a+i−1+(s−lr ) Then, (1) (2a+i−1 · m − 2a + ba,i + 2a+i−1 ) · · · (2a+i−1 · m − 2a + ba,i + 1) ≡ 3 mod 4. (2a+i−1 · m − ba,i ) · · · (2a+i−1 · m − ba,i − 2a+i−1 + 1) Proof. The proof we present is elementary, but rather long. We decided to present most of the details, including a double induction, because this technique can be used to prove other results. Note that the left hand side of (1) is an odd number, which implies that the numbers of even terms in the numerator and the denominator are equal. This will allow us to perform reductions modulo 8 in the numerator and denominator independently. Also note that the number of terms in the numerator and denominator is 2a+i−1 . We prove (1) by double induction. Suppose first that i = 3. We want to prove that (2a+2 · m − 2a + ba,3 + 2a+2 ) · · · (2a+2 · m − 2a + ba,3 + 1) ≡ 3 mod 4 (2a+2 · m − ba,3 ) · · · (2a+2 · m − ba,3 − 2a+2 + 1) 1 2 FRANCIS N. CASTRO, OSCAR E. GONZÁLEZ, AND LUIS A. MEDINA for a ≥ 1. For the base case, i.e. a = 1, we have (23 · m − 2 + b1,3 + 23 ) · · · (23 · m − 2 + b + 1) (23 · m − b1,3 ) · · · (23 · m − b1,3 − 23 + 1) = (23 · m + b1,3 + 6) · · · (23 · m + b1,3 − 1) (23 · m − b1,3 ) · · · (23 · m − b1,3 − 7) = (23 · m + b1,3 + 6) · · · (23 · m + b1,3 + 1) · (23 · m + b1,3 − 1) (23 · m + b1,3 ) · (23 · m − b1,3 − 1) · · · (23 · m − b1,3 − 7) (23 · m − b) (4 · m + 3) · (2 · m + 1) · (4 · m + 1) (m + δ1 · 2(s−l1 ) + · · · + δr · 2(s−lr ) ) · mod 8 (4 · m − 1) · (2 · m − 1) · (4 · m − 3) (m − δ1 · 2(s−l1 ) − · · · − δr · 2(s−lr ) ) ≡ 3 mod 4. ≡ Thus the claim holds for a = 1. Suppose that (2) (2a+2 · m − 2a + ba,3 + 2a+2 ) · · · (2a+2 · m − 2a + ba,3 + 1) ≡ 3 mod 4 (2a+2 · m − ba,3 ) · · · (2a+2 · m − ba,3 − 2a+2 + 1) for some a ≥ 1. We will show that (3) (2a+3 · m − 2a+1 + ba+1,3 + 2a+3 ) · · · (2a+3 · m − 2a+1 + ba+1,3 + 1) ≡ 3 mod 4. (2a+3 · m − ba+1,3 ) · · · (2a+3 · m − ba+1,3 − 2a+3 + 1) Observe that the numerator and denominator of the left hand side of (3) have 2a+2 consecutive odd terms. Thus, the left hand side of (3) is congruent to (2a+3 · m − 2a+1 + ba+1,3 + 2a+3 )(2a+3 · m − 2a+1 + ba+1,3 + 2a+3 − 2) · · · (2a+3 · m − 2a+1 + ba+1,3 ) (2a+3 · m − ba+1,3 )(2a+3 · m − ba+1,3 − 2) · · · (2a+3 · m − ba+1,3 − 2a+3 ) modulo 4. Now factor a 2 out of each term to obtain (4) (2a+2 · m − 2a + ba+1,3 /2 + 2a+2 ) · · · (2a+2 · m − 2a + ba+1,3 /2) . (2a+2 · m − ba+1,3 /2) · · · (2a+2 · m − ba+1,3 /2 − 2a+2 ) Since ba+1,3 /2 = ba,3 , then (4) is the same number as the left hand side of (2) and so, by our induction hypothesis, (3) is congruent to 3 mod 4, which is what we wanted to prove. This takes care of the first step of the double induction. Suppose that (5) (2a+i−1 · m − 2a + ba,i + 2a+i−1 ) · · · (2a+i−1 · m − 2a + ba,i + 1) ≡ 3 mod 4. (2a+i−1 · m − ba,i ) · · · (2a+i−1 · m − ba,i − 2a+i−1 + 1) is true for some i ≥ 3 Consider the case i + 1, i.e. (2a+i · m − 2a + ba,i+1 + 2a+i ) · · · (2a+i · m − 2a + ba,i+1 + 1) . (2a+i · m − ba,i+1 ) · · · (2a+i · m − ba,i+1 − 2a+i + 1) Note that there are 2a+i consecutive integers in the numerator and in the denominator. Thus, we have 2a+i−1 consecutive odd numbers in the numerator and in the denominator. Since a + i − 1 ≥ 2, then we have that these terms will be congruent to 1 mod 8. After this cancellation, we are left with the even terms: (6) (2a+i · m − 2a + ba,i+1 + 2a+i ) · · · (2a+i · m − 2a + ba,i+1 + 2) . (2a+i · m − ba,i+1 ) · · · (2a+i · m − ba,i+1 − 2a+i + 2) BOUNDARY OF CUSICK-LI-STǍNICǍ’S CONJECTURE 3 Observe that if a ≥ 2, then, after taking this expression mod 4, we have (7) (2a+i · m + ba,i+1 + 2a+i ) · · · (2a+i · m + ba,i+1 + 2) mod 4. (2a+i · m − ba,i+1 ) · · · (2a+i · m − ba,i+1 − 2a+i + 2) Now factor a 2 out of each term to obtain (2a+i−1 · m + ba,i + 2a+i−1 ) · · · (2a+i−1 · m + ba,i + 1) (8) mod 4, (2a+i−1 · m − ba,i ) · · · (2a+i−1 · m − ba,i − 2a+i−1 + 1) and this expression is congruent to 3 modulo 4 by induction. If a = 1, then observe that (5) gets transformed to (9) (2i · m + b1,i + 2i − 2)(2i · m + b1,i + 2i − 1) · · · (2i · m + b1,i − 1) ≡ 3 mod 4. (2i · m − b1,i ) · · · (2i · m − b1,i − 2i + 1) while (6) gets transformed to (10) (2i+1 · m + b1,i+1 + 2i+1 − 2) · · · (2i+1 · m + b1,i+1 ) . (2i+1 · m − b1,i+1 ) · · · (2i+1 · m − b1,i+1 − 2i+1 + 2) Factor a 2 out of each term to obtain (2i · m + b1,i + 2i − 1) · · · (2i · m + b1,i ) . (11) (2i · m − b1,i ) · · · (2i · m − b1,i − 2i + 1) Since 2i −1 ≡ −1 mod 8, then (11) is congruent to (9) modulo 4, and thus, congruent to 3 mod 4 by induction. This concludes the proof. Department of Mathematics, University of Puerto Rico, San Juan, PR 00931 E-mail address: [email protected] Department of Mathematics, University of Puerto Rico, San Juan, PR 00931 E-mail address: [email protected] Department of Mathematics, University of Puerto Rico, San Juan, PR 00931 E-mail address: [email protected]