SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE. 1. Introduction. x 3 y 2 = k
|
|
- Myron Harper
- 5 years ago
- Views:
Transcription
1 MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages S (XX) SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD Abstract. A good example of Hall s Conjecture is a pair of natural numbers x, y such that 0 < x 3 y 2 < x /2. We have implemented a new algorithm and found nine not previously known good examples. Moreover, we have verified that all good examples with x < 0 29 are now found. (.) Consider the equation. Introduction x 3 y 2 = k where x, y N and k Z. It is easy to see that the equation has infinitely many solutions when k = 0 (let x = t 2 and y = t 3 where t is a natural number). By Siegel s theorem, there will be only finitely many solutions of the equation when k 0. Moreover, it is hard to find solutions where k is small compared to x and y. Hall [4] conjectured that there is a constant C such that k > Cx /2 for any solution of (.) where k 0. This conjecture is discussed in e.g. Danilov [2] and Elkies [3]. The general opinion is that Hall s original conjecture is too strong, and his conjecture has been reformulated to a weaker modern variant: For any exponent e < 2, there exists a constant C e > 0 such that k > C e x e. For more on Hall s conjecture and further references, see Calvo et al. []. Hall s Conjecture is neither proved nor disproved. To shed some light on the conjecture, researchers have searched for solutions of (.) where 0 < k < x /2. We follow the terminology of Calvo et al. [] and refer to such solutions as good examples of Hall s conjecture. We will say that a pair of natural numbers (x, y) is a good example when 0 < x 3 y 2 < x /2. We have implemented a new algorithm for finding good examples. We have found 9 not previously known good examples, and we have checked that all good examples (x, y) where x is less than 0 29 are now found. Other algorithms for finding good examples can be found in Elkies [3] and Calvo et al. []. The algorithm of Elkies has an asymptotic running time similar to ours. The algorithm of Calvo et al. seems to have slightly better asymptotic running time, but the authors offer no proof that their algorithm will detect all good examples within its search space. However, it is easily verified that the algorithm will find all the new good examples presented in this paper if it is given enough running time. Received by the editor November 5, 205 and, in revised form, November 6, Mathematics Subject Classification. Primary Y50, 65A05; Secondary D25. c 207 American Mathematical Society
2 2 STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD 2. The Algorithm Definition 2.. We define the polynomials B, C, F and H by where x, y, p, q are positive integers. B(q, p, x) = p 2 q 2 x C(q, p, x, y) = p 3 3pq 2 x + 2q 3 y F (q, p, x, y) = 4pC 3B 2 H(q, p, x, y) = 9F B 8C 2 Our algorithm is based on the four polynomials given by the definition above. The values of these polynomials will be small when (x, y) is a good example and p q is the approximation to x /2 given by the next theorem. Theorem 2.2. Let (x, y) be a good example. Then, there exist p, q, Q N and δ R such that (i) p = qx /2 ( + δ), (ii) 0 < q < x /6 < Q and (iii) qx /2 (Q + q) Moreover, p and q are co-prime. < δ < qx /2 Q. Proof. In this proof we use continued fractions. For more on continued fractions, see e.g. Niven et al. [7] or Khintchine [6]. First we note that x /2 is an irrational number when (x, y) is a good example. (If x /2 is a natural number, then (x, y) will not be a good example as x 3 y 2 = 0. But x /2 is either a natural number or an irrational number. Thus, x /2 is irrational.) Let a 0, a, a 2,... be the coefficients for the continued fraction for x /2, that is x /2 = lim n [a 0; a,..., a n ]. The list of coefficients will be infinite as x /2 is irrational. Let h i and k i be, respectively, the nominator and the denominator of the convergent [a 0 ; a,..., a i ], that is hi k i = [a 0 ; a,..., a i ]. Then, for any i N, we have < h i k i (k i + k i+ ) x /2 k i < k i k i+ and k i < k i+. Now, pick the least j such that k j+ > x /6. Let q = k j, let p = h j and let Q = k j+. Then, we have < p q(q + Q) q x/2 < qq where q < x /6 < Q (we cannot have q = x /6 as x /6 N). Next, let δ be the real number such that p = qx /2 ( + δ). Then, we have < qx /2 ( + δ) q(q + Q) x /2 < q qq. Thus < δ < qx /2 (q + Q) qx /2 Q. Note that p and q are co-prime since h j and k j are co-prime for any convergent h j k j.
3 SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE 3 The proof of the next theorem will be given in Section 5. Theorem 2.3. Let (x, y) be a good example where x 2. Then, there exist coprime natural numbers p and q such that q < x /6 and 0 < C < 3qx /6 +, F < 8q + and H < 72q 4 +. In order to explain our algorithm, we introduce the notion of a good septuple. Definition 2.4. Let x, y, p, q, c N and f, h Z. The sequence (x, y, p, q, f, c, h) is a good septuple if p and q are co-prime and q < x /6, f = F (q, p, x, y), c = C(q, p, x, y), h = H(q, p, x, y) and x 3 y 2 < x /2. We define the function E by (x, y) if there exists p such that (x, y, p, q, f, c, h) is a good septuple E(q, f, c, h) = (0, 0) otherwise. An algorithm for computing E(q, f, c, h). It follows from Definition 2. that (2.) (2.2) (2.3) (2.4) B = H + 8C2 9F p = F + 3B2 4C x = p2 B q 2 y = 3pq2 x p 3 + C 2q 3. If (x, y, p, q, f, c, h) is a good septuple, we have f = F (q, p, x, y) and c = C(q, p, x, y) and h = H(q, p, x, y). Thus, we can compute E(q, f, c, h) by the following procedure: Compute b such that b = B and equality (2.) holds. Use f, c, h for respectively F, C, H. Compute p such that equality (2.2) holds. Use f, c, b for respectively F, C, B. Compute x such that equality (2.3) holds. Use p, q, and use b for B. Compute y such that equality (2.4) holds. Use p, q, and use c for C. Check if (x, y, p, q, f, c, h) is a good septuple, that is, check if p, x, y are natural numbers and check if x 3 y 2 < x /2. If it is a good septuple, the output is (x, y); otherwise, the output is (0, 0). Overview of the algorithm. We are now ready to give an overview of our algorithm for finding good examples (where x 2). A pair (x, y) is a good example if and only if there exist p, q, f, c, h such that (x, y, p, q, f, c, h) is good septuple (this follows straightforwardly from Theorem 2.3). Since q < x /6 when (x, y, p, q, f, c, h) is a good septuple, we can decide if (x, y) is a good example checking all good septuples where q < x /6. Our algorithm works by generating good septuples by a sieve method. The input to the algorithm is a natural number x max. The algorithm outputs all good examples (x, y) where x < x max. Figure gives a high-level description of the algorithm.
4 4 STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD q max := xmax. /6 for q :=, 2,..., q max do begin Generate a set F q of possible values for f. for each f F q do begin Generate a set C qf of possible values of c. for each c C qf do begin Generate a set H qfc of possible values for h. for each h H qfc do begin (x, y) := E(q, f, c, h) (see Definition 2.4). Output (x, y) if (x, y) (0, 0). end end end end Figure. The high-level description of our algorithm. Our algorithm might also output good examples (x, y) where x x max. If x x max, there might exist a good septuple (x, y, p, q, f, c, h) where q < x /6 max and c < 3qx /6 max. This is why our algorithm has found good examples with x > More on the Algorithm In this section we explain how the algorithm in Figure computes the sets F q, C qf and H qfc. We will also discuss the running time. The correctness of our algorithm is based on the next couple of lemmas. Lemma 3.. We have (i) C p 3, F p 4 and H p 6 (mod q 2 ) (ii) H 8C 2 (mod 9 F ) (iii) p 4 2pC + F 0 and H 5p 3 C 4p 6 (mod q 3 ) (iv) either F 0 or F (mod 4) (v) F and q are co-prime if p and q are co-prime. Proof. Clause (i), (ii) and (iii) follow straightforwardly from Definition 2.. In the case when B is even there exists i Z such that F = 3B 2 = 3(2i) 2 = 2i 2. Hence, we have F 0 (mod 4) when B is even. A similar argument shows that F (mod 4) when B is odd. This proves (iv). In order to see that (v) holds, assume that F and q are not co-prime. Then there is a prime m that divides both F and q. By (i), m will also divide p. Hence, p and q are not co-prime. The proof of the next lemma is straightforward.
5 SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE 5 Lemma 3.2. Let m and n be natural numbers such that m n, and let P (x) be a polynomial. Furthermore, let x 0 x (mod q m ), and let y P (x) (mod q n ). Then we have y P (x 0 ) (mod q m ). 3.. The Construction of the Set F q. Assume that (x, y, p, q, f, c, h) is a good septuple. By Lemma 3. (i), we have f p 4 (mod q 2 ). Now, let p 0 be any natural number such that p 0 p (mod q). By Lemma 3.2, we have f p 4 0 (mod q). Thus, f can be written of the form (3.) f = (p 4 0 mod q) + iq for some i Z and some p 0 where p 0 < q. By Theorem 2.3 we have (3.2) (8q + ) < f < 8q + and by Lemma 3. (iv), we have (3.3) f 0 or f ( mod 4). If q >, our algorithm computes the set F q such that f F q iff (3.), (3.2) and (3.3) hold. In the case when q =, the algorithm let F q = { 8, 7, 4, 3, 0,, 4, 5, 8 }. Note that we only need q to determine the set F q (in particular we do not need the value of p) The Construction of the Set C qf. Assume that (x, y, p, q, f, c, h) is a good septuple where x < x max. By Lemma 3. (i), we have f p 4 (mod q 2 ). Let p be any natural number such that p p (mod q 2 ). By Lemma 3.2, we have f p 4 ( mod q 2 ). Hence, (3.4) p 4 = f + iq 2 for some i Z. Let p P iff 0 < p < q 2 and (3.4) holds. Our algorithm computes the set P from q and f (the set will contain at most four elements). By Lemma 3. (i), we have c p 3 (mod q 2 ). By Lemma 3.2, we have c p 3 ( mod q 2 ). Hence, c can be written of the form (3.5) c = (p 3 mod q 2 ) + iq 2 for some p P and some i Z. By Theorem 2.3, we have 0 < c < 3qx /6 +. Recall that q max = x /6 max. Hence (3.6) 0 < c 3qq max +. If q >, our algorithm computes the set C qf such that c C qf iff (3.5) and (3.6) holds. If q =, the algorithm computes the set C qf such that c C qf iff (3.6) holds. We need q, q max and the set P to determine the set C qf (and we need q and f F q to determine P ).
6 6 STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD 3.3. The Construction of the Set H qcf. Assume that (x, y, p, q, f, c, h) is a good septuple. Let p 2 be such that p 2 p (mod q 3 ). By Lemma 3. (iii), we have p 4 2pc + f 0 (mod q 3 ). By Lemma 3.2, we have (3.7) p 4 2 2p 2 c + f 0 ( mod q 3 ). Our algorithm computes the set P 2 such that p 2 P 2 iff 0 p 2 < q 3 and (3.7) holds. We need q, c C qf and f F q to determine the set P 2. By clause (ii) and (iii) of Lemma 3. and Lemma 3.2, there is p 2 P 2 such that (3.8) h 8c 2 ( mod 9 f ) and h 5p 3 2c 4p 6 2 ( mod q 3 ). By Theorem 2.3, we have (3.9) (72q 4 + ) < h < 72q 4 +. The case when 3 does not divide q. We will now explain how our algorithm computes the set H qfc when 3 does not divide q. We know that p and q are co-prime (since (x, y, p, q, f, c, h) is a good septuple). By Lemma 3. (v), f and q are co-prime. Thus, 9 f and q 3 will also be co-prime since 3 does not divide q. The Chinese Reminder Theorem and (3.8) yield h such that (3.0) 0 h < 9 f q 3 and h = h + i9 f q 3 for some i Z. Let S(q, p 2, f, c) denote the unique h such that (3.0) holds. The number S(q, p 2, f, c) can be computed from q, p 2, f, c by the Euclidean method. If q >, our algorithm computes the set H qfc such that h H qfc iff (3.9) holds and h = S(q, p 2, f, c) + i9 f q 3 for some p 2 P 2 and some i Z. The set H qfc will be computed by a tailored algorithm when q =. The case when 3 divides q. By Lemma 3. (v), f and q are co-prime. Thus, if 3 divides q, the greatest common divisor of 9 f and q 3 will be 9. The equations in (3.8) have a solution iff h 8c 2 (mod 9). If there is a solution, the Chinese Reminder Theorem yields h such that (3.) 0 h < f q 3 and h = h + i f q 3 for some i Z, and our algorithm can proceed as described in the case when 3 does not divide q. We need q, f F q, c C qf and the set P 2 to determine H qfc (and we need q, f F q, c C qf to determine P 2 ) The Running Time. Let S denote the number of elements in the set S. It is easy to see that F q 7q. It follows from (3.5) and (3.6) that C qf P (3qq max + ) q 2. We have computed the set P from q and f, but the number of elements in the set will not depend on q or f (tedious considerations will show that P 4). Hence there is a constant k such that C qf (kq max )/q. We can now determine an upper
7 SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE 7 p # x r q Comments. ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) The first 40 entries of the table can be found in []. These entries are found by Hall [4], Gebel et al. [5], Elkies [3], Calvo et al. [] and Johan Bosman using the software of Calvo et al. [] 2) Found by Jiménez Calvo [8]. 3) Found by Calvo et al. []. 4) Found by the authors of this paper. 5) From the Danilov-Elkies infinite Fermat-Pell family, see [3] or []. Table. Good examples of Hall s conjecture. bound for how many times the third loop in Figure will be executed. We have q max q= f F q C qf q max q= kq max q f F q q max 7q max q= q max = kq max 7q max q= kq max q q = O(q 2 max log q max ). This shows that the number of times the loop for each c C qf... will be executed is of order O(qmax 2 log q max ). It follows from (3.9), (3.0) and (3.) that there exists a constant k such that the number of elements in H qfc is bounded by kq. Thus the number of elements in H qfc is of order O(q max ). This entails that the innermost loop of the algorithm in Figure will be executed O(qmax 2 log q max ) O(q max ) times. In the innermost loop numbers will be added, multiplied and divided. The running time of these arithmetical computations will be of order O(log 2 x). Thus, as q max = x /6 max and x < x max, our algorithm runs in time O(q 2 max log q max ) O(q max ) O(log 2 x max ) = O(q 3 max log q max ) O(log 2 x max ) = O((x /6 max) 3 log x /6 max) O(log 2 x max ) The algorithm of Elkies [3] has a similar running time. = O(x /2 max log O() x max ).
8 8 STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD 4. Computations and Results A first implementation of the algorithm was written in Python. The results of test runs looked promising, and we reimplemented the algorithm in C using the Gnu Multi-Precision library to carry out operations with arbitrary-length integers. The C implementation was run with q max = 0000 (corresponding to a x max of 0 24 ). The run lasted for 368 processor-hours, and after 840 processor-hours the algorithm found example #43 in Table. A subsequent run, with q max = (corresponding to a x max of ), lasted for processor-hours and found an example that was earlier found by Calvo et al. []. After these experiences we modified our C code for being run on the Norwegian national computing facilities (Notur). The computations at national facilities took about.3 millions processor-hours. Our computations have detected 9 previously unknown good examples and verified that all good examples where x is less than 0 29 are included in Table. The second column of Table shows the x of a good example (x, y). The r appearing in the third column of the table, is given by r = x /2 /(x 3 y 2 ). High values of r indicate that (the original) Hall s Conjecture is false. The fourth column shows the rational approximation p q to x/2. 5. The Proof of Theorem 2.3 Throughout this section we will use w to denote x /2 and k to denote x 3 y 2. Lemma 5.. Let (x, y) be a good example. Then there exists γ R such that y = x 3/2 ( + γ) and k 2x 3 < γ < k + 2x 3. Proof. Let γ R be such that y = x 3/2 ( + γ). Then we have (5.) y = x 3/2 ( + γ) = w 3 ( + γ). Furthermore, we have γw 3 = w 3 ( + γ) w 3 = y w 3 (5.) = (y 2 w 6 )/(y + w 3 ) = (y 2 x 3 )/(y + w 3 ) since w = x /2 = k/(y + w 3 ) since x 3 y 2 = k This establishes that γw 3 = k/(y + w 3 ), and thus γ = k/w 3 (y + w 3 ). Furthermore, since k < w = x /2 and x 2, we have (5.2) We also have (5.3) γ = k w 3 (y + w 3 ) < k w 6 < w 5 <. γ = k 2w 6 ( + 2 γ)
9 SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE 9 since γ (5.4) (5.2) = k w 3 (y + w 3 ) Next we prove that (5.) = γ < k w 3 (w 3 ( + γ) + w 3 ) k = w 6 (2 + γ) ( + γ 2 ) < + γ. Let r be a real number such that 0 < r <. Then we have = k 2w 6 ( + 2 γ). < + r 2 r2 = ( + r)( r 2 2 ) and thus /( r 2 ) < + r. By (5.2), we have γ <. Hence, if γ > 0, we have and if γ < 0, we have + γ 2 < γ 2 < + γ = + γ + γ = < + γ. 2 γ 2 This shows that /( + γ 2 ) < + γ. A symmetric argument shows that γ < /( + γ 2 ). Use that > r 2 r2 = ( r)( + r 2 2 ) when 0 < r <. This concludes the proof of (5.4). By (5.3) and (5.4), we have k k γ 2w 6 = k ( γ ) 2w 6 < γ < Finally, as k γ < w <, we have 4 This proves the lemma as w = x /2. k ( + γ ) 2w 6 = k 2w 6 < γ < k + 2w 6. k + k γ 2w 6. We are now ready to prove Theorem 2.3. Let (x, y) be a good example where x 2. We need to prove that there exist co-prime natural numbers p and q such that q x /6 and (Claim ) 0 < C(q, p, x, y) < 3qx /6 + (Claim 2) F (q, p, x, y) < 8q + (Claim 3) H(q, p, x, y) < 72q 4 + By Theorem 2.2 and Lemma 5., we have δ, γ R and p, q, Q N such that p and q are co-prime and (5.5) p = qw( + δ) and y = w 3 ( + γ).
10 0 STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD Moreover, we have the following bounds: (5.6) 0 < q < w /3 < Q (5.7) δ < qwq (5.8) γ < k 2w 6. Note that we also have k < w as (x, y) is a good example. Furthermore, note that (x, y) is a good example where x 2. There are no other good examples where x is less than 5234 except the one where x = 2. It follows that w > 72 and Q > 4. The Proof of (Claim ). The definition of C says that (5.9) C = p 3 3pq 2 x + 2q 3 y By (5.5) and (5.9), we have C = q 3 w 3 (δ 3 + 3δ 2 + 2γ) (substitute qw( + δ) and w 3 ( + γ) for respectively p and y and simplify the expression). First we prove 0 < C. It follows from (5.7) that δ < 2, and thus we have (5.0) δ 3 + 3δ 2 = 2δ 2 + δ 2 ( + δ) > 0. If γ 0, it follows trivially from (5.0) that 0 < C. If γ < 0, then y < w 3, i.e. x 3 y 2 = k > 0. Then we have C = q 3 w 3 (δ 3 + 3δ 2 + 2γ) (5.0) > q 3 w 3 2γ (5.8) > q 3 w 3 2 k 2w 6 = q3 k w 3 (5.6) > k w 2 >. This proves that C >. We will now prove that C 0 (and thus we have C > 0). Assume that C = 0 (we prove that (x, y) is not a good example). By (5.9), we have p 3 = q(2q 2 y 3pqx). This shows that any prime divisor of q divides p, but p and q are co-prime, and thus q =. Equation (5.9) with C = 0 and q = gives (5.) 0 = p 3 3px + 2y We will prove that a solution of (5.) cannot yield a good example. The proof splits into the three cases: the case when x = p 2, the case when x > p 2, and the case when x < p 2. Assume x = p 2. Then y = p 3 gives a solution of (5.), but x 3 y 2 = 0. Thus, (x, y) is not a good example. Assume x > p 2. Then we have x = p 2 + m for some positive natural number m. Thus x 3 = (p 2 + m) 3 = p 6 + 3p 4 m + 3p 2 m 2 + m 3 By (5.) we have and y = 3px p3 2 = 3p(p2 + m) p 3 2 y 2 = p 6 + 3p 4 m + 9p2 m 2. 4 = p 3 + 3pm 2
11 SEARCH FOR GOOD EXAMPLES OF HALL S CONJECTURE Hence x 3 y 2 = 3p2 m 2 + m 3 > p 4 and we conclude that (x, y) is not a good example as p x /2. A similar argument shows that (x, y) is not a good example if x < p 2. This proves that C > 0. Next we prove that C < 3qw /3 +. This will complete the proof of (Claim ) since w /3 = x /6. We have C = q 3 w 3 (δ 3 + 3δ 2 + 2γ) q 3 w 3 ( δ δ γ ) ( [ ] (5.7,5.8) 3 [ ] 2 [ ] ) k < q 3 w qwq qwq 2w 6 = Q 3 + 3qw Q 2 + q3 k w 3 (5.6) < w + 3qw/3 + k w 2 < w + 3qw/3 + w. Thus, we have C < 3qw /3 + as w = x /2 > 72 in any good example where x 2. The Proof of (Claim 2). It follows straightforwardly from Definition 2. that F = p 4 6p 2 q 2 w 2 + 8pq 3 y 3q 4 w 4. By (5.5), we have F = q 4 w 4 (δ 4 + 4δ 3 + 8γ + 8γδ). We have F q 4 w 4 ( δ δ γ + 8 γ δ ) ( [ ] (5.7,5.8) 4 [ ] 3 [ ] k < q 4 w qwq qwq 2w 6 [ ] [ ] ) k + 8 2w 6 qwq = Q 4 + 4qw Q 3 + 4q4 k w 2 + 4q3 k w 3 Q < Q 4 + 4qw Q 3 + 4q4 w + 4q3 w 2 Q Thus, F < 8q + as w > 72 and Q > 4. (5.6) < 4 + 4q + 4q + Q4 wq. The Proof of (Claim 3). It follows straightforwardly from Definition 2. that H = p 6 5p 4 q 2 w p 3 q 3 y 45p 2 q 4 w q 5 pw 2 y + 27q 6 w 6 32q 6 y 2. By (5.5), we have H = q 6 w 6 (44δγ 32γ δ 3 γ + 20δ 2 γ + 6 δ 5 + δ 6 ). In order to prove that that H < 72q 4 +, we need (5.2) and (5.3) q 6 w 6 (32 γ δ 3 γ + 20 δ 2 γ + 6 δ 5 + δ 6 ) < 44q 6 w 6 δ γ [ ] [ ] (5.7,5.8) k < 44q 6 w 6 qwq 2w 6 = 72q5 k wq (5.6) < 72q 4. The proof of (5.2) is tedious, but straightforward. Use that k < w, that q < w /3 < Q, that w > 72 and that Q > 4.
12 2 STÅL AANDERAA, LARS KRISTIANSEN, AND HANS KRISTIAN RUUD Now we have H q 6 w 6 (44 δ γ + 32 γ δ 3 γ + 20 δ 2 γ + 6 δ 5 + δ 6 ) = 44q 6 w 6 δ γ + q 6 w 6 (32 γ δ 3 γ + 20 δ 2 γ + 6 δ 5 + δ 6 ). Thus, we have H < 72q 4 + by (5.2) and (5.3). Acknowledgments The authors want to thank the referees and the editor for valuable advice regarding the presentation. Furthermore, the authors want to thank N. D. Elkies for comments on an earlier version of this paper and R. H. Johansen for helpful advice on parallel programming. The authors gratefully acknowledge the support from the Norwegian meta-center for computational science (Notur). References. I. Jiménez Calvo, J. Herranz and G. Sáez, A new algorithm to search for small x 3 y 2 values. Mathematics of Computation, 78 (2009), L.V. Danilov, The Diophantine equation x 2 y 3 = k and Halls conjecture. Math. Notes Acad.Sci.USSR 32 (982), N. D. Elkies, Rational points near curves and small nonzero x 2 y 3 via lattice reduction. Pages 3363 in Algorithmic Number Theory (Proceedings of ANTS-IV;W. Bosma, ed.; Berlin: Springer, 2000; Lecture Notes in Comput. Sci. 838). 4. M. Hall, The Diophantine equation x 3 y 2. Computers in Number Theory (A. Atkin, B. Birch, eds.; Academic Press, 97), pp J. Gebel, A. Pethő and H. G. Zimmer, On Mordells equation. Compositio Math. 0 (998), A. Ya. Khintchine, Continued Fractions. (Translated by Peter Wynn.) P. Noordhoff, Ltd., Groningen, The Netherlands, I. Niven, H. S. Zuckerman and H. L. Montgomery, An Introduction to the Theory of Numbers. John Wiley & Sons, Inc Department of Mathematics, University of Oslo, P.O.Box 053 Blindern, NO-036 Oslo, Norway address: staal@math.uio.no Department of Mathematics, University of Oslo, P.O.Box 053 Blindern, NO-036 Oslo, Norway address: larsk@math.uio.no Department of Mathematics, University of Oslo, P.O.Box 053 Blindern, NO-036 Oslo, Norway
On the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More informationSimplifying Rational Expressions and Functions
Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationON SOME DIOPHANTINE EQUATIONS (I)
An. Şt. Univ. Ovidius Constanţa Vol. 10(1), 2002, 121 134 ON SOME DIOPHANTINE EQUATIONS (I) Diana Savin Abstract In this paper we study the equation m 4 n 4 = py 2,where p is a prime natural number, p
More informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More information6.1. Rational Expressions and Functions; Multiplying and Dividing. Copyright 2016, 2012, 2008 Pearson Education, Inc. 1
6.1 Rational Expressions and Functions; Multiplying and Dividing 1. Define rational expressions.. Define rational functions and give their domains. 3. Write rational expressions in lowest terms. 4. Multiply
More informationOn Subrecursive Representability of Irrational Numbers, Part II
On Subrecursive Representability of Irrational Numbers, Part II Lars Kristiansen 1,2 1 Department of Mathematics, University of Oslo, Norway 2 Department of Informatics, University of Oslo, Norway Abstract.
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationDirection: You are required to complete this test by Monday (April 24, 2006). In order to
Test 4 April 20, 2006 Name Math 522 Student Number Direction: You are required to complete this test by Monday (April 24, 2006). In order to receive full credit, answer each problem completely and must
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationOn the Rank and Integral Points of Elliptic Curves y 2 = x 3 px
International Journal of Algebra, Vol. 3, 2009, no. 8, 401-406 On the Rank and Integral Points of Elliptic Curves y 2 = x 3 px Angela J. Hollier, Blair K. Spearman and Qiduan Yang Mathematics, Statistics
More informationCONSTRUCTION OF HIGH-RANK ELLIPTIC CURVES WITH A NONTRIVIAL TORSION POINT
MATHEMATICS OF COMPUTATION Volume 66, Number 217, January 1997, Pages 411 415 S 0025-5718(97)00779-5 CONSTRUCTION OF HIGH-RANK ELLIPTIC CURVES WITH A NONTRIVIAL TORSION POINT KOH-ICHI NAGAO Abstract. We
More informationInstructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test
Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 25 April 2008 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationArithmetic, Algebra, Number Theory
Arithmetic, Algebra, Number Theory Peter Simon 21 April 2004 Types of Numbers Natural Numbers The counting numbers: 1, 2, 3,... Prime Number A natural number with exactly two factors: itself and 1. Examples:
More informationLecture 2: Continued fractions, rational approximations
Lecture 2: Continued fractions, rational approximations Algorithmic Number Theory (Fall 204) Rutgers University Swastik Kopparty Scribe: Cole Franks Continued Fractions We begin by calculating the continued
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationSome new families of positive-rank elliptic curves arising from Pythagorean triples
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 27 36 DOI: 10.7546/nntdm.2018.24.3.27-36 Some new families of positive-rank elliptic curves
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction
ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and
More informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
More informationQUARTERNIONS AND THE FOUR SQUARE THEOREM
QUARTERNIONS AND THE FOUR SQUARE THEOREM JIA HONG RAY NG Abstract. The Four Square Theorem was proved by Lagrange in 1770: every positive integer is the sum of at most four squares of positive integers,
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationON TORSION POINTS ON AN ELLIPTIC CURVES VIA DIVISION POLYNOMIALS
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLIII 2005 ON TORSION POINTS ON AN ELLIPTIC CURVES VIA DIVISION POLYNOMIALS by Maciej Ulas Abstract. In this note we propose a new way to prove Nagel
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationTest 2. Monday, November 12, 2018
Test 2 Monday, November 12, 2018 Instructions. The only aids allowed are a hand-held calculator and one cheat sheet, i.e. an 8.5 11 sheet with information written on one side in your own handwriting. No
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationOn a class of quartic Diophantine equations of at least five variables
Notes on Number Theory and Discrete Mathematics Print ISSN 110 512, Online ISSN 27 8275 Vol. 24, 2018, No., 1 9 DOI: 10.754/nntdm.2018.24..1-9 On a class of quartic Diophantine equations of at least five
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationAn example of elliptic curve over Q with rank equal to Introduction. Andrej Dujella
An example of elliptic curve over Q with rank equal to 15 Andrej Dujella Abstract We construct an elliptic curve over Q with non-trivial 2-torsion point and rank exactly equal to 15. 1 Introduction Let
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationChris K. Caldwell 1 Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN 38238, USA
#A36 INTEGERS 10 (2010), 423-436 POWERS OF SIERPIŃSKI NUMBERS BASE B Chris K. Caldwell 1 Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN 38238, USA caldwell@utm.edu
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationProof worksheet solutions
Proof worksheet solutions These are brief, sketched solutions. Comments in blue can be ignored, but they provide further explanation and outline common misconceptions Question 1 (a) x 2 + 4x +12 = (x +
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Factorise each polynomial: a) x 2 6x + 5 b) x 2 16 c) 9x 2 25 2) Simplify the following algebraic fractions fully: a) x 2
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationNumber Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:
Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationLECTURE 22, WEDNESDAY in lowest terms by H(x) = max{ p, q } and proved. Last time, we defined the height of a rational number x = p q
LECTURE 22, WEDNESDAY 27.04.04 FRANZ LEMMERMEYER Last time, we defined the height of a rational number x = p q in lowest terms by H(x) = max{ p, q } and proved Proposition 1. Let f, g Z[X] be coprime,
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
More informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More informationFIBONACCI DIOPHANTINE TRIPLES. Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary
GLASNIK MATEMATIČKI Vol. 436300, 53 64 FIBONACCI DIOPHANTINE TRIPLES Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary Abstract. In
More informationA Guide to Arithmetic
A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully
More informationOEIS A I. SCOPE
OEIS A161460 Richard J. Mathar Leiden Observatory, P.O. Box 9513, 2300 RA Leiden, The Netherlands (Dated: August 7, 2009) An overview to the entries of the sequence A161460 of the Online Encyclopedia of
More informationC-N Math 207 Discrete Math
C-N Math 207 - Massey, 1 / 70 C-N Math 207 Discrete Math Kenneth Massey September 16, 2011 Question C-N Math 207 - Massey, 2 / 70 Introduction What is the smallest positive number? Sets C-N Math 207 -
More informationC-N Math 207 Discrete Math
C-N Math 207 Discrete Math Kenneth Massey September 16, 2011 C-N Math 207 - Massey, 1 / 70 Question Introduction What is the smallest positive number? C-N Math 207 - Massey, 2 / 70 Sets Introduction a
More informationCLASS-IX MATHEMATICS. For. Pre-Foundation Course CAREER POINT
CLASS-IX MATHEMATICS For Pre-Foundation Course CAREER POINT CONTENTS S. No. CHAPTERS PAGE NO. 0. Number System... 0 3 0. Polynomials... 39 53 03. Co-ordinate Geometry... 54 04. Introduction to Euclid's
More informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationArithmetic Progressions Over Quadratic Fields
Arithmetic Progressions Over Quadratic Fields Alexander Diaz, Zachary Flores, Markus Vasquez July 2010 Abstract In 1640 Pierre De Fermat proposed to Bernard Frenicle de Bessy the problem of showing that
More informationA Local-Global Principle for Diophantine Equations
A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.
More information数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2012), B32:
Imaginary quadratic fields whose ex Titleequal to two, II (Algebraic Number 010) Author(s) SHIMIZU, Kenichi Citation 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (01), B3: 55-69 Issue Date 01-07 URL http://hdl.handle.net/33/19638
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationCONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES. Reinier Bröker
CONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES Reinier Bröker Abstract. We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over F q with trace
More informationA new proof of Euler s theorem. on Catalan s equation
Journal of Applied Mathematics & Bioinformatics, vol.5, no.4, 2015, 99-106 ISSN: 1792-6602 (print), 1792-6939 (online) Scienpress Ltd, 2015 A new proof of Euler s theorem on Catalan s equation Olufemi
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More information6.1 Polynomial Functions
6.1 Polynomial Functions Definition. A polynomial function is any function p(x) of the form p(x) = p n x n + p n 1 x n 1 + + p 2 x 2 + p 1 x + p 0 where all of the exponents are non-negative integers and
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationLECTURE 2 FRANZ LEMMERMEYER
LECTURE 2 FRANZ LEMMERMEYER Last time we have seen that the proof of Fermat s Last Theorem for the exponent 4 provides us with two elliptic curves (y 2 = x 3 + x and y 2 = x 3 4x) in the guise of the quartic
More informationThe density of rational points on cubic surfaces
ACTA ARITHMETICA LXXIX.1 (1997) The density of rational points on cubic surfaces by D. R. Heath-Brown (Oxford) For Professor J. W. S. Cassels on his 75th birthday 1. Introduction. Let F (W, X, Y, Z) Z[W,
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationOn Anti-Elite Prime Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.9.4 On Anti-Elite Prime Numbers Tom Müller Institut für Cusanus-Forschung an der Universität und der Theologischen Fakultät Trier
More informationA STUDY ON THE CONCEPT OF DIOPHANTINE EQUATIONS
Airo International Research Journal March, 2014 Volume III, ISSN: 2320-3714 A STUDY ON THE CONCEPT OF DIOPHANTINE EQUATIONS Alham Research Scholar, Himalayan University, Itanagar, Arunachal Pradesh ABSTRACT
More informationQUARTIC POWER SERIES IN F 3 ((T 1 )) WITH BOUNDED PARTIAL QUOTIENTS. Alain Lasjaunias
QUARTIC POWER SERIES IN F 3 ((T 1 )) WITH BOUNDED PARTIAL QUOTIENTS Alain Lasjaunias 1991 Mathematics Subject Classification: 11J61, 11J70. 1. Introduction. We are concerned with diophantine approximation
More informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationTenth Bit Bank Mathematics Real Numbers
Tenth Bit Bank Mathematics Real Numbers 1. The rational number among the following is... i) 4.28 ii) 4.282828... iii) 4.288888... A) i) & ii) B) ii) & iii) C) i) & iii) D) All the above 2. A rational number
More informationAiro International Research Journal September, 2016 Volume VII, ISSN:
1 DIOPHANTINE EQUATIONS AND THEIR SIGNIFICANCE Neelam Rani Asstt. Professor in Department of Mathematics Shri Krishna Institute of Engg, & Technology, Kurukshetra (Haryana) ABSTRACT A Diophantine equation
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationIntroduction to Algebraic Number Theory Part I
Introduction to Algebraic Number Theory Part I A. S. Mosunov University of Waterloo Math Circles November 7th, 2018 Goals Explore the area of mathematics called Algebraic Number Theory. Specifically, we
More informationSum of cubes is square of sum
Notes on Number Theory and Discrete Mathematics Vol. 19, 2013, No. 1, 1 13 Sum of cubes is square of sum Edward Barbeau and Samer Seraj University of Toronto e-mails: barbeau@math.toronto.edu, samer.seraj@mail.utoronto.ca
More informationDetermining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields
Determining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields István Gaál, University of Debrecen, Mathematical Institute H 4010 Debrecen Pf.12., Hungary
More informationPolynomial Expressions and Functions
Hartfield College Algebra (Version 2017a - Thomas Hartfield) Unit FOUR Page - 1 - of 36 Topic 32: Polynomial Expressions and Functions Recall the definitions of polynomials and terms. Definition: A polynomial
More informationIntroduction Diophantine Equations The ABC conjecture Consequences. The ABC conjecture. Brian Conrad. September 12, 2013
The ABC conjecture Brian Conrad September 12, 2013 Introduction The ABC conjecture was made by Masser and Oesterlé in 1985, inspired by work of Szpiro. A proof was announced in Sept. 2012 by Mochizuki.
More informationCLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS
CLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS DANIEL FISHMAN AND STEVEN J. MILLER ABSTRACT. We derive closed form expressions for the continued fractions of powers of certain
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
More information