ON CERTAIN SUMS RELATED TO MULTIPLE DIVISIBILITY BY THE LARGEST PRIME FACTOR

Size: px
Start display at page:

Download "ON CERTAIN SUMS RELATED TO MULTIPLE DIVISIBILITY BY THE LARGEST PRIME FACTOR"

Transcription

1 Ann. Sci. Math. Québec , no. 2, ON CERTAIN SUMS RELATED TO MULTIPLE DIVISIBILITY BY THE LARGEST PRIME FACTOR WILLIAM D. BANKS, FLORIAN LUCA AND IGOR E. SHPARLINSKI RÉSUMÉ. Pour un nombre entier positif n, P n désigne le plus grand facteur premier de n. Nous montrons que pour deux nombres réels fixés ϑ, µ et un entier k 2, avec ϑ, 0] et µ < k, l estimation P n µ n ϑ = x +ϑ exp + o 2k µ log x log 2 x P n k n a lieu lorsque x, ou log 2 x = log log x. Avec ϑ = µ = 0 et k = 2, nous retrouvons le résultat connu à l effet que, lorsque x, le nombre d entiers positifs n x pour lesquels P n 2 n est x exp + o 2 log x log 2 x. Nous obtenons aussi des bornes supérieure et inférieure pour le nombre d entiers positifs n x pour lesquels P ϕn k ϕn, où ϕn est la fonction d Euler. ABSTRACT. For a positive integer n, let P n denote the largest prime factor of n. We show that for two fixed real numbers ϑ, µ and an integer k 2, with ϑ, 0] and µ < k, the estimate P n µ n ϑ = x +ϑ exp + o 2k µ log x log 2 x P n k n holds as x, where log 2 x = log log x. With ϑ = µ = 0 and k = 2, we recover the known result that, as x, the number of positive integers n x for which P n 2 n is x exp + o 2 log x log 2 x. We also obtain upper and lower bounds for the number of positive integers n x for which P ϕn k ϕn, where ϕn is the Euler function.. Introduction. For an integer n 2, let P n denote the largest prime factor of n, and put P =. In many situations, especially when counting integers subject to various arithmetical constraints, it can be important to understand the set of positive integers n for which P n is small relative to n, or the set of positive integers n for which P n 2 n. Such sets often contribute to the error term in a given estimate, hence it is useful to have tight bounds for the number of elements in these sets. For example, Reçu le 6 septembre 2004 et, sous forme définitive, le 3 février c Association mathématique du Québec

2 32 On certain sums related to multiple divisibility by the largest prime factor such sets of integers have played an important role in estimating exponential sums with the Euler function ϕn see [4, 5], in studying the average prime divisor of an integer see [3], or in evaluating various means and moments of the Smarandache function of n see [6, 9]. Positive integers with the first property that is, P n is small are called smooth, and the distribution of smooth numbers has been extensively studied. Although there is no special name for integers with the second property that is, P n 2 n, they have also been studied in the literature. For example, in [0] it has been shown that for a fixed real number r 0, the following estimate holds as x : P n 2 n P n r = x exp + o 2r + 2 log x log log x. The error term o in the above estimate can be taken to be of the form O r log log log x/ log log x. More general sums taken over integers n x with P n in a fixed arithmetic progression have been estimated in [8]. In Theorem below, we complement the result by showing that if ϑ, µ are fixed real numbers and k 2 is an integer such that ϑ, 0] and µ < k, then the following estimate holds as x : Sk, ϑ, µ, x = P n µ n ϑ P n k n = x +ϑ exp + o 2k µ log x log log x. Our method closely resembles that of [8]. In particular, taking ϑ = µ = 0 in 2, we obtain the estimate #N k x = x exp + o 2k log x log log x 3 for the cardinality of the set N k x = {n x : P n k n}. When k = 2, the bound 3 can be recovered from by taking r = 0, and it appears also in [6]. We also consider a similar question for values of the Euler function ϕn. In Theorem 2, we give upper and lower bounds for the cardinality of the sets F k x = {n x : P ϕn k ϕn}, k = 2, 3,... Finally, for an odd integer n, we define tn to be the multiplicative order of 2 modulo n, and we give upper bounds on the cardinality of the sets T k x = {n x : n odd, P tn k tn}, k = 2, 3,... 2

3 W. D. Banks, F. Luca and I. E. Shparlinski 33 Throughout the paper, x denotes a large positive real number. We use the Landau symbols O and o as well as the Vinogradov symbols, and with their usual meanings. The constants or convergence implied by these symbols depend only on our parameters ϑ, µ and k. For a positive integer l, we write log l x for the function defined inductively by log x = max{log x, } and log l x = log log l x for l 2, where log denotes the natural logarithm function. In the case l =, we omit the subscript to simplify the notation; however, it should be understood that all the values of all logarithms that appear are at least. 2. Preliminary results. For the results in this section, we refer the reader to Section III.5.4 in the book of Tenenbaum []. Let ρ : R 0 R denote the Dickman function. We recall that ρu = for 0 u, ρ is continuous at u = and differentiable for all u >, and ρ satisfies the difference-differential equation Thus, uρ u + ρu = 0 u >. ρu = u u u ρv dv u. For u > 0, u, let ξu denote the unique real nonzero root of the equation e ξ = + uξ. By convention, we also put ξ = 0. Lemma. The following estimate holds: ξu = logu log u + O log2 u log u u >. Lemma 2. For any fixed real number u 0 >, the following estimate holds: ρ u = ξuρu + O/u u u 0. Lemma 3. The following estimate holds: ρu = u +ou u. As usual, we say that a positive integer n is y-smooth if P n y. For all real numbers x y 2, we denote by Ψx, y the number of y-smooth integers n x: Ψx, y = #{n x : P n y}. Lemma 4. For any fixed ε > 0 and exp log 2 x 5/3+ε y x, we have when u = log x/log y. Ψx, y = xρu + O log u, log y

4 34 On certain sums related to multiple divisibility by the largest prime factor Lemma 5. For all x y 2, we have Ψx, y xe u/2. We also denote by Φx, y the number of integers n x for which ϕn is y-smooth: Φx, y = #{n x : P ϕn y}. By Theorem 3. of [2], the following bound holds. Lemma 6. For any fixed ε > 0 and we have when u = log x/log y. log 2 x +ε y x, Φx, y x exp + o u log 2 u Finally, let Θx, y be the number of integers n x for which tn is y-smooth: Θx, y = #{n x : P tn y}. By Theorem 5. of [2], the following bound holds. Lemma 7. For exp log x log 2 x y x we have when u = log x/log y. Θx, y x exp 2 + o u log 2 u 3. Main Results. It is easy to see that a positive integer n satisfies P n k n if and only if n = mp m k, where m = n/p n k ; therefore, the sum in 2 can be rewritten as Sk, ϑ, µ, x = P n µ n ϑ = P m µ+kϑ m ϑ. P n k n mp m k x Theorem. Let ϑ, 0] and µ < k be fixed. Then the following estimate holds as x : Sk, ϑ, µ, x = x +ϑ exp + o 2k µ log x log 2 x. Proof. Given real numbers x y 2, we put Sx, y = {n x : P n y}; thus, Ψx, y = #Sx, y. For any integer m such that mp m k x, setting p = P m we see that m = pn, where n x/p k and P n p; in other words,

5 W. D. Banks, F. Luca and I. E. Shparlinski 35 n Sx/p k, p. Conversely, for a prime p and an integer n Sx/p k, p, the number m = pn clearly satisfies mp m k x. We therefore have the basic identity: Sk, ϑ, µ, x = p µ+kϑ n ϑ. 4 mp m k xp m µ+kϑ m ϑ = p x n Sx/p k, p We begin by considering the contribution to 4 coming from small primes p. Let + ϑ y = exp 2 6k µ log x log 2 x. Then n ϑ p µ+kϑ p y p y p µ+kϑ n Sx/p k, p n Ψx/p k, p Ψx/p k p µ+kϑ, p t ϑ dt 5 p µ+kϑ Ψx/p k, p +ϑ p y p y n ϑ since ϑ, 0]. To estimate the last sum in 5, we define y = exp 3 log x/ log2 x and consider separately the contributions coming from primes p y and from primes p > y. For a real number z > 0, let If p y, the inequality u p log x log y u z = logx/zk log z = log x log z k. k 3 log x log 2 x k 2 log x log 2 x holds provided that x is large enough; hence, by Lemma 5, we have p y p µ+kϑ Ψx/p k, p +ϑ p y = x +ϑ exp x +ϑ p µ+kϑ p k exp + ϑ log x log 2 x + ϑ log x log 2 x p µ k x +ϑ exp + ϑ log x log 2 x p y 6 since µ k <. For primes p in the range y < p y, we remark that log u p log p log 2 x log p < log 2 x log y log 2 x2 log x = o;

6 36 On certain sums related to multiple divisibility by the largest prime factor hence, by Lemma 4: y <p y p µ+kϑ Ψx/p k, p +ϑ = y <p y x +ϑ x p µ+kϑ p k ρu p + O y <p y For each p y, we also have the lower bound where p µ k ρu p +ϑ. u p = log x log p k log x log y k = + ou, u = 4k µ log x /2 + ϑ 2. log 2 x log +ϑ up log p Using Lemma 3 and the fact that ρ is decreasing for large u, we deduce that ρu p +ϑ exp + o 4k µ log x log 2 x, which implies the bound p µ+kϑ Ψx/p k, p +ϑ x +ϑ exp +o 4k µ logx log 2 x. 7 y <p y Combining the estimates 6 and 7 and substituting into 5, it follows that n ϑ x +ϑ exp + o 4k µ log x log 2 x. p y p µ+kϑ n Sx/p k, p Therefore, we see that the contribution to 4 from small primes p y is negligible compared to the claimed bound on Sk, ϑ, µ, x. Next, we estimate the contribution to 4 coming from large primes p > y 2, where y 2 = exp 4k µ log x log 2 x. We have p>y 2 p µ+kϑ n Sx/p k, p n ϑ p µ+kϑ n ϑ p>y 2 /p k x/p k p µ+kϑ p>y 2 t ϑ dt p>y 2 p µ+kϑ x p k +ϑ = x +ϑ p>y 2 p µ k x +ϑ y 2 µ k+ = x +ϑ exp + o 4k µ log x log 2 x.

7 W. D. Banks, F. Luca and I. E. Shparlinski 37 Hence, the contribution to 4 from large primes p > y 2 is also negligible. Thus, to complete the proof of Theorem, it suffices to show that medium primes y < p y 2 make the appropriate contribution to 4; that is, we need to show that y <p y 2 p µ+kϑ n Sx/p k, p n ϑ = x +ϑ exp + o 2k µ log x log 2 x. 8 To do this, let us first fix a prime p y, y 2 ]. Using Lemma 4, we obtain the lower bound n ϑ x/p k ϑ Ψx/p k, p ρu p x+ϑ, 9 pk+kϑ where n Sx/p k, p u p = logx/pk log p = log x log p k as before. For the upper bound, we have by partial summation: n Sx/p k, p n ϑ = x/p k t ϑ d Ψt, p = t ϑ Ψt, p t=x/pk + ϑ t= ρu p p µ k x +ϑ + x/p k x/p k t ϑ Ψt, p dt t ϑ Ψt, p dt. To bound the last term, we split the integral at w = ρu p /+ϑ x/p k. For the lower range, we have w t ϑ Ψt, p dt w t ϑ dt w +ϑ = ρu p x+ϑ. 0 pk+kϑ For the upper range, writing u t,p = log t/log p, we have by Lemma 4: x/p k w x/p k log t ϑ Ψt, p dt = ρu t,p t ϑ ut,p + O dt w log p log2 x x/p k ρu w,p + O t ϑ dt ρu w,p xϑ+ log p w p k+kϑ. Since log x u p < log x log y 2 log y holds for y < p y 2, using Lemma 3 we derive that log ρu p log x log 2 x log p.

8 38 On certain sums related to multiple divisibility by the largest prime factor Thus, u w,p = log w log p = logx/pk + log ρu p log p ϑ log p u p + O, Using Lemma 3 again, it follows that ρu w,p = ρu p exp Ou p = ρu p exp log o x log2 x. Substituting this estimate into and combining this with 0, we obtain the upper bound n ϑ ρu p x+ϑ log p k+kϑ exp o x log2 x. n Sx/p k, p Taking into account the lower bound 9, we obtain that n Sx/p k, p n ϑ ρu p x+ϑ log p k+kϑ exp o x log2 x. 2 Now let δ = log x log 2 x /4. Put z 0 = y, and let z l = z 0 + δ l for each l. Let L denote the smallest positive integer for which z L > y 2. For each l =,..., L, let J l denote the half-open interval J l = z l, z l ]; clearly, Now let L l= p J l ρu p p µ k For every prime p J l, we have u p = log x log p k = y <p y 2 ρu p p µ k v l = u zl log x log z l + Oδ k = log x log z l k + O l L. δ log x log z l 2 L l= p J l ρu p p µ k. 3 δ = v l + O, log 2 x since log z l log y log x log 2 x. Thus, using Lemmas and 2, we obtain that ρu p = ρv l + O u p v l max ρ u t = ρv l + O δ max ρu t. t J l t J l Consequently, ρu p p µ k = ρv l p µ k + Oδ. 4 p J l p Jl Let πt denote, as usual, the number of prime numbers p t. As the asymptotic relation log t log x log 2 x = δ 2 holds uniformly for all t y, y 2 ], we have πt = t t log t + O log 2 = t + Oδ 2. 5 t log t

9 W. D. Banks, F. Luca and I. E. Shparlinski 39 In particular, Noting that p µ k z µ k l #J l = πz l + δ πz l = δz l log z l + Oδ. for every p J l, we obtain that p µ k #J l z µ k l p J l = δz µ k+ l + Oδ. 6 log z l Combining 6 with 4 using the resulting estimate in 3, we have therefore shown that where δ + Oδ 2 L Hl l= ρu p p µ k δ + Oδ 2 L Hl, 7 y <p y 2 Hl = ρv l z µ k+ l Now let z be chosen such that ρu z z µ k+ = log z log z l l L. l= max ρu z z µ k+ y z y 2 log z. By Lemma 3, we have for all z [y, y 2 ]: ρu z z µ k+ log x log z = exp log2 x + o 2 log z therefore, and M = ρu z z µ k+ log x log log z = + o 2 x 2k µ, = exp log z Let κ {,..., L} be chosen such that + k µ log z ; + o 2k µ log x log 2 x. Hκ = max l L Hl. We remark that for each l {,..., L} and every number z J l, we have as in our proof of 4. Thus, for z J l, ρu z = ρv l + Oδ ρv l ρu z z µ k+ log z ρu z l z µ k l. log z l

10 40 On certain sums related to multiple divisibility by the largest prime factor In particular, ρu zl z µ k+ L ρu y2 y µ k+ 2 = om, log z L log y 2 which shows that z J L. Therefore y < z y 2, which implies that δ + Oδ 2 Hκ ρu p p µ k δ + Oδ 2 L Hκ. y <p y 2 We also have that if z J l, then M = ρu z z µ k+ ρu zl z µ k+ l = Hl Hκ M. log z log z l We observe that 7 immediately implies that δ + Oδ 2 Hκ ρu p p µ k δ + Oδ 2 L Hκ, y <p y 2 and since L δ log x log 2 x log x log 2 x 3/4, it follows that y <p y 2 ρu p p µ k M +o, which together with 2 implies 8. This completes the proof. Theorem 2. The bounds #F k x x exp + o k log x log 3 x and #F k x x exp + o 2k + log x log 2 x hold as x. Proof. Let S denote the set of positive integers n x for which ϕn is y-smooth. Let S 2 be the set of positive integers n x such that P ϕn k ϕn and n S. For each n S 2, there exists a prime l > y such that l k ϕn. As in the proof of Theorem 5 of [7], one can show that there are at most xy k++o such positive integers n x, that is, #S 2 xy k++o. Taking y = exp k log x log 3 x, we see that Lemma 6 applies, and using the fact that #F k x #S + #S 2,

11 W. D. Banks, F. Luca and I. E. Shparlinski 4 we obtain the stated upper bound. For the lower bound, we remark that P ϕn k ϕn whenever n has the form n = mp ϕm k for some integer m. If m x/y k is positive and y-smooth, it follows that n = mp ϕm k mp m k x. Moreover, since P ϕm P m y, we see that for each n, there are at most y distinct representations of the form n = mp ϕm k. We now choose y = exp 2k + log x log 2 x. Taking into account that v = logx/yk log y = 2k + log x k, log 2 x using Lemmas 3 and 4 we derive that This completes the proof. #F k x Ψx/y k, yy = v +ov xy k = x exp + o 2k + log x log 2 x. Theorem 3. The bound k #T k x x exp + o log x log 2 3 x holds as x. Proof. Let S denote the set of positive integers n x for which tn is y-smooth. Let S 2 be the set of positive integers n x such that P tn k tn and n S. For each n S 2, there exists a prime l > y such that l k tn ϕn. As in the proof of Theorem 5 of [7], one can show that there are at most xy k++o such positive integers n x, that is, #S 2 xy k++o. Taking y = exp k log x log 3 x we see that Lemma 7 applies, and using the fact that #T k x #S + #S 2, we obtain the stated upper bound.

12 42 On certain sums related to multiple divisibility by the largest prime factor 4. Remarks. A close analysis of the arguments used in the proof of Theorem shows that if ε > 0 is fixed, then estimate of Theorem holds uniformly for all ϑ [ +ε, ε, µ < k ε and k = olog x/ log 2 x /3. Furthermore, using the Siegel-Walfisz theorem together with 5, one can easily see that the same asymptotic formula as 2 holds for Sk, ϑ, µ, a, b, x = P n µ n ϑ P n k n P n a mod b for all positive coprime integers a and b with b log x A, where A is an arbitrary constant. Moreover, since k is arbitrary in 2, it follows that if we replace the range of summation N k x by N k x\n k+ x = {n x : P n k n}, then the same asymptotic formula as 2 holds for this smaller sum. We do not give further details in this direction. One might consider a problem related to the estimation of N k x, namely that of estimating the number of positive integers n x such that p 2 j n for j =,..., k, where p >... > p k are the k largest prime factors of n. Certainly, a more careful study of #F k x perhaps in the style of our proof of Theorem should lead to stronger lower and upper bounds in Theorem 2. On the other hand, it is unlikely that one can establish unconditionally the precise rate of growth of the counting function #F k x due to the current lack of matching lower and upper bounds for Φx, y. It is reasonable to expect that the upper bound of Lemma 6 is tight; in fact, similar lower bounds for Φx, y may be derived from certain widely accepted conjectures about the distribution of smooth shifted primes see the discussion in Section 8 of [2]. Nevertheless, the strongest unconditional results on smooth shifted primes see [], for example are not nearly sufficient to establish a lower bound of the same order of magnitude as the upper bound of Lemma 6. There is no reason to doubt that #T k x = x +o ; however, at present we do not even see how to prove that #T k x x α for some fixed α > 0. Examining the integers n = 3 k one easily concludes that #T k x log x. This bound can be improved by considering powers of other small primes, but it still leaves open the question about the true order of #T k x. Finally, it would also be interesting to prove that the set Qx = {p x : p prime, P p 2 p } is infinite. This could be considered as an weak form of the conjecture that p = m 2 + holds infinitely often. Acknowledgements. Most of this work was done during a visit by the first two authors to Macquarie University; the hospitality and support of this institution are gratefully acknowledged. During the preparation of this paper, W. B. was supported in part by NSF grant DMS , F. L. was supported in part by grants SEP-CONACYT E and E, and I. S. was supported in part by ARC grant DP02459.

13 W. D. Banks, F. Luca and I. E. Shparlinski 43 Résumé substantiel en français. Pour chaque entier n 2, P n désigne le plus grand facteur premier de n. Dans plusiers situations, en particulier celles où l on compte le nombre d entiers sujet à divers contraintes arithmétiques, il est souvent important de comprendre l ensemble des entiers positifs n pour lesquels P n est petit par rapport à n, ou l ensemble des entiers positifs n pour lesquels P n 2 n. De tels ensembles souvent contribuent au terme d erreur dans une estimation. Ainsi, il est utile d avoir de très bonnes bornes sur le nombre d éléments dans ces ensembles. Par exemple, de tels ensembles d entiers jouent un rôle important dans l estimation des sommes exponentielles avec la fonction d Euler ϕn voir [4, 5], dans l étude du «diviseur premier moyen» d un entier voir [3], ou dans l évaluation de moyennes diverses et de moments de la fonction de Smarandache de n voir [6, 9]. Les entiers positifs ayant la première propriété à savoir, P n est petit sont dits lisses, et la distribution d entiers lisses a été considérablement étudiée. Malgré le fait qu aucun nom ne leur a été attribué, les entiers satisfaisant la seconde propriété à savoir, P n 2 n ont été aussi étudiés dans le corpus. Par exemple, dans [0] on a montré que pour un nombre réel fixé r 0, l estimation suivante a lieu lorsque x : P n 2 n P n r = x exp + o 2r + 2 log x log 2 x. Ici, log 2 x = log log x. Le terme d erreur o dans l estimation ci-dessus peut être pris sous la forme O r log 3 x/ log 2 x, où log 3 x = log log log x. Plus généralement, les sommes prises sur des entiers n x où P n est dans une progression arithmétique fixée ont été estimées dans [8]. Dans ce papier, nous complétons l estimation en établissant le résultat suivant : Théorème. Soient ϑ, 0] et µ < k deux nombres fixés. L estimation suivante a lieu : P n µ n ϑ = x +ϑ exp + o 2k µ log x log 2 x. 2 P n k n Notre méthode ressemble à celle dans [8]. En particulier, en prenant ϑ = µ = 0 dans 2, nous obtenons l estimation #N k x = x exp + o 2k log x log 2 x 3 pour le cardinal de l ensemble N k x = {n x : P n k n}. Lorsque k = 2, la borne 3 peut être récupérée de en prenant r = 0, et ceci apparait aussi dans [6]. Nous considérons également une question similaire pour les valeurs de la fonction d Euler ϕn, et nous donnons des bornes inférieures et supérieures pour le cardinal des ensembles F k x = {n x : P ϕn k ϕn}, k = 2, 3, 4,....

14 44 On certain sums related to multiple divisibility by the largest prime factor Notre résultat est le suivant : Théorème 2. Les bornes #F k x x exp + o k log x log 3 x et #F k x x exp + o 2k + log x log 2 x ont lieu lorsque x. Finalement, pour un entier impair n, nous définissons tn comme étant l ordre multiplicatif de 2 modulo n, et nous donnons des bornes supérieures sur le cardinal des ensembles T k x = {n x : n odd, P tn k tn}, k = 2, 3, 4,.... Notre résultat est le suivant : Théorème 3. La borne k #T k x x exp + o log x log 2 3 x a lieu lorsque x. REFERENCES. R. C. Baker and G. Harman, Shifted primes without large prime factors, Acta Arith , W. D. Banks, J. B. Friedlander, C. Pomerance and I. E. Shparlinski, Multiplicative structure of values of the Euler function,, High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, 29 47; Fields Inst. Commun., vol. 4, Amer. Math. Soc., Providence, RI, W. Banks, M. Garaev, F. Luca and I. Shparlinski, Uniform distribution of the fractional part of the average prime divisor, Forum Math. 7, W. D. Banks and I. E. Shparlinski, Congruences and exponential sums with the Euler function,, High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, 49 59; Fields Inst. Commun., vol. 4, Amer. Math. Soc., Providence, RI, W. Banks and I. E. Shparlinski, Congruences and rational exponential sums with the Euler function, Rocky Mountain J. Math , K. Ford, The normal behavior of the Smarandache function, Smarandache Notions J , J. B. Friedlander, C. Pomerance and I. E. Shparlinski, Period of the power generator and small values of Carmichael s function, Math. Comp , A. Ivić, On sums involving reciprocals of the largest prime factor of an integer, II, Acta Arith , A. Ivić, On a problem of Erdös involving the largest prime factor of n, Monatsh. Math , no.,

15 W. D. Banks, F. Luca and I. E. Shparlinski A. Ivić and C. Pomerance, Estimates for certain sums involving the largest prime factor of an integer, Topics in Analytic Number Theory, vol. I-II, pp Budapest, 98; Colloq. Math. Soc. János Bolyai, vol. 34, North-Holland, Amsterdam, G. Tenenbaum, Introduction to analytic and probabilistic number theory, Cambridge Studies in Advanced Mathematics, vol. 46, Cambridge University Press, Cambridge, 995. W. D. BANKS DEPARTMENT OF MATHEMATICS, UNIVERSITY OF MISSOURI COLUMBIA, MO 652 USA F. LUCA INSTITUTO DE MATEMÁTICAS UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO C.P , MORELIA MICHOACÁN, MÉXICO I. E. SHPARLINSKI DEPARTMENT OF COMPUTING, MACQUARIE UNIVERSITY SYDNEY, NSW 209, AUSTRALIA

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

Positive Integers n Such That σ(φ(n)) = σ(n)

Positive Integers n Such That σ(φ(n)) = σ(n) 2 3 47 6 23 Journal of Integer Sequences, Vol. (2008), Article 08..5 Positive Integers n Such That σ(φ(n)) = σ(n) Jean-Marie De Koninck Départment de Mathématiques Université Laval Québec, PQ GK 7P4 Canada

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

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

Counting Primes whose Sum of Digits is Prime

Counting Primes whose Sum of Digits is Prime 2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey

More information

The Brauer Manin obstruction for curves having split Jacobians

The Brauer Manin obstruction for curves having split Jacobians Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 The Brauer Manin obstruction for curves having split Jacobians par Samir SIKSEK Résumé. Soit X A un morphism (qui n est pas constant) d une

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 example of a computable

An example of a computable An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

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

On the number-theoretic functions ν(n) and Ω(n)

On the number-theoretic functions ν(n) and Ω(n) ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,

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

On multiples with the same digit sum

On multiples with the same digit sum On multiples with the same digit sum Florian Luca Pantelimon Stănică March 9, 2008 Abstract Let g > be an integer and s g (m) be the sum of digits in base g of the positive integer m. In this paper, we

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

List of publications 2014. A. Peer Reviewed Articles: 1. J.M. De Koninck, On a class of arithmetical functions, Duke Math.J., 39 (1972), 807-818.

List of publications 2014. A. Peer Reviewed Articles: 1. J.M. De Koninck, On a class of arithmetical functions, Duke Math.J., 39 (1972), 807-818. List of publications 2014 A. Peer Reviewed Articles: 1. J.M. De Koninck, On a class of arithmetical functions, Duke Math.J., 39 (1972), 807-818. 2. J.M. De Koninck, Sums of quotients of additive functions,

More information

Primality - Factorization

Primality - Factorization Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

More information

Finite speed of propagation in porous media. by mass transportation methods

Finite speed of propagation in porous media. by mass transportation methods Finite speed of propagation in porous media by mass transportation methods José Antonio Carrillo a, Maria Pia Gualdani b, Giuseppe Toscani c a Departament de Matemàtiques - ICREA, Universitat Autònoma

More information

Office of the Auditor General / Bureau du vérificateur général FOLLOW-UP TO THE 2010 AUDIT OF COMPRESSED WORK WEEK AGREEMENTS 2012 SUIVI DE LA

Office of the Auditor General / Bureau du vérificateur général FOLLOW-UP TO THE 2010 AUDIT OF COMPRESSED WORK WEEK AGREEMENTS 2012 SUIVI DE LA Office of the Auditor General / Bureau du vérificateur général FOLLOW-UP TO THE 2010 AUDIT OF COMPRESSED WORK WEEK AGREEMENTS 2012 SUIVI DE LA VÉRIFICATION DES ENTENTES DE SEMAINE DE TRAVAIL COMPRIMÉE

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

Les Cahiers du GERAD ISSN: 0711 2440

Les Cahiers du GERAD ISSN: 0711 2440 Les Cahiers du GERAD ISSN: 0711 2440 Filtering for Detecting Multiple Targets Trajectories on a One-Dimensional Torus Ivan Gentil Bruno Rémillard G 2003 09 February 2003 Les textes publiés dans la série

More information

CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Évariste Galois and Solvable Permutation Groups

Évariste Galois and Solvable Permutation Groups Évariste Galois and Solvable Permutation Groups David A. Cox Department of Mathematics Amherst College dac@math.amherst.edu Bilbao May 2012 Prologue Most mathematicians know about Galois: He introduced

More information

BILL C-665 PROJET DE LOI C-665 C-665 C-665 HOUSE OF COMMONS OF CANADA CHAMBRE DES COMMUNES DU CANADA

BILL C-665 PROJET DE LOI C-665 C-665 C-665 HOUSE OF COMMONS OF CANADA CHAMBRE DES COMMUNES DU CANADA C-665 C-665 Second Session, Forty-first Parliament, Deuxième session, quarante et unième législature, HOUSE OF COMMONS OF CANADA CHAMBRE DES COMMUNES DU CANADA BILL C-665 PROJET DE LOI C-665 An Act to

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

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

More information

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

More information

On the Sign of the Difference ir( x) li( x)

On the Sign of the Difference ir( x) li( x) mathematics of computation volume 48. number 177 january 1987. pages 323-328 On the Sign of the Difference ir( x) li( x) By Herman J. J. te Riele Dedicated to Daniel Shanks on the occasion of his 10 th

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

More information

Computing divisors and common multiples of quasi-linear ordinary differential equations

Computing divisors and common multiples of quasi-linear ordinary differential equations Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr

More information

About the inverse football pool problem for 9 games 1

About the inverse football pool problem for 9 games 1 Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

More information

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca

More information

On Generalized Fermat Numbers 3 2n +1

On Generalized Fermat Numbers 3 2n +1 Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic

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

Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

More information

Note concernant votre accord de souscription au service «Trusted Certificate Service» (TCS)

Note concernant votre accord de souscription au service «Trusted Certificate Service» (TCS) Note concernant votre accord de souscription au service «Trusted Certificate Service» (TCS) Veuillez vérifier les éléments suivants avant de nous soumettre votre accord : 1. Vous avez bien lu et paraphé

More information

AgroMarketDay. Research Application Summary pp: 371-375. Abstract

AgroMarketDay. Research Application Summary pp: 371-375. Abstract Fourth RUFORUM Biennial Regional Conference 21-25 July 2014, Maputo, Mozambique 371 Research Application Summary pp: 371-375 AgroMarketDay Katusiime, L. 1 & Omiat, I. 1 1 Kampala, Uganda Corresponding

More information

Factoring & Primality

Factoring & Primality Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

More information

Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

More information

Lecture 13: Factoring Integers

Lecture 13: Factoring Integers CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method

More information

LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO

LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.

More information

Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action

Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action Arkady Berenstein and Anatol N. Kirillov CRM-2510 September 1997 Department of Mathematics, Cornell University, Ithaca, NY 14853,

More information

Parallel Discrepancy-based Search

Parallel Discrepancy-based Search Parallel Discrepancy-based Search T. Moisan, J. Gaudreault, C.-G. Quimper Université Laval, FORAC research consortium February 21 th 2014 T. Moisan, J. Gaudreault, C.-G. Quimper Parallel Discrepancy-based

More information

Introduction. GEAL Bibliothèque Java pour écrire des algorithmes évolutionnaires. Objectifs. Simplicité Evolution et coévolution Parallélisme

Introduction. GEAL Bibliothèque Java pour écrire des algorithmes évolutionnaires. Objectifs. Simplicité Evolution et coévolution Parallélisme GEAL 1.2 Generic Evolutionary Algorithm Library http://dpt-info.u-strasbg.fr/~blansche/fr/geal.html 1 /38 Introduction GEAL Bibliothèque Java pour écrire des algorithmes évolutionnaires Objectifs Généricité

More information

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013 FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression

On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression Carrie E. Finch and N. Saradha Abstract We prove the irreducibility of ceratin polynomials

More information

Localisation des racines d un polynome et de ses dérivées, étude statistique. André Galligo. Seminaire Passe-Partout. Nice, Mars 2011.

Localisation des racines d un polynome et de ses dérivées, étude statistique. André Galligo. Seminaire Passe-Partout. Nice, Mars 2011. Localisation des racines d un polynome et de ses dérivées, étude statistique André Galligo Laboratoire J.-A. Dieudonné UMR CNRS 6621 Université de Nice - Sophia Antipolis, France et projet-commun Galaad

More information

Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic Fields and Power Bases Michael Decker 12/07/07 Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is

More information

3 Arithmetic functions

3 Arithmetic functions 3 Arithmetic functions 3.1 Some notational conventions Divisor sums and products: Let n N. f(d) denotes a sum of f(d), taken over all positive divisors d of n. f(p) denotes a sum of f(p), taken over all

More information

Méthodes ensemblistes pour une localisation robuste de robots sous-marins

Méthodes ensemblistes pour une localisation robuste de robots sous-marins Méthodes ensemblistes pour une localisation robuste de robots sous-marins Jan Sliwka To cite this version: Jan Sliwka. Méthodes ensemblistes pour une localisation robuste de robots sous-marins. Automatique

More information

Personnalisez votre intérieur avec les revêtements imprimés ALYOS design

Personnalisez votre intérieur avec les revêtements imprimés ALYOS design Plafond tendu à froid ALYOS technology ALYOS technology vous propose un ensemble de solutions techniques pour vos intérieurs. Spécialiste dans le domaine du plafond tendu, nous avons conçu et développé

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

On some Formulae for Ramanujan s tau Function

On some Formulae for Ramanujan s tau Function Revista Colombiana de Matemáticas Volumen 44(2010)2, páginas 103-112 On some Formulae for Ramanujan s tau Function Sobre algunas fórmulas para la función tau de Ramanujan Luis H. Gallardo University of

More information

Survey on Conference Services provided by the United Nations Office at Geneva

Survey on Conference Services provided by the United Nations Office at Geneva Survey on Conference Services provided by the United Nations Office at Geneva Trade and Development Board, fifty-eighth session Geneva, 12-23 September 2011 Contents Survey contents Evaluation criteria

More information

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes) NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

More information

Lectures 5-6: Taylor Series

Lectures 5-6: Taylor Series Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,

More information

APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

More information

Ramsey numbers for bipartite graphs with small bandwidth

Ramsey numbers for bipartite graphs with small bandwidth Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São

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

HEALTH CARE DIRECTIVES ACT

HEALTH CARE DIRECTIVES ACT A11 HEALTH CARE DIRECTIVES ACT Advances in medical research and treatments have, in many cases, enabled health care professionals to extend lives. Most of these advancements are welcomed, but some people

More information

arxiv:math/0601660v3 [math.nt] 25 Feb 2006

arxiv:math/0601660v3 [math.nt] 25 Feb 2006 NOTES Edited by William Adkins arxiv:math/666v3 [math.nt] 25 Feb 26 A Short Proof of the Simple Continued Fraction Expansion of e Henry Cohn. INTRODUCTION. In [3], Euler analyzed the Riccati equation to

More information

International Diversification and Exchange Rates Risk. Summary

International Diversification and Exchange Rates Risk. Summary International Diversification and Exchange Rates Risk Y. K. Ip School of Accounting and Finance, University College of Southern Queensland, Toowoomba, Queensland 4350, Australia Summary The benefits arisen

More information

arxiv:1112.0829v1 [math.pr] 5 Dec 2011

arxiv:1112.0829v1 [math.pr] 5 Dec 2011 How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

More information

Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences

Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences Brian Rice brice@hmc.edu July 19, 2006 Abstract The question of which terms of a recurrence sequence fail to have primitive prime

More information

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,

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

---------------------------------------------------------------------------------

--------------------------------------------------------------------------------- Hume Fogg Academic Magnet Summer Review for Students Entering AP French Language Student Name --------------------------------------------------------------------------------- Teacher: Jessica Sexton Email:

More information

Arithmetic algorithms for cryptology 5 October 2015, Paris. Sieves. Razvan Barbulescu CNRS and IMJ-PRG. R. Barbulescu Sieves 0 / 28

Arithmetic algorithms for cryptology 5 October 2015, Paris. Sieves. Razvan Barbulescu CNRS and IMJ-PRG. R. Barbulescu Sieves 0 / 28 Arithmetic algorithms for cryptology 5 October 2015, Paris Sieves Razvan Barbulescu CNRS and IMJ-PRG R. Barbulescu Sieves 0 / 28 Starting point Notations q prime g a generator of (F q ) X a (secret) integer

More information

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

Introduction to Finite Fields (cont.)

Introduction to Finite Fields (cont.) Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

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

The Prime-Generating Algorithm (PGA)

The Prime-Generating Algorithm (PGA) The Prime-Generating Algorithm (PGA) Jacques Bienvenu April 29, 2010 Abstract This article features a new type of algorithm whose goal is to give a better understanding of how prime numbers form themselves.

More information

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

More information

FACTORING. n = 2 25 + 1. fall in the arithmetic sequence

FACTORING. n = 2 25 + 1. fall in the arithmetic sequence FACTORING The claim that factorization is harder than primality testing (or primality certification) is not currently substantiated rigorously. As some sort of backward evidence that factoring is hard,

More information

2 Primality and Compositeness Tests

2 Primality and Compositeness Tests Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 33, 1635-1642 On Factoring R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 http://www.math.ucalgary.ca/

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

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

More information

Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

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

General Certificate of Education Advanced Level Examination June 2012

General Certificate of Education Advanced Level Examination June 2012 General Certificate of Education Advanced Level Examination June 2012 French Unit 4 Speaking Test Candidate s Material To be conducted by the teacher examiner between 7 March and 15 May 2012 (FRE4T) To

More information

10/14/08 ON NUMBERS EQUAL TO THE SUM OF TWO SQUARES IN MORE THAN ONE WAY

10/14/08 ON NUMBERS EQUAL TO THE SUM OF TWO SQUARES IN MORE THAN ONE WAY 1 10/14/08 ON NUMBERS EQUAL TO THE SUM OF TWO SQUARES IN MORE THAN ONE WAY Ming-Sun Li, Kathryn Robertson, Thomas J. Osler, Abdul Hassen, Christopher S. Simons and Marcus Wright Department of Mathematics

More information

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

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

Commutative Replicated Data Types for the Semantic Web. Pascal Molli Kickoff Kolflow Feb 2011

Commutative Replicated Data Types for the Semantic Web. Pascal Molli Kickoff Kolflow Feb 2011 Commutative Replicated Data Types for the Semantic Web Pascal Molli Kickoff Kolflow Feb 2011 What is CRDTs CRDTs stands for Commutative Replicated Data Types It is a class of replication algorithms that

More information

All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

More information

Understanding N(d 1 ) and N(d 2 ): Risk-Adjusted Probabilities in the Black-Scholes Model 1

Understanding N(d 1 ) and N(d 2 ): Risk-Adjusted Probabilities in the Black-Scholes Model 1 Understanding N(d 1 ) and N(d 2 ): Risk-Adjusted Probabilities in the Black-Scholes Model 1 Lars Tyge Nielsen INSEAD Boulevard de Constance 77305 Fontainebleau Cedex France E-mail: nielsen@freiba51 October

More information

MD. ALI KHAN. and THE MINISTER OF CITIZENSHIP AND IMMIGRATION REASONS FOR ORDER AND ORDER

MD. ALI KHAN. and THE MINISTER OF CITIZENSHIP AND IMMIGRATION REASONS FOR ORDER AND ORDER Federal Court Cour fédérale Date: 20101001 Docket: IMM-1196-10 Citation: 2010 FC 983 St. John s, Newfoundland and Labrador, October 1, 2010 PRESENT: The Honourable Madam Justice Heneghan BETWEEN: MD. ALI

More information

Licence Informatique Année 2005-2006. Exceptions

Licence Informatique Année 2005-2006. Exceptions Université Paris 7 Java Licence Informatique Année 2005-2006 TD n 8 - Correction Exceptions Exercice 1 La méthode parseint est spécifiée ainsi : public static int parseint(string s) throws NumberFormatException

More information

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

More information

AP FRENCH LANGUAGE 2008 SCORING GUIDELINES

AP FRENCH LANGUAGE 2008 SCORING GUIDELINES AP FRENCH LANGUAGE 2008 SCORING GUIDELINES Part A (Essay): Question 31 9 Demonstrates STRONG CONTROL Excellence Ease of expression marked by a good sense of idiomatic French. Clarity of organization. Accuracy

More information

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

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

STUDENT APPLICATION FORM (Dossier d Inscription) ACADEMIC YEAR 2010-2011 (Année Scolaire 2010-2011)

STUDENT APPLICATION FORM (Dossier d Inscription) ACADEMIC YEAR 2010-2011 (Année Scolaire 2010-2011) Institut d Administration des Entreprises SOCRATES/ERASMUS APPLICATION DEADLINE : 20th November 2010 OTHER (Autre) STUDENT APPLICATION FORM (Dossier d Inscription) ACADEMIC YEAR 2010-2011 (Année Scolaire

More information

Modifier le texte d'un élément d'un feuillet, en le spécifiant par son numéro d'index:

Modifier le texte d'un élément d'un feuillet, en le spécifiant par son numéro d'index: Bezier Curve Une courbe de "Bézier" (fondé sur "drawing object"). select polygon 1 of page 1 of layout "Feuillet 1" of document 1 set class of selection to Bezier curve select Bezier curve 1 of page 1

More information

Arrangements of Stars on the American Flag

Arrangements of Stars on the American Flag Arrangements of Stars on the American Flag Dimitris Koukoulopoulos and Johann Thiel Abstract. In this article, we examine the existence of nice arrangements of stars on the American flag. We show that

More information

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein) Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

More information

FACULTY OF MANAGEMENT MBA PROGRAM

FACULTY OF MANAGEMENT MBA PROGRAM FACULTY OF MANAGEMENT MBA PROGRAM APPLICATION PROCEDURES: Completed files are evaluated on a rolling basis. Although the MBA Admissions office notifies all applicants of any outstanding documents electronically,

More information

9 More on differentiation

9 More on differentiation Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......

More information