ON DIVISORS OF LUCAS AND LEHMER NUMBERS

Size: px
Start display at page:

Download "ON DIVISORS OF LUCAS AND LEHMER NUMBERS"

Transcription

1 This aer submitte to Acta Mathematica. ON DIVISORS OF LUCAS AND LEHMER NUMBERS C.L. STEWART 1. Introuction Let u n be the n-th term of a Lucas sequence or a Lehmer sequence. In this article we shall establish an estimate from below for the greatest rime factor of u n which is of the form n exlog n/104 log log n). In so oing we are able to resolve a question of Schinzel from 1962 an a conjecture of Erős from In aition we are able to give the first general imrovement on results of Bang from 1886 an Carmichael from Let α an β be comlex numbers such that α + β an αβ are non-zero corime integers an α/β is not a root of unity. Put u n = α n β n )/α β) for n 0. The integers u n are known as Lucas numbers an their ivisibility roerties have been stuie by Euler, Lagrange, Gauss, Dirichlet an others see [11, Chater XVII]). In 1876 Lucas [24] announce several new results concerning Lucas sequences u n ) n=0 an in a substantial aer in 1878 [25] he gave a systematic treatment of the ivisibility roerties of Lucas numbers an inicate some of the contexts in which they aeare. Much later Matijasevic [26] aeale to these roerties in his solution of Hilbert s 10th roblem. For any integer m let P m) enote the greatest rime factor of m with the convention that P m) = 1 when m is 1, 0 or 1. In 1912 Carmichael [8] rove that if α an β are real an n > 12 then P u n ) n 1. 1) Results of this character ha been establishe earlier for integers of the form a n b n where a an b are integers with a > b > 0. Inee Zsigmony [49] in 1892 an Birkhoff an Vaniver [6] in 1904 rove that for n > 2 P a n b n ) n + 1, 2) while in the secial case that b = 1 the result is ue to Bang [4] in In 1930 Lehmer [22] showe that the ivisibility roerties of Lucas numbers hol in a more general setting. Suose that α + β) 2 an αβ are corime non-zero integers with α/β not a root of unity an, for n > 0, ut { α n β n )/α β) for n o, ũ n = α n β n )/α 2 β 2 ) for n even. Research suorte in art by the Canaa Research Chairs Program an by Grant A3528 from the Natural Sciences an Engineering Research Council of Canaa. 1

2 2 C.L. STEWART Integers of the above form have come to be known as Lehmer numbers. Observe that Lucas numbers are also Lehmer numbers u to a multilicative factor of α + β when n is even. In 1955 War [45] rove that if α an β are real then for n > 18, P ũ n ) n 1, 3) an four years later Durst [13] observe that 3) hols for n > 12. A rime number is sai to be a rimitive ivisor of a Lucas number u n if ivies u n but oes not ivie α β) 2 u 2 u n 1. Similarly is sai to be a rimitive ivisor of a Lehmer number ũ n if ivies ũ n but oes not ivie α 2 β 2 ) 2 ũ 3 ũ n 1. For any integer n > 0 an any air of comlex numbers α an β, we enote the n-th cyclotomic olynomial in α an β by Φ n α, β), so n Φ n α, β) = α ζ j β), j=1 j,n)=1 where ζ is a rimitive n-th root of unity. One may check, see [38], that Φ n α, β) is an integer for n > 2 if α + β) 2 an αβ are integers. Further, see Lemma 6 of [38], if, in aition, α + β) 2 an αβ are corime non-zero integers, α/β is not a root of unity an n > 4 an n is not 6 or 12 then P n/3, n)) ivies Φ n α, β) to at most the first ower an all other rime factors of Φ n α, β) are congruent to 1 or 1 moulo n. The last assertion can be strengthene in the case that α an β are corime integers to the assertion that all other rime factors of Φ n α, β) are congruent to 1 mo n). Since α n β n = n Φ α, β), 4) Φ 1 α, β) = α β an Φ 2 α, β) = α + β we see that if n excees 2 an is a rimitive ivisor of a Lucas number u n or Lehmer number ũ n then ivies Φ n α, β). Further, a rimitive ivisor of a Lucas number u n or Lehmer number ũ n is not a ivisor of n an so it is congruent to ±1 mo n). Estimates 1), 2) an 3) follow as consequences of the fact that the n-th term of the sequences in question ossesses a rimitive ivisor. It was not until 1962 that this aroach was extene to the case where α an β are not real by Schinzel [31]. He rove, by means of an estimate for linear forms in two logarithms of algebraic numbers ue to Gelfon [17], that there is a ositive number C, which is effectively comutable in terms of α an β, such that if n excees C then ũ n ossesses a rimitive ivisor. In 1974 Schinzel [35] emloye an estimate of Baker [2] for linear forms in the logarithms of algebraic numbers to show that C can be relace by a ositive number C 0, which oes not een on α an β, an in 1977 Stewart [39] showe C 0 coul be taken to be e This was subsequently refine by Voutier [42, 43] to In aition Stewart [39] rove that C 0 can be taken to be 6 for Lucas numbers an 12 for Lehmer numbers with finitely many excetions an that the excetions coul be etermine by solving a finite number of Thue equations. This rogram was successfully carrie out by Bilu, Hanrot an Voutier [5] an as a consequence they were able to show that for n > 30 the n-th term of a Lucas or Lehmer sequence has a rimitive ivisor. Thus 1) an 3) hol for n > 30 without the restriction that α an β be real. In 1962 Schinzel [30] aske if there exists a air of integers a, b with ab ifferent from ±2c 2 an ±c h with h 2 for which P a n b n ) excees 2n for all sufficiently

3 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 3 large n. In 1965 Erős [14] conjecture that P 2 n 1) as n. n Thirty five years later Murty an Wong [28] showe that Erős conjecture is a consequence of the abc conjecture [41]. They rove, subject to the abc conjecture, that if ε is a ositive real number an a an b are integers with a > b > 0 then P a n b n ) > n 2 ε, rovie that n is sufficiently large in terms of a, b an ε. In 2004 Murata an Pomerance [27] rove, subject to the Generalize Riemann Hyothesis, that P 2 n 1) > n 4/3 / log log n 5) for a set of ositive integers n of asymtotic ensity 1. The first unconitional refinement of 2) was obtaine by Schinzel [30] in He rove that if a an b are corime an ab is a square or twice a square then P a n b n ) 2n + 1 rovie that one exclues the cases n = 4, 6, 12 when a = 2 an b = 1. Schinzel rove his result by showing that the term a n b n was ivisible by at least 2 rimitive ivisors. To rove this result he aeale to an Aurifeuillian factorization of Φ n. Rotkiewicz [29] extene Schinzel s argument to treat Lucas numbers an then Schinzel [32, 33, 34] in a sequence of articles gave conitions uner which Lehmer numbers ossess at least 2 rimitive ivisors an so uner which 3) hols with n + 1 in lace of n 1, see also [21]. In 1975 Stewart [37] rove that if κ is a ositive real number with κ < 1/ log 2 then P a n b n )/n tens to infinity with n rovie that n runs through those integers with at most κ log log n istinct rime factors, see also [15]. Stewart [38] in the case that α an β are real an Shorey an Stewart [36] in the case that α an β are not real generalize this work to Lucas an Lehmer sequences. Let α an β be comlex numbers such that α + β) 2 an αβ are non-zero relatively rime integers with α/β not a root of unity. For any ositive integer n let ωn) enote the number of istinct rime factors of n an ut qn) = 2 ωn), the number of square-free ivisors of n. Further let ϕn) be the number of ositive integers less than or equal to n an corime with n. They showe, recall 4), if n > 3) has at most κ log log n istinct rime factors then P Φ n α, β)) > Cϕn) log n)/qn), 6) where C is a ositive number which is effectively comutable in terms of α, β an κ only. The roofs een on lower bouns for linear forms in the logarithms of algebraic numbers in the comlex case when α an β are real an in the -aic case otherwise. The urose of the resent aer is to answer in the affirmative the question ose by Schinzel [30] an to rove Erős conjecture in the wier context of Lucas an Lehmer numbers. Theorem 1.1. Let α an β be comlex numbers such that α + β) 2 an αβ are non-zero integers an α/β is not a root of unity. There exists a ositive number C, which is effectively comutable in terms of ωαβ) an the iscriminant of Qα/β), such that for n > C, P Φ n α, β)) > n exlog n/104 log log n). 7)

4 4 C.L. STEWART Our result, with the ai of 4) gives an imrovement of 1), 2), 3) an 6), answers the question of Schinzel an roves the conjecture of Erős. Secifically, if a an b are integers with a > b > 0 then P a n b n ) > n exlog n/104 log log n), 8) for n sufficiently large in terms of the number of istinct rime factors of ab. We remark that the factor 104 which occurs on the right han sie of 7) has no arithmetical significance. Instea it is etermine by the current quality of the estimates for linear forms in -aic logarithms of algebraic numbers. In fact we coul relace 104 by any number strictly larger than 14e 2. The roof eens uon estimates for linear forms in the logarithms of algebraic numbers in the comlex an the -aic case. In articular it eens uon a result of Yu [48] where imrovements uon the eenence on the arameter in the lower bouns for linear forms in -aic logarithms of algebraic numbers are establishe. This allows us to estimate irectly the orer of rimes iviing Φ n α, β). The estimates are non-trivial for small rimes an, coule with an estimate from below for Φ n α, β), they allow us to show that we must have a large rime ivisor of Φ n α, β) since otherwise the total non-archimeean contribution from the rimes oes not balance that of Φ n α, β). By contrast for the roof of 6) a much weaker assumtion on the greatest rime factor is imose an it leas to the conclusion that then Φ n α, β) is ivisible by many small rimes. This art of the argument from [36] an [38] was also emloye in Murata an Pomerance s [27] roof of 5) an in estimates of Stewart [40] for the greatest square-free factor of ũ n. My initial roof of the conjecture of Erős utilize an estimate for linear forms in -aic logarithms establishe by Yu [47]. In orer to treat also Lucas an Lehmer numbers however, I nee the more refine estimate obtaine in [48], see 3. For any non-zero integer x let or x enote the -aic orer of x. Our next result follows from a secial case of Lemma 8 of this aer. Lemma 8 yiels a crucial ste in the roof of Theorem 1. An unusual feature of the roof of Lemma 8 is that we artificially inflate the number of terms which occur in the -aic linear form in logarithms which aears in the argument. We have chosen to highlight it in the integer case. Theorem 1.2. Let a an b be integers with a > b > 0. There exists a number C 1, which is effectively comutable in terms of ωab), such that if is a rime number which oes not ivie ab an which excees C 1 an n is an integer with n 2 then or a n b n ) < ex log /52 log log ) log a + or n. 9) If a an b are integers with a > b > 0, n is an integer with n 2 an is an o rime number which oes not ivie ab an excees C 1 then or a 1 b 1 ) < ex log /52 log log ) log a. Yamaa [46], by making use of a refinement of an estimate of Bugeau an Laurent [7] for linear forms in two -aic logarithms, rove that there is a ositive number C 2, which is effectively comutable in terms of ωa), such that or a 1 1) < C 2 /log ) 2 ) log a. 10)

5 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 5 By following our roof of Theorem 1 an using 10) in lace of Lemma 8 it is ossible to show that there exist ositive numbers C 3, C 4 an C 5, which are effectively comutable in terms of ωa) such that if n excees C 3 then P a n 1) > C 4 ϕn)log n log log n) 1 2 an so, by Theorem 328 of [19], P a n 1) > C 5 nlog n/ log log n) ) This gives an alternative roof of the conjecture of Erős, although the lower boun 11) is weaker than the boun 8). The research for this aer was one in art uring visits to the Hong Kong University of Science an Technology, Institut es Hautes Étues Scientifiques an the Erwin Schröinger International Institute for Mathematical Physics an I woul like to exress my gratitue to these institutions for their hositality. In aition I wish to thank Professor Kunrui Yu for helful remarks concerning the resentation of this article an for our extensive iscussions on estimates for linear forms in -aic logarithms which le to [48]. 2. Preliminary lemmas Let α an β be comlex numbers such that α + β) 2 an αβ are non-zero integers an α/β is not a root of unity. We shall assume, without loss of generality, that α β. Observe that r + s r s α =, β = 2 2 where r an s are non-zero integers with r s. Further Qα/β) = Q rs). Note that α 2 β 2 ) 2 = rs an we may write rs in the form m 2 with m a ositive integer an a square-free integer so that Q rs) = Q ). For any algebraic number γ let hγ) enote the absolute logarithmic height of γ. In articular if a 0 x γ 1 ) x γ ) in Z[x] is the minimal olynomial of γ over Z then hγ) = 1 log a 0 + log max1, γ j ). Notice that j=1 αβx α/β)x β/α) = αβx 2 α 2 + β 2 )x + αβ = αβx 2 α + β) 2 2αβ)x + αβ is a olynomial with integer coefficients an so either α/β is rational or the olynomial is a multile of the minimal olynomial of α/β. Therefore we have hα/β) log α. 12) We first recor a result escribing the rime factors of Φ n α, β). Lemma 2.1. Suose that α + β) 2 an αβ are corime. If n > 4 an n 6, 12 then P n/3, n)) ivies Φ n α, β) to at most the first ower. All other rime factors of Φ n α, β) are congruent to ±1 mo n). Proof. This is Lemma 6 of [38].

6 6 C.L. STEWART Let K be a finite extension of Q an let be a rime ieal in the ring of algebraic integers O K of K. Let O consist of 0 an the non-zero elements α of K for which has a non-negative exonent in the canonical ecomosition of the fractional ieal generate by α into rime ieals. Then let P be the unique rime ieal of O an ut K = O /P. Further for any α in O we let α be the image of α uner the resiue class ma that sens α to α + P in K. Our next result is motivate by work of Lucas [25] an Lehmer [22]. Let be an o rime an be an integer corime with. Recall that the Legenre symbol ) is 1 if is a quaratic resiue moulo an 1 otherwise. Lemma 2.2. Let be a square-free integer ifferent from 1, θ be an algebraic integer of egree 2 over Q in Q ) an let θ enote the algebraic conjugate of θ over Q. Suose that is a rime which oes not ivie 2θθ. Let be a rime ieal of the ring of algebraic integers of Q ) lying above. The orer of θ/θ in Q ) ) is a ivisor of 2 if ivies θ 2 θ 2 ) 2 an a ivisor of otherwise. Proof. We first note that θ an θ are -aic units. If ivies θ 2 θ 2 ) 2 then either ivies θ θ ) 2 or ivies θ + θ an in both cases θ/θ ) 2 1 mo ). Thus the orer of θ/θ ivies 2. Thus we may suose that oes not ivie 2θθ θ 2 θ 2 ) 2 an, in articular,. Since 2θ = θ + θ ) + θ θ ) an 2θ = θ + θ ) θ θ ) 13) we see, on raising both sies of the above equations to the -th ower an subtracting, that 2 θ θ ) 2θ θ ) is θ θ ) times an algebraic integer. Hence, since is o, θ θ θ θ θ θ ) 1 mo ). But θ θ ) 1 = θ θ ) 2 ) 1 θ θ ) 2 ) 2 mo ) an θ θ ) 2 ) ) =, so θ θ ) θ θ mo ). 14) By raising both sies of equation 13) to the -th ower an aing we fin that an since If θ+θ ) 2 ) = 1, θ + θ θ + θ θ + θ ) 1 mo ) ) = 1 then aing 14) an 15) we fin that θ + θ θ + θ 1 mo ). 15) 2 θ+1 θ +1 θ 2 θ 2 0 mo ) )

7 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 7 hence, since oes not ivie 2θθ θ 2 θ 2 ) 2, an the result follows. If θ/θ ) +1 1 mo ) ) = 1 then subtracting 14) an 15) we fin that 2θθ θ 1 θ 1 θ 2 θ 2 0 mo ) hence, since oes not ivie 2θθ θ 2 θ 2 ) 2, an this comletes the roof. θ/θ ) 1 1 mo ) Let l an n be integers with n 1 an for each real number x let πx, n, l) enote the number of rimes not greater than x an congruent to l moulo n. We require a version of the Brun-Titchmarsh theorem, see [18, Theorem 3.8]. Lemma 2.3. If 1 n < x an n, l) = 1 then πx, n, l) < 3x/ϕn) logx/n)). Our next result gives an estimate for the rimes below a given boun which occur as the norm of an algebraic integer in the ring of algebraic integers of Qα/β). Lemma 2.4. Let be a squarefree integer with 1 an let k enote the k-th smallest rime of the form Nπ k = k where N enotes the norm from Q ) to Q an π k is an algebraic integer in Q ). Let ε be a ositive real number. There is a ositive number C, which is effectively comutable in terms of ε an, such that if k excees C then log k < 1 + ε) log k. Proof. Let K = Q ) an enote the ring of algebraic integers of K by O K. A rime is the norm of an element π of O K rovie that it is reresentable as the value of the rimitive quaratic form q K x, y) given by x 2 y 2 if 1 mo 4) an x 2 + xy + ) 1 4 y 2 if 1 mo 4). By [16, Chater VII, 2.14)], a rime is reresente by q K x, y) if an only if is not inert in K an the rime ieals of O K above have trivial narrow class in the narrow ieal class grou of K. Let K H be the strict Hilbert class fiel of K. Since K H is normal over K an G, the Galois grou of K H over K, is isomorhic with the narrow ieal class grou of K it follows that G = h +, the strict ieal class number of K, see Theorem of [10]. The rime ieals of O K which o not ramify in K H an which are rincial are the only rime ieals of O K which o not ramify in K H an which slit comletely in K H, see Theorem of [10].[ These ] rime ieals may be counte by the Chebotarev Density Theorem. Let KH /K enote the conjugacy class of Frobenius automorhisms corresoning to rime ieals P of O KH above. In articular, for each conjugacy class C of G we efine π C x, K H /K) to be the carinality] of the set of rime ieals of O K which are unramifie in K H, for which = C an for which N K/Q x. Denote by C 0 the conjugacy class [ KH /K consisting of the ientity element of G. Note that the number of inert rimes of O K for which N K/Q x is at most x 1/2. Thus the number of rimes u to x for which is the norm of an element π of O K is boune from below by π C0 x, K H /K) x 1/2. 16)

8 8 C.L. STEWART It follows from Theorem 1.3 an 1.4 of [23] that there is a ositive number C 1, which is effectively comutable in terms of, such that for x greater than C 1 the quantity 16) excees x 2h + log x. Further when x is at least 4h + k log k an x 2h + log x > k Thus, rovie 17) hols an x excees C 1, k/ log k > 4h +. 17) k < 4h + k log k. 18) Our result now follows from 18) on taking logarithms. 3. Estimates for linear forms in -aic logarithms of algebraic numbers Let α 1,..., α n be non-zero algebraic numbers an ut K = Qα 1,..., α n ) an = [K : Q]. Let be a rime ieal of the ring O K of algebraic integers in K lying above the rime number. Denote by e the ramification inex of an by f the resiue class egree of. For α in K with α 0 let or α be the exonent to which ivies the rincial fractional ieal generate by α in K an ut or 0 =. For any ositive integer m let ζ m = e 2πi/m an ut α 0 = ζ 2 u where ζ 2 u K an ζ 2 u+1 K. Suose that α 1,..., α n are multilicatively ineenent -aic units in K. Let α 0, α 1,..., α n be the images of α 0, α 1,..., α n resectively uner the resiue class ma at from the ring of -aic integers in K onto the resiue class fiel K at. For any set X let X enote its carinality. Let α 0, α 1,..., α n be the subgrou of K ) generate by α 0, α 1,..., α n. We efine δ by an if Denote log maxx, e) by log x. δ = 1 if [Kα 1/2 0, α 1/2 1,..., α 1/2 n ) : K] < 2 n+1 δ = f 1)/ α 0, α 1,..., α n [Kα 1/2 0, α 1/2 1,..., α 1/2 n ) : K] = 2 n+1. 19) Lemma 3.1. Let be a rime with 5 an let be an unramifie rime ieal of O K lying above. Let α 1,..., α n be multilicatively ineenent -aic units. Let b 1,..., b n be integers, not all zero, an ut Then B = max2, b 1,..., b n ). or α b1 1 αbn n 1) < Chα 1 ) hα n ) maxlog B, n + 1)5.4n + log ))

9 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 9 where C = 376n + 1) 1/2 7e 1 2 f n max δ f log ) n n+2 log loge 4 n + 1)) ) n, e n f log ). Proof. We aly the Main Theorem of [48] an in 1.16) we take C 1 n,,, a)h 1) in lace of the minimum. Further 1.15) hols since our result is symmetric in the b i s. Next we note that, since is unramifie an 5, we may take c 1) = 1794, a 1) = 7 1 2, a1) 0 = 2 + log 7 an a 1) 1 = a 1) 2 = We remark that conition 19) ensures that we may take {θ 1,..., θ n } to be {α 1,..., α n }. Finally the exlicit version of Dobrowolski s Theorem ue to Voutier [44] allows us to relace the first term in the maximum efining h 1) by log B. Therefore we fin that or α b1 1 αbn n 1) < C 1 hα 1 ) hα n ) maxlog B, G 1, n + 1)f log ) where G 1 = n + 1)2 + log 7)n log2 + log 7)n ) + log ) an, on enoting log maxx, e) by log x, )) n 1 n + 1) n+1 n+2 log C 1 = n! 2 u f log ) 2 f ) n n max, e n f log ) maxloge 4 n + 1)), f log ). δ f log Note that 2 u 2 an f log log 5. Further, by Stirling s formula, see of [1], n + 1) n+1 en+1 n + 1) 1/2 n! 2π an so where ) log B or α b1 1 αbn n 1) < C 2 hα 1 ) hα n ) max log 5, G 1 log 5, n + 1 C 2 = e n + 1) 1/2 7e 1 2π 2 f max δ n f log ) n n+2 log ) n ) loge, e n 4 n + 1)) f log. log 5 We next observe that G 1 n + 1)5.4n + log ) an as a consequence ) ) log B max log 5, G 1 log B log 5, n + 1 n + 1)5.4n + log ) = max,. 22) log 5 log 5 The result now follows from 20), 21) an 22). The key new feature in Yu s Main Theorem in [48],as comare with his estimate in [47], is the introuction of the factor δ. It is the resence of δ in the statement of Lemma 3.1 that allows us to exten our argument to the case when Qα/β) is ifferent from Q. 20) 21)

10 10 C.L. STEWART 4. Further reliminaries Let α + β) 2 an αβ be non-zero integers with α/β not a root of unity. We may suose that α β. Since there is a ositive number c 0 which excees 1 such that α c 0 we euce from Lemma 3 of [39], see also Lemmas 1 an 2 of [35], that there is a ositive number c 1 which we may suose excees log c 0 ) 1 such that for n > 0 log 2 + n log α log α n β n n c 1 logn + 1)) log α. 23) The roof of 23) eens uon an estimate for a linear form in the logarithms of two algebraic numbers ue to Baker [2]. For any ositive integer n let µn) enote the Möbius function of n. It follows from 4) that Φ n α, β) = nα n/ β n/ ) µ). 24) We may now euce, following the aroach of [35] an [39], our next result. Lemma 4.1. There exists an effectively comutable ositive number c such that if n > 2 then α ϕn) cqn) log n Φ n α, β) α ϕn)+cqn) log n, 25) where qn) = 2 ωn). Proof. By 24) log Φ n α, β) = µ) log α n/ β n/ n an so by 23) log Φ nα, β) µ) n log α n c 1 logn + 1) log α n µ) 0 since c 1 excees log c 0 ) 1. Our result now follows. Lemma 4.2. There exists an effectively comutable ositive number c 2 such that if n excees c 1 then log Φ n α, β) ϕn) log α. 26) 2 Proof. For n sufficiently large ϕn) > n/2 log log n an qn) < n 1/ log log n. Since α c 0 > 1 it follows from 25) that if n is sufficiently large as require. Φ n α, β) > α ϕn)/2, Lemma 4.3. Let n be an integer larger than 1, let be a rime which oes not ivie αβ an let be a rime ieal of the ring of algebraic integers of Qα/β) lying above which oes not ramify. Then there exists a ositive number C, which is effectively comutable in terms of ωαβ) an the iscriminant of Qα/β), such that if excees C then or α/β) n 1) < ex log /51.9 log log ) log α log n.

11 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 11 Proof. Let c 3, c 4,... enote ositive numbers which are effectively comutable in terms of ωαβ) an the iscriminant of Qα/β). We remark that since α/β is of egree at most 2 over Q the iscriminant of Qα/β) etermines the fiel Qα/β) an so knowing it one may comute the class number an regulator of Qα/β) as well as the strict Hilbert class fiel of Qα/β) an the iscriminant of this fiel. Further let be a rime which oes not ivie 6αβ where is efine as in the first aragrah of 2. Put K = Qα/β) an { i if i K α 0 = 1 otherwise. Let v be the largest integer for which α/β = α j 0 θ2v, 27) with 0 j 3 an θ in K. To see that there is a largest such integer we first note that either there is a rime ieal q of O K, the ring of algebraic integers of K, lying above a rime q which occurs to a ositive exonent in the rincial fractional ieal generate by α/β or α/β is a unit. In the former case hα/β) 2 v 1 log q an in the latter case, since α/β is not a root of unity, there is a ositive number c 3, see [12], such that hα/β) 2 v c 3. Notice from 27) that hα/β) = 2 v hθ). 28) Further, by Kummer theory, see Lemma 3 of [3], [Kα 1/2 0, θ 1/2 ) : K] = 4. 29) Furthermore since αβ an α an β are algebraic integers or α/β) n 1) or α/β) 4n 1). 30) For any real number x let [x] enote the greatest integer less than or equal to x. Put [ ] log k =. 31) 51.8 log log Then, for > c 4, we fin that k 2 an ) k ) k k k max, e k log ) =. 32) log log Our roof slits into two cases. We shall first suose that Qα/β) = Q so that α an β are integers. For any ositive integer j with j 2 let j enote the j 1-th smallest rime which oes not ivie αβ. We ut an m = n2 v+2 33) α 1 = θ/ 2 k. Then ) m θ m θ 1 = m 2 m k 1 = α1 m m 2 m k 1 34) 2 k an by 27), 30), 33) an 34) or α/β) n 1) or α m 1 m 2 m k 1). 35)

12 12 C.L. STEWART Note that α 1, 2,..., k are multilicatively ineenent since α/β is not a root of unity an 2,..., k are rimes which o not ivie αβ. Further, since 2,..., k are ifferent from an oes not ivie αβ, we see that α 1, 2,..., k are -aic units. We now aly Lemma 3.1 with δ = 1, = 1, f = 1 an n = k to conclue that or α1 m m 2 m k 1) c 5 k + 1) 3 log 7e 1 ) k Put max k log t = ωαβ). Let q i enote the i-th rime number. Note that an thus k q k+t+1 2 ) ) k, e k log log k k 1) log q k+t+1. By the rime number theorem with error term, for k > c 6, log m)hα 1 ) log 2 log k. 36) log log k 1.001k 1) log k. 37) By the arithmetic geometric mean inequality log log k log 2 log k k 1 an so, by 37), ) k 1 log 2 log k log k) k 1. 38) Since hα 1 ) hθ) + log 2 k it follows from 37) that hα 1 ) c 7 hθ)k log k. 39) Further m = 2 v+2 n is at most n 2v+2 an so by 12) an 28) hθ) log m 4hα/β) log n 4 log α log n. 40) Thus, by 32), 35), 36), 38), 39) an 40), or α/β) n 1) < c 8 k 4 log 7e 1 ) k log k 1.001k log α log n. 2 log Therefore, by 31), for > c 9 log or α/β) n 1) < e 51.9 log log log α log n. 41) We now suose that [Qα/β) : Q] = 2. Let π 2,..., π k be elements of O K with the roerty that Nπ i ) = i where N enotes the norm from K to Q an where i is the i 1) th smallest rational rime number of this form which oes not ivie 2αβ. We now ut θ i = π i /π i where π i enotes the algebraic conjugate of π i in Qα/β). Notice that oes not ivie π i π i = i an if oes not ivie π i π i )2 then πi π i ) ) )2 =,

13 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 13 since Qα/β) = Q ) = Qπ i ). Thus, by Lemma 2.2, the orer ) of θ i in Qα/β) ) is a ivisor of 2 if ivies πi 2 π 2 i )2 an a ivisor of otherwise. Since is o an oes ) not ivie we conclue that the orer of θ i in Qα/β) ) is a ivisor of. Put α 1 = θ/θ 2 θ k. 42) Then ) m θ m θ 1 = θ2 m θk m 1 θ 2 θ k an, by 27), 30), 33) an 42), or α/β) n 1) or α m 1 θ m 2 θ m k 1). 43) Observe that α 1, θ 2,..., θ k are multilicatively ineenent since α/β is not a root of unity, 2,..., k are rimes which o not ivie αβ an the rincial rime ieals [π i ] for i = 2,..., k o not ramify since 2. Further since 2,..., k are ifferent from an oes not ivie αβ we see that α 1, θ 2,..., θ k are -aic units. Notice that Kα 1/2 0, θ 1/2, θ 1/2 2,..., θ 1/2 k ) = Kα 1/2 0, α 1/2 1, θ 1/2 2,..., θ 1/2 k ). Further [Kα 1/2 0, θ 1/2, θ 1/2 2,..., θ 1/2 k ) : K] = 2 k+1, 44) since otherwise, by 29) an Kummer theory, see Lemma 3 of [3], there is an integer i with 2 i k an integers j 0,..., j i 1 with 0 j b 1 for b = 0,..., i 1 an an element γ of K for which θ i = α j0 0 θj1 θ j2 2 θji 1 i 1 γ2. 45) But the orer of the rime ieal [π i ] on the left-han sie of 45) is 1 whereas the orer on the right-han sie of 45) is even which is a contraiction. Thus 44) hols. Since oes not ivie the iscriminant of K an [K : Q] = 2 either slits, in ) which case f = 1 an = 1, or is inert, in which case f = 2 an ) see [20]. Observe that if = 1 then ) = 1, f /δ. ) 46) Let us now etermine α 0, θ, θ 2,..., θ k in the case = 1. By our earlier remarks the orer of θ i is a ivisor of + 1 for i = 2,..., k. Further by 27) since Nα/β) = 1 we fin that Nθ) = ±1 an so Nθ 2 ) = 1. By Hilbert s Theorem 90, see eg. Theorem of [9], θ 2 = ϱ/ϱ where ϱ an ϱ are conjugate algebraic integers in Qα/β). Note that we may suose that the rincial ieals [ϱ] an [ϱ ] have no rincial ieal ivisors in common. Further since oes not ivie αβ an, since ) = 1, [] is a rincial rime ieal of O K an we note that oes not ivie ϱϱ. It follows from Lemma 2.2 that the orer of θ 2 in Qα/β) ) is a ivisor of + 1 hence θ has orer a ivisor of 2 + 1). Since α 4 0 = 1 we conclue that α 0, θ, θ 2,..., θ k 2 + 1)

14 14 C.L. STEWART an so δ = 2 1)/ α 0, θ, θ 2,..., θ k 1)/2. 47) We now aly Lemma 3.1 noting, by 46) an 47), that f /δ 2 2 / 1). Thus, by 32), or α1 m θ2 m θk m 1) c 10 k + 1) 3 log 7e 1 ) k ) k k 2 k 2 log log m)hα 1 )hθ 2 ) hθ k ). Notice that θ i = π i /π i an that ix π i /π i )x π i /π i) = i x 2 πi 2 +π 2 i )x+ i is the minimal olynomial of θ i over the integers since [π i ] is unramifie. Either the iscriminant of Qα/β) is negative in which case π i = π i or it is ositive in which case there is a funamental unit ε > 1 in O K. We may relace π i by π i ε u for any integer u an so without loss of generality we may suose that 1/2 i π i 1/2 i ε an consequently that 1/2 i ε 1 π i 1/2 i. Therefore an Let us ut Then hθ i ) 1 2 log iε 2 = 1 2 log i + log ε for > 0 hθ i ) 1 2 log i for < 0. R = { log ε for > 0 0 for < 0. for i = 2,..., k. In a similar fashion we fin that an so 48) hθ i ) 1 2 log i + R 49) hθ 2 θ k ) 1 2 log 2 k + R, 50) hα 1 ) hθ) log 2 k + R. 51) Put t 1 = ω2αβ). Let q i enote the i-th rime number which is reresentable as the norm of an element of O K. Note that k q k+t1 an thus log log k k 1) log q k+t1. Therefore by Lemma 2.4 for k > c 11, an so, as for the roof of 38), Accoringly, since k k, for k > c 12 log log k k 1) log k 52) log 2 log k log k) k 1. 2 k 1 hθ 2 ) hθ k ) log 2 + 2R) log k + 2R) log k) k 1. 53)

15 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 15 Furthermore as for the roof of 39) an 40) we fin that from 51), an, from 12), 28) an 33), hα 1 ) c 13 hθ)k log k 54) hθ) log m 8 log α log n. 55) Thus by 43), 48), 51), 53), 54) an 55), ) 1 or α/β) n 1) < c 14 k 4 log 7e k log k ) k log α log n. 56) 2 log Therefore, by 31), for > c 15 we again obtain 41) an the result follows. 5. Proof of Theorem 1.1 Let c 1, c 2,... enote ositive numbers which are effectively comutable in terms of ωαβ) an the iscriminant of Qα/β). Let g be the greatest common ivisor of α + β) 2 an αβ. Note that ϕn) is even for n > 2 an that Φ n α, β) = g ϕn)/2 Φ n α 1, β 1 ) where α 1 = α/ g an β 1 = β/ g. Further α 1 + β 1 ) 2 an α 1 β 1 are corime an lainly P Φ n α, β)) P Φ n α 1, β 1 )). Therefore we may assume, without loss of generality, that α + β) 2 an αβ are corime non-zero integers. By Lemma 4.2 there exists c 1 such that if n excees c 1 then On the other han Φ n α, β) = log Φ n α, β) ϕn) 2 Φ nα,β) log α. 57) orφnα,β). 58) If ivies Φ n α, β) then, by 4), oes not ivie αβ an so or Φ n α, β) or α/β) n 1), 59) where is a rime ieal of O K lying above. By Lemma 2.1 if ivies Φ n α, β) an is not P n/3, n)) then is at least n 1 an thus for n > c 2, by Lemma 4.3, Put or α/β) n 1) < ex log /51.9 log log ) log α log n. 60) P n = P Φ n α, β)). Then, by 58) an Lemma 2.1, log Φ n α, β) log n + log or Φ n α, β). 61) P n n Comaring 57) an 61) an using 59) an 60) we fin that, for n > c 3, ϕn) log α < c 4 log ) ex log /51.9 log log ) log α log n P n n

16 16 C.L. STEWART hence ϕn) log n < πp n, n, 1) + πp n, n, 1))P n ex log P n /51.95 log log P n ), an, by Lemma 2.3, ϕn) c 5 log n < Pn 2 ϕn) logp n /n) ex log P n/51.95 log log P n ). Since ϕn) > c 6 n/ log log n, for n > c 7, as require. P n > n exlog n/104 log log n), Since oes not ivie ab 6. Proof of Theorem 1.2 or a n b n ) = or a/g) n b/g) n ) where g is the greatest common ivisor of a an b. Thus we may assume, without loss of generality, that a an b are corime. Put u n = a n b n for n = 1, 2, an let l = l) be the smallest ositive integer for which ivies u l. Certainly ivies u 1. Further, as in the roof of Lemma 3 of [38], if n an m are ositive integers then u n, u m ) = u n,m). Thus if ivies u n then ivies u n,l). By the minimality of l we see that n, l) = l so that l ivies n. In articular l ivies 1. Furthermore, by 4), we see that or u l = or Φ l a, b). If l ivies n then, by Lemma 2 of [38], an so u n /u l, u l ) ivies n/l, 62) or u 1 = or u l 63) Suose that ivies Φ n a, b). Then ivies u n an so l ivies n. Put n = tl k with t, ) = 1 an k a non-negative integer. Since Φ n a, b) ivies u n /u n/t for t > 1 we see from 62), since t, ) = 1, that t = 1. Thus n = l k. For any ositive integer m ) u m /u m = b m 1) + b m 2) u m + + u 1 m 2 an if is not 2 an ivies u m then or u m /u m ) = 1. It then follows that if is an o rime then or Φ l ka, b) = 1 for k = 1, 2,.

17 ON DIVISORS OF LUCAS AND LEHMER NUMBERS 17 If n is a ositive integer not ivisible by l = l) then u n = 1. On the other han if l ivies n an is o then u n = u l n/l. 64) It now follows from 63) an 64) an the fact that l 1 that if is an o rime an l ivies n then u n = u 1 n. 65) Therefore if is an o rime an n a ositive integer or a n b n ) or a 1 b 1 ) + or n, 66) an our result now follows from 66) on taking n = 1 in Lemma 8. References [1] ABRAMOWITZ,M. & STEGUN,I.A., Hanbook of Mathematical Functions with Formulas, Grahs an Mathematical Tables, Dover Publications, New York, [2] BAKER,A., A sharening of the bouns for linear forms in logarithms, Acta Arith ), [3] BAKER,A. & STARK,H., On a funamental inequality in number theory, Ann. Math ), [4] BANG,A.S., Taltheoretiske unersøgelser, Tisskrift for Mat ), 70 78, [5] BILU,Y., HANROT,G. & VOUTIER,P.M., Existence of rimitive ivisors of Lucas an Lehmer numbers, J. reine angew. Math ), [6] BIRKHOFF,G.D.& VANDIVER,H.S., On the integral ivisors of a n b n, Ann. Math ), [7] BUGEAUD,Y & LAURENT,M., Minoration effective e la istance -aique entre uissances e nombres algébriques, J. Number Theory 61, 1996) [8] CARMICHAEL,R.D., On the numerical factors of the arithmetic forms α n ± β n, Ann. Math ), [9] COHN,H., A classical invitation to algebraic numbers an class fiels, Sringer-Verlag, New York, [10], Introuction to the construction of class fiels, Cambrige stuies in avance mathematics 6, Cambrige University Press, Cambrige, [11] DICKSON,L.E., History of the theory of numbers, Vol. I, The Carnegie Institute of Washington, New York, [12] DOBROWOLSKI,E., On a question of Lehmer an the number of irreucible factors of a olynomial, Acta Arith ), [13] DURST,L.K., Excetional real Lehmer sequences, Pacific J. Math ), [14] ERDŐS,P., Some recent avances an current roblems in number theory, Lectures on moern mathematics, Vol. III e. T.L. Saaty), Wiley, New York, 1965, [15] ERDŐS,P. & SHOREY,T.N., On the greatest rime factor of 2 1 for a rime an other exressions, Acta Arith ), [16] FRÖHLICH,A. & TAYLOR,M.J., Algebraic number theory, Cambrige stuies in avance mathematics 27, Cambrige University Press, Cambrige, [17] GELFOND,A.O., Transcenental an algebraic numbers, Dover Publications, New York, [18] HALBERSTAM,H. & RICHERT,H.E., Sieve methos, Acaemic Press, Lonon, [19] HARDY,G.H. & WRIGHT,E.M., An introuction to the theory of numbers, Oxfor University Press, 5th e, Oxfor 1979). [20] HECKE,E., Lectures on the theory of algebraic numbers, Grauate Texts in Mathematics 77, Sringer-Verlag, New York, [21] JURICEVIC,R., Lehmer numbers with at least 2 rimitive ivisors, Ph.D. thesis, University of Waterloo, [22] LEHMER,D.H., An extene theory of Lucas functions, Ann. Math ),

18 18 C.L. STEWART [23] LAGARIAS,J.C. & ODLYZKO,A.M., Effective versions of the Chebotarev Density Theorem, in Algebraic Number Fiels L-functions an Galois roerties), eite by A. Fröhlich, Acaemic Press, Lonon, 1977, [24] LUCAS,E., Sur les raorts qui existent entre la théorie es nombres et le calcul intégral, C.R. Aca. Sci. Paris ), [25], Théorie es fonctions numériques simlement érioiques, Amer. J. Math ), , [26] MATIJASEVIC,Y., Enumerable sets are iohantine Russian), Dokl. Aka. Nauk SSSR ), Imrove English translation: Soviet Math. Doklay ), [27] MURATA,L. & POMERANCE,C., On the largest rime factor of a Mersenne number, CRM Proc. Lecture Notes 36, H. Kisilevsky an E.Z. Goren, eitors, Amer. Math. Soc., Provience, R.I., 2004, [28] MURTY,R. & WONG,S., The ABC conjecture an rime ivisors of the Lucas an Lehmer sequences, Number Theory for the Millennium III, eite by M.A. Bennett, B.C. Bernt, N. Boston, H.G. Diamon, A.J. Hilebran an W. Phili, A.K. Peters, Natick, MA, 2002, [29] ROTKIEWICZ,A., On Lucas numbers with two intrinsic rime ivisors, Bull. Aca. Polon. Sci. Sér. Math. Astr. Phys ), [30] SCHINZEL,A., On rimitive rime factors of a n b n, Proc. Cambrige Philos. Soc ), [31], The intrinsic ivisors of Lehmer numbers in the case of negative iscriminant, Ark. Mat ), [32], On rimitive rime factors of Lehmer numbers, I, Acta Arith ), [33], On rimitive rime factors of Lehmer numbers, II, Acta Arith ), [34], On rimitive rime factors of Lehmer numbers, III, Acta Arith ), [35], Primitive ivisors of the exression A n B n in algebraic number fiels, J. reine angew. Math. 268/ ), [36] SHOREY,T.N. & STEWART,C.L., On ivisors of Fermat, Fibonacci, Lucas an Lehmer numbers, II, J. Lonon Math. Soc ), [37] STEWART,C.L., The greatest rime factor of a n b n, Acta Arith ), [38], On ivisors of Fermat, Fibonacci, Lucas an Lehmer numbers, Proc. Lonon Math. Soc ), [39], Primitive ivisors of Lucas an Lehmer numbers, Transcenence theory: avances an alications es. A. Baker an D.W. Masser), Acaemic Press, Lonon, 1977, [40], On ivisors of Fermat, Fibonacci, Lucas an Lehmer numbers, III, J. Lonon Math. Soc ), [41] STEWART,C.L. & YU,K., On the abc conjecture, II, Duke Math. J ), [42] VOUTIER,P.M., Primitive ivisors of Lucas an Lehmer sequences, II, J. Th. Nombres Boreaux ), [43], Primitive ivisors of Lucas an Lehmer sequences, III, Math. Proc. Camb. Phil. Soc ), [44], An effective lower boun for the height of algebraic numbers, Acta Arith ), [45] WARD,M., The intrinsic ivisors of Lehmer numbers, Ann. Math ), [46] YAMADA,Y., A note on the aer by Bugeau an Laurent Minoration effective e la istance -aique entre uissances e nombres algébriques, J. Number Theory 130, 2010) [47] YU,K., P aic logarithmic forms an grou varieties III, Forum Math ), [48], P-aic logarithmic forms an a roblem of Erős, to aear. [49] ZSIGMONDY,K., Zur Theorie er Potenzreste, Monatsh. Math ), C.L. Stewart, Deartment of Pure Mathematics, University of Waterloo, Waterloo, Ontario, Canaa, cstewart@uwaterloo.ca

Factoring Dickson polynomials over finite fields

Factoring Dickson polynomials over finite fields Factoring Dickson polynomials over finite fiels Manjul Bhargava Department of Mathematics, Princeton University. Princeton NJ 08544 manjul@math.princeton.eu Michael Zieve Department of Mathematics, University

More information

On the largest prime factor of the Mersenne numbers

On the largest prime factor of the Mersenne numbers On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801, USA ford@math.uiuc.edu Florian Luca Instituto

More information

SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions

SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q TREVOR ARNOLD Abstract This aer demonstrates a few characteristics of finite extensions of small degree over the rational numbers Q It comrises attemts

More information

On the largest prime factor of x 2 1

On the largest prime factor of x 2 1 On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical

More information

Pythagorean Triples Over Gaussian Integers

Pythagorean Triples Over Gaussian Integers International Journal of Algebra, Vol. 6, 01, no., 55-64 Pythagorean Triples Over Gaussian Integers Cheranoot Somboonkulavui 1 Department of Mathematics, Faculty of Science Chulalongkorn University Bangkok

More information

As we have seen, there is a close connection between Legendre symbols of the form

As we have seen, there is a close connection between Legendre symbols of the form Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In

More information

Number Theory Naoki Sato <ensato@hotmail.com>

Number Theory Naoki Sato <ensato@hotmail.com> Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an

More information

Cyclotomic Extensions

Cyclotomic Extensions Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate

More information

A Generalization of Sauer s Lemma to Classes of Large-Margin Functions

A Generalization of Sauer s Lemma to Classes of Large-Margin Functions A Generalization of Sauer s Lemma to Classes of Large-Margin Functions Joel Ratsaby University College Lonon Gower Street, Lonon WC1E 6BT, Unite Kingom J.Ratsaby@cs.ucl.ac.uk, WWW home page: http://www.cs.ucl.ac.uk/staff/j.ratsaby/

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

More information

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number

More information

TRANSCENDENTAL NUMBERS

TRANSCENDENTAL NUMBERS TRANSCENDENTAL NUMBERS JEREMY BOOHER. Introduction The Greeks tried unsuccessfully to square the circle with a comass and straightedge. In the 9th century, Lindemann showed that this is imossible by demonstrating

More information

Factoring of Prime Ideals in Galois Extensions

Factoring of Prime Ideals in Galois Extensions Chater 8 Factoring of Prime Ideals in Galois Extensions 8.1 Decomosition and Inertia Grous We return to the general AKLB setu: A is a Dedekind domain with fraction field K, L is a finite searable extension

More information

Sieves in Number Theory

Sieves in Number Theory Sieves in Number Theory Lecture Notes Taught Course Centre 007 Tim Browning, Roger Heath-Brown Tyeset by Sanro Bettin All errors are the resonsibility of the tyesetter. In articular there are some arguments

More information

Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston

Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields Tom Weston Contents Introduction 4 Chater 1. Comlex lattices and infinite sums of Legendre symbols 5 1. Comlex lattices 5

More information

Powers of Two in Generalized Fibonacci Sequences

Powers of Two in Generalized Fibonacci Sequences Revista Colombiana de Matemáticas Volumen 462012)1, páginas 67-79 Powers of Two in Generalized Fibonacci Sequences Potencias de dos en sucesiones generalizadas de Fibonacci Jhon J. Bravo 1,a,B, Florian

More information

An Approach to Optimizations Links Utilization in MPLS Networks

An Approach to Optimizations Links Utilization in MPLS Networks An Aroach to Otimizations Utilization in MPLS Networks M.K Huerta X. Hesselbach R.Fabregat Deartment of Telematics Engineering. Technical University of Catalonia. Jori Girona -. Camus Nor, Eif C, UPC.

More information

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.

More information

Stochastic Derivation of an Integral Equation for Probability Generating Functions

Stochastic Derivation of an Integral Equation for Probability Generating Functions Journal of Informatics and Mathematical Sciences Volume 5 (2013), Number 3,. 157 163 RGN Publications htt://www.rgnublications.com Stochastic Derivation of an Integral Equation for Probability Generating

More information

Complex Conjugation and Polynomial Factorization

Complex Conjugation and Polynomial Factorization Comlex Conjugation and Polynomial Factorization Dave L. Renfro Summer 2004 Central Michigan University I. The Remainder Theorem Let P (x) be a olynomial with comlex coe cients 1 and r be a comlex number.

More information

More Properties of Limits: Order of Operations

More Properties of Limits: Order of Operations math 30 day 5: calculating its 6 More Proerties of Limits: Order of Oerations THEOREM 45 (Order of Oerations, Continued) Assume that!a f () L and that m and n are ositive integers Then 5 (Power)!a [ f

More information

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree

More information

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks 6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In

More information

Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime numbers and prime polynomials. Paul Pollack Dartmouth College Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)

More information

Continued Fractions. Darren C. Collins

Continued Fractions. Darren C. Collins Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

More information

Algebraic and Transcendental Numbers

Algebraic and Transcendental Numbers Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms

More information

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

More information

Introduction to NP-Completeness Written and copyright c by Jie Wang 1

Introduction to NP-Completeness Written and copyright c by Jie Wang 1 91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of

More information

FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES

FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES AVNER ASH, LAURA BELTIS, ROBERT GROSS, AND WARREN SINNOTT Abstract. We consider statistical roerties of the sequence of ordered airs obtained by taking

More information

Lecture 21 and 22: The Prime Number Theorem

Lecture 21 and 22: The Prime Number Theorem Lecture and : The Prime Number Theorem (New lecture, not in Tet) The location of rime numbers is a central question in number theory. Around 88, Legendre offered eerimental evidence that the number π()

More information

Mannheim curves in the three-dimensional sphere

Mannheim curves in the three-dimensional sphere Mannheim curves in the three-imensional sphere anju Kahraman, Mehmet Öner Manisa Celal Bayar University, Faculty of Arts an Sciences, Mathematics Department, Muraiye Campus, 5, Muraiye, Manisa, urkey.

More information

Application of Improved SSL in Data Security Transmission of Mobile Database System

Application of Improved SSL in Data Security Transmission of Mobile Database System Alication of Imrove SSL in Data Security Transmission of Mobile Database System RUIFENG WANG, XIAOHUA ZHANG, DECHAO XU College of Automation & Electrical Engineering Lanzhou Jiaotong University Lanzhou,

More information

SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

More information

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

More information

Double Integrals in Polar Coordinates

Double Integrals in Polar Coordinates Double Integrals in Polar Coorinates Part : The Area Di erential in Polar Coorinates We can also aly the change of variable formula to the olar coorinate transformation x = r cos () ; y = r sin () However,

More information

arxiv:math/0412079v2 [math.nt] 2 Mar 2006

arxiv:math/0412079v2 [math.nt] 2 Mar 2006 arxiv:math/0412079v2 [math.nt] 2 Mar 2006 Primes Generated by Recurrence Sequences Graham Everest, Shaun Stevens, Duncan Tamsett, and Tom Ward 1st February 2008 1 MERSENNE NUMBERS AND PRIMITIVE PRIME DIVISORS.

More information

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

More information

Notes on tangents to parabolas

Notes on tangents to parabolas Notes on tangents to parabolas (These are notes for a talk I gave on 2007 March 30.) The point of this talk is not to publicize new results. The most recent material in it is the concept of Bézier curves,

More information

k, then n = p2α 1 1 pα k

k, then n = p2α 1 1 pα k Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

More information

Math 230.01, Fall 2012: HW 1 Solutions

Math 230.01, Fall 2012: HW 1 Solutions Math 3., Fall : HW Solutions Problem (p.9 #). Suppose a wor is picke at ranom from this sentence. Fin: a) the chance the wor has at least letters; SOLUTION: All wors are equally likely to be chosen. The

More information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

More information

The sum of digits of polynomial values in arithmetic progressions

The sum of digits of polynomial values in arithmetic progressions The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr

More information

7. Some irreducible polynomials

7. Some irreducible polynomials 7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

More information

Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

More information

11 Ideals. 11.1 Revisiting Z

11 Ideals. 11.1 Revisiting Z 11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

More information

Unit 3. Elasticity Learning objectives Questions for revision: 3.1. Price elasticity of demand

Unit 3. Elasticity Learning objectives Questions for revision: 3.1. Price elasticity of demand Unit 3. Elasticity Learning objectives To comrehen an aly the concets of elasticity, incluing calculating: rice elasticity of eman; cross-rice elasticity of eman; income elasticity of eman; rice elasticity

More information

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

More information

On continued fractions of the square root of prime numbers

On continued fractions of the square root of prime numbers On continued fractions of the square root of prime numbers Alexandra Ioana Gliga March 17, 2006 Nota Bene: Conjecture 5.2 of the numerical results at the end of this paper was not correctly derived from

More information

2r 1. Definition (Degree Measure). Let G be a r-graph of order n and average degree d. Let S V (G). The degree measure µ(s) of S is defined by,

2r 1. Definition (Degree Measure). Let G be a r-graph of order n and average degree d. Let S V (G). The degree measure µ(s) of S is defined by, Theorem Simple Containers Theorem) Let G be a simple, r-graph of average egree an of orer n Let 0 < δ < If is large enough, then there exists a collection of sets C PV G)) satisfying: i) for every inepenent

More information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 Solutions CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

The Online Freeze-tag Problem

The Online Freeze-tag Problem The Online Freeze-tag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE-3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,

More information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

A Class of Three-Weight Cyclic Codes

A Class of Three-Weight Cyclic Codes A Class of Three-Weight Cyclic Codes Zhengchun Zhou Cunsheng Ding Abstract arxiv:30.0569v [cs.it] 4 Feb 03 Cyclic codes are a subclass of linear codes have alications in consumer electronics, data storage

More information

The Magnus-Derek Game

The Magnus-Derek Game The Magnus-Derek Game Z. Nedev S. Muthukrishnan Abstract We introduce a new combinatorial game between two layers: Magnus and Derek. Initially, a token is laced at osition 0 on a round table with n ositions.

More information

Precalculus Prerequisites a.k.a. Chapter 0. August 16, 2013

Precalculus Prerequisites a.k.a. Chapter 0. August 16, 2013 Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, Ph.D. Lakeland Community College Jeff Zeager, Ph.D. Lorain County Community College August 6, 0 Table of Contents 0 Prerequisites 0. Basic Set

More information

The cyclotomic polynomials

The cyclotomic polynomials The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

A Modified Measure of Covert Network Performance

A Modified Measure of Covert Network Performance A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy

More information

5.1 Radical Notation and Rational Exponents

5.1 Radical Notation and Rational Exponents Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

More information

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational

More information

The Impact of Forecasting Methods on Bullwhip Effect in Supply Chain Management

The Impact of Forecasting Methods on Bullwhip Effect in Supply Chain Management The Imact of Forecasting Methos on Bullwhi Effect in Suly Chain Management HX Sun, YT Ren Deartment of Inustrial an Systems Engineering, National University of Singaore, Singaore Schoo of Mechanical an

More information

BV has the bounded approximation property

BV has the bounded approximation property The Journal of Geometric Analysis volume 15 (2005), number 1, pp. 1-7 [version, April 14, 2005] BV has the boune approximation property G. Alberti, M. Csörnyei, A. Pe lczyński, D. Preiss Abstract: We prove

More information

THE REGULAR OPEN CONTINUOUS IMAGES OF COMPLETE METRIC SPACES

THE REGULAR OPEN CONTINUOUS IMAGES OF COMPLETE METRIC SPACES PACIFIC JOURNAL OF MATHEMATICS Vol 23 No 3, 1967 THE REGULAR OPEN CONTINUOUS IMAGES OF COMPLETE METRIC SPACES HOWARD H WICKE This article characterizes the regular T o open continuous images of complete

More information

Our Primitive Roots. Chris Lyons

Our Primitive Roots. Chris Lyons Our Primitive Roots Chris Lyons Abstract When n is not divisible by 2 or 5, the decimal expansion of the number /n is an infinite repetition of some finite sequence of r digits. For instance, when n =

More information

Number Theory Naoki Sato <sato@artofproblemsolving.com>

Number Theory Naoki Sato <sato@artofproblemsolving.com> Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material

More information

SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID

SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID International Journal of Comuter Science & Information Technology (IJCSIT) Vol 6, No 4, August 014 SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

More information

The Notebook Series. The solution of cubic and quartic equations. R.S. Johnson. Professor of Applied Mathematics

The Notebook Series. The solution of cubic and quartic equations. R.S. Johnson. Professor of Applied Mathematics The Notebook Series The solution of cubic and quartic equations by R.S. Johnson Professor of Applied Mathematics School of Mathematics & Statistics University of Newcastle upon Tyne R.S.Johnson 006 CONTENTS

More information

LINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL

LINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL Chapter 6 LINEAR INEQUALITIES 6.1 Introduction Mathematics is the art of saying many things in many different ways. MAXWELL In earlier classes, we have studied equations in one variable and two variables

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS. II. EQUAL DEGREES

DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS. II. EQUAL DEGREES DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS. II. EQUAL DEGREES ANDREJ DUJELLA, CLEMENS FUCHS, AND GARY WALSH Abstract. In this paper we prove the best possible upper bounds for the number of elements in

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

Pythagorean Triples and Rational Points on the Unit Circle

Pythagorean Triples and Rational Points on the Unit Circle Pythagorean Triles and Rational Points on the Unit Circle Solutions Below are samle solutions to the roblems osed. You may find that your solutions are different in form and you may have found atterns

More information

Power analysis of static VAr compensators

Power analysis of static VAr compensators Available online at www.scienceirect.com Electrical Power an Energy ystems 0 (008) 7 8 www.elsevier.com/locate/ijees Power analysis of static VAr comensators F.. Quintela *, J.M.G. Arévalo,.. eono Escuela

More information

How To Prove The Dirichlet Unit Theorem

How To Prove The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

Inverse Trig Functions

Inverse Trig Functions Inverse Trig Functions c A Math Support Center Capsule February, 009 Introuction Just as trig functions arise in many applications, so o the inverse trig functions. What may be most surprising is that

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

A Simple Model of Pricing, Markups and Market. Power Under Demand Fluctuations

A Simple Model of Pricing, Markups and Market. Power Under Demand Fluctuations A Simle Model of Pricing, Markus and Market Power Under Demand Fluctuations Stanley S. Reynolds Deartment of Economics; University of Arizona; Tucson, AZ 85721 Bart J. Wilson Economic Science Laboratory;

More information

ODD PERFECT NUMBERS HAVE AT LEAST NINE DISTINCT PRIME FACTORS

ODD PERFECT NUMBERS HAVE AT LEAST NINE DISTINCT PRIME FACTORS ODD PERFECT NUMBERS HAVE AT LEAST NINE DISTINCT PRIME FACTORS PACE P. NIELSEN Abstract. An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 N then N must have at least

More information

Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks

Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks Tra Coverage: Allowing Coverage Holes of Boune Diameter in Wireless Sensor Networks Paul Balister Zizhan Zheng Santosh Kumar Prasun Sinha University of Memhis The Ohio State University {balistr,santosh.kumar}@memhis.eu

More information

Lecture L25-3D Rigid Body Kinematics

Lecture L25-3D Rigid Body Kinematics J. Peraire, S. Winall 16.07 Dynamics Fall 2008 Version 2.0 Lecture L25-3D Rigi Boy Kinematics In this lecture, we consier the motion of a 3D rigi boy. We shall see that in the general three-imensional

More information

Ideal Class Group and Units

Ideal Class Group and Units Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

More information

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

More information

Homework until Test #2

Homework until Test #2 MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

More information

On Multicast Capacity and Delay in Cognitive Radio Mobile Ad-hoc Networks

On Multicast Capacity and Delay in Cognitive Radio Mobile Ad-hoc Networks On Multicast Caacity and Delay in Cognitive Radio Mobile Ad-hoc Networks Jinbei Zhang, Yixuan Li, Zhuotao Liu, Fan Wu, Feng Yang, Xinbing Wang Det of Electronic Engineering Det of Comuter Science and Engineering

More information

THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS

THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS S. S. Wagstaff, Jr. 1 Department of Computer Science, Purdue University, West Lafayette, IN 47097, USA ssw@cerias.purdue.edu Received:, Revised:, Accepted:,

More information

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

More information

Assignment 9; Due Friday, March 17

Assignment 9; Due Friday, March 17 Assignment 9; Due Friday, March 17 24.4b: A icture of this set is shown below. Note that the set only contains oints on the lines; internal oints are missing. Below are choices for U and V. Notice that

More information

Maximum Likelihood Estimation

Maximum Likelihood Estimation Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for

More information

Erdos and the Twin Prime Conjecture: Elementary Approaches to Characterizing the Differences of Primes

Erdos and the Twin Prime Conjecture: Elementary Approaches to Characterizing the Differences of Primes Erdos and the Twin Prime Conjecture: Elementary Approaches to Characterizing the Differences of Primes Jerry Li June, 010 Contents 1 Introduction Proof of Formula 1 3.1 Proof..................................

More information

Exponential Functions: Differentiation and Integration. The Natural Exponential Function

Exponential Functions: Differentiation and Integration. The Natural Exponential Function 46_54.q //4 :59 PM Page 5 5 CHAPTER 5 Logarithmic, Eponential, an Other Transcenental Functions Section 5.4 f () = e f() = ln The inverse function of the natural logarithmic function is the natural eponential

More information

SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE

SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE CRISTINA FLAUT and DIANA SAVIN Communicated by the former editorial board In this paper, we study some properties of the matrix representations of the

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

On Adaboost and Optimal Betting Strategies

On Adaboost and Optimal Betting Strategies On Aaboost an Optimal Betting Strategies Pasquale Malacaria 1 an Fabrizio Smerali 1 1 School of Electronic Engineering an Computer Science, Queen Mary University of Lonon, Lonon, UK Abstract We explore

More information

Department of Mathematical Sciences, University of Copenhagen. Kandidat projekt i matematik. Jens Jakob Kjær. Golod Complexes

Department of Mathematical Sciences, University of Copenhagen. Kandidat projekt i matematik. Jens Jakob Kjær. Golod Complexes F A C U L T Y O F S C I E N C E U N I V E R S I T Y O F C O P E N H A G E N Department of Mathematical Sciences, University of Copenhagen Kaniat projekt i matematik Jens Jakob Kjær Golo Complexes Avisor:

More information