BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO
|
|
- Miranda Rose
- 5 years ago
- Views:
Transcription
1 BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what roortion of integers h one now knows that there are infinitely many rime airs, + h as a consequence of the Zhang-Maynard-Tao theorem. We consider the natural generalization of this to k-tules of integers, and we determine the limit of what can be deduced assuming only the Zhang-Maynard-Tao theorem.. Introduction and statement of results The twin rime conjecture states that there are infinitely many airs of integers n, n + 2 which are simultaneously rimes. More generally, Hardy and Littlewood conjectured that each entry of the k-tule n + h,, n + h k should be rime infinitely often, unless there is a trivial reason why this cannot haen. This trivial reason is about divisibility by small rimes. For examle, the trilet n + 2, n + 4, n + 6 can never all be rime if n > because at least one of them must be a multile of 3. So we call a k-tule admissible if, for each rime, the reductions of the numbers h,..., h k modulo do not cover all of Z/Z. With this definition in hand, the Hardy-Littlewood conjecture states that if h,..., h k is an admissible k-tule, then there are infinitely many integers n for which the numbers n + h,..., n + h k are all rime. Even though we are still far from roving the full Hardy-Littlewood conjecture, there has been remarkable rogress made towards it recently. Firstly, in May 203, Yitang Zhang [8] made headlines by roving that there are bounded gas between rimes, and secifically that lim inf n n+ n < 70,000,000, where n denotes the n-th rime. Then, in November 203, James Maynard [3] and Terence Tao indeendently showed, using somewhat different techniques, that 70,000,000 can be relaced by 600, and, as it stands right now, the best bound known is 246, due to the Polymath roject [6]. Even more imressively, they roved that for any integer m there is aninteger k = k m such that if h,..., h k is an admissible k-tule, then there are infinitely many integers n for which at least m of the numbers n+h,..., n+h k are rime. Obviously, k m m, and in [6] it was shown that one can take k 2 = 50 and k m e 3.82m. We call a k-tule of integers h,..., h k a Dickson k-tule if there are infinitely many integers n for which n + h,..., n + h k are each rime. The Hardy-Littlewood conjecture is equivalent to the statement that all admissible k-tules of integers are Dickson k-tules, and the Maynard-Tao theorem imlies that every admissible k m -tule of integers contains Date: October 29, 204. The first and third authors are suorted by Discovery Grants from the Natural Sciences and Engineering Research Council of Canada. The second and fourth authors were suorted by NSF Mathematical Sciences Postdoctoral Research Fellowshis.
2 2 A. GRANVILLE, D. M. KANE, D. KOUKOULOPOULOS, AND R. J. LEMKE OLIVER a Dickson m-tule. In articular, the Maynard-Tao theorem imlies that Dickson m- tules exist, yet no exlicit examle of a Dickson m-tule is known! Nevertheless, a simle counting argument which also aeared in [2] yields the following attractive consequence of the Maynard-Tao theorem. Corollary.. A ositive roortion of m-tules of integers are Dickson m-tules. Proof. Let k = k m, so that m k, and define R = k and x = NR for some very large integer N. We let N = {n x, x] : n, R = }, so that N = 2xφR/R. Any subset of k elements of N is admissible, since it does not contain any integer 0 mod for any rime k. There are N k such k-tules. Each contains a Dickson m-tule by the Maynard-Tao theorem. Now suose that there are T x Dickson m-tules within N. Any such m-tule is a subset of exactly N m k m of the k-subsets of N, and hence N m N T x, k m k and therefore as desired. T x N m / N m k m N /k m = m φr 2x m, kr The main goal of this aer is to rovide better lower bounds on the roortion of m- tules that are Dickson m-tules. If m is the roortion of such m-tules, then Corollary. imlies that m > 0. We are interested in determining the best ossible lower bound on m assuming only the results of Zhang, Maynard, and Tao and treating them as black boxes : If D m is the set of Dickson m-tules, then there is an integer k = k m for which: D m is translation-invariant, that is to say, if h,..., h m D m and t Z, then h + t,..., h m + t D m ; D m is ermutation-invariant, that is to say, if h,..., h m D m and σ S m, then h σ,..., h σm D m ; for any admissible k-tule, x,..., x k, there exist distinct h,..., h m {x,..., x k } such that h,..., h m D m. We call any set A Z m that has the above roerties m, k-lausible. Then we define { } A [ N, N] m. δm, k = min lim inf : A Z m, A is m, k lausible ; N 2N m and, for any k m, we have that m δm, k by the Zhang-Maynard-Tao theorem. Our main result is the following. Theorem.2. For k m, we have, uniformly δm, k = log 2mOm k m log log 3k m.
3 BEST POSSIBLE DENSITIES 3 In the Maynard-Tao Theorem we know that one can obtain k m e cm for some constant c > 0. The best value known for c is a little smaller than 3.82, and Tao [7, 2] showed that the Maynard-Tao technique cannot be directly used to obtain a constant smaller than 2. So we deduce that m δm, k m e c+om2 e 4m2, and that this can, at most, be imroved to e 2m2 using the currently available methods. A de Polignac number is an integer h for which there are infinitely many airs of rimes and + h the twin rime conjecture is the secial case h = 2. A ositive roortion of integers are de Polignac numbers, as follows from both results above, but we wish to determine the best exlicit lower bounds ossible. In Section 2, using quite elementary arguments, we will show that.2 2 δ2, k > , 50 and that this cannot be imroved dramatically without imroving the value of k 2 = 50. We remark that this bound is surrisingly good in light of the fact that we can only deduce that there is some h 246 for which there are infinitely many rime airs, + h. Finally, we note that it would erhas be more natural to consider the roortion ad m of admissible m-tules that are Dickson m-tules, rather than the roortion of all m- tules. To this end, in Section 4, we determine the roortion ρ ad m of all m-tules that are admissible. Surrisingly, this question has seemingly not been addressed in the literature, and we rove that.3 ρ ad m = as m. e om e γ log m m 2. The density of de Polignac numbers To rove a lower bound on the density of de Polignac numbers, we consider admissible sets B of integers that do not contain a Dickson air. If the rime k-tulets conjecture is true, then necessarily B =, while Zhang s theorem imlies that B k 2. Because of this uer bound, there must be maximal such sets, in that, for any t B such that B {t} is admissible, B {t} contains a Dickson air. This condition imlies that t B contains a de Polignac number, and we will obtain a lower bound on δ2, k 2 by varying t. To this end, for an admissible set B, define ηb to be the minimal lower density of sets A with the roerty that t B contains an element of A whenever B {t} is admissible. Moreover, for any integer l, set ηl to be the infimum of ηb as B runs over admissible sets of size l. We thus have that 2 δ2, k 2 min ηl, l k 2 and we will rove the following. Proosition 2.. For any integer l, we have that ηl e γ /l log l, and exlicitly that ηl l l y l+ for any ositive integer y l. y
4 4 A. GRANVILLE, D. M. KANE, D. KOUKOULOPOULOS, AND R. J. LEMKE OLIVER For the articular alication to 2, we take l {,..., 49} in Proosition 2. to find that δ2, k 2 min ηl > > l , while taking y = 3 yields that η49 < <, so that, using our techniques, 87 we can hoe for an imrovement in our lower bound for δ2, k 2 by a factor of at most about two. However, we can do better: the exlicit uer bound given in Lemma 3. below shows that δ2, 50 < Proof of Proosition 2.. We begin with the lower bound for ηl. Suose that B is admissible of size l, so that for each rime l + there exists a residue class n mod such that n + b for each b B. If t n mod for all l + then B {t} is admissible and so contains a Dickson air, and, as remarked above, t must be one of that air, else B would have contained a Dickson air. If x is large then the number of such integers t x is l+ and we know that, for some b B, t b is a de Polignac number. Given t Z, an integer can be written in at most l ways as t b for b B, since B = l. Hence, ηb e γ l l log l l+ as l. We now turn to the uer bound. We will construct sets A and B with the roerties that B is admissible and that if t is such that B {t} is admissible, then there exists b = b t B such that t b t A. Let y {,..., l } and set v = l y. Moreover, define r = y and m = l, and select h large so that q := hv + is a rime > l. We define A to be the set of all integers a for which a +, r = and a 0,, 2,..., or h mod q. The density δa of A is h q y l y x y Our set B will be constructed as the union of two sets, B and B 2. For B, we take B := {b 0, b,..., b v } where each b i is chosen to satisfy b i ih mod q and b i mod m, and we choose B 2 to be a set of y integers covering the residue classes 2,..., mod for each rime y. We note that B := B B 2 has l elements and is admissible: it occuies the congruence classes,..., mod for all y and covers at most y classes modulo for > y. If t is such that B {t} is admissible, then t 0 mod for all rimes y. We can write t ih + j mod q for some i and j satisfying 0 i v and 0 j h. Consider t b i. This is j mod q and mod for all rimes y. Hence t b i A, so that ηl δa, and the result follows. Remark. Pintz [5] showed that there is an ineffective constant C such that every interval of length C contains a de Polignac number. The roof of the lower bound above furnishes a different roof of this result: the values of t that aear are eriodic modulo r := k 2, so, given a maximal set B, we obtain Pintz s result with C = r + max b B b min b B b..
5 BEST POSSIBLE DENSITIES 5 3. Proof of Theorem.2 We begin with a strong version of the uer bound of Theorem.2. Lemma 3.. If k m 2 with k/m, then e γ + o δm, k k log log k. Proof. Pick q as large as ossible so that m φq < k. We claim that A = {x,..., x m : x x 2... x m mod q} is m, k-lausible. This is because any admissible set with k elements may take at most φq distinct values modulo q, so by the igeonhole rincile, at least m of these values must be congruent modulo q, giving an m-tule contained in A. On the other hand, q is of size e γ + o k log log k as k/m, and A has density /q. This comletes the roof. The roof of the lower bound is somewhat more involved. A key ingredient is the Lovász Local Lemma: Lovász Local Lemma. Suose that E,..., E n are events, each of which occurs with robability and deends on no more than d of the others. If d /4 then the robability that no E j occurs is at least e 2n. The inut for the Lovász Local Lemma will come from the following technical result. Lemma 3.2. Let k m. Consider a translation and ermutation invariant set A 2x, 2x] Z m, and set N = {n x, x] Z : n, k = }. If A N m N m and x is large enough in terms of m and k, then A > 8m, log 3mOm k log log k xm. m m Before we rove Lemma 3.2, we use it to deduce the lower bound in Theorem.2. Proof of the lower bound in Theorem.2. Fix a large ositive x and suose that A [ 2x, 2x] m is an m, k-lausible set, yet A log 2m cm x m/ k m log log k m for some c > 0. If c is large enough, then Lemma 3.2 imlies that 3. A N m N m 8m, where N := {n x, x] Z : n, k = }. Now select integers n,..., n k uniformly at random from N. We claim that there is a ositive robability that the n i are distinct and that there is no m-element subset of {n,..., n k } in A, which imlies that A is not m, k-lausible. We use the Lovász Local Lemma, in which we wish to avoid the events n i = n j for i < j k and x,..., x m A for any choice of m elements x,..., x m among the integers n,..., n k. There are k 2 + k m such events. Each event deends on no more than m of the n i, and so deends on no more than m + m 2m
6 6 A. GRANVILLE, D. M. KANE, D. KOUKOULOPOULOS, AND R. J. LEMKE OLIVER other events. If x,..., x m are m out of the k random variables, then the robability that x,..., x m A is /8m by 3.. We finally note that the robability that ni = n j is / N R/2xφR as x, which is certainly /8m for x sufficiently large. The Lovász Local Lemma now imlies that there exists a subset n,..., n k of distinct elements of N for which x,..., x m A for all subsets {x,..., x m } of {n,..., n k }. In fact, the Lovász Local Lemma imlies that this is true for a roortion e k/2m2 of the k-subsets of N. Hence, A is not an m, k-lausible set, a contradiction. To rove Lemma 3.2, we first need another result. Given an m-tule h = h,..., h m, we denote by n h the number of congruence classes mod covered by h,..., h m. Note that n h min{, m} and that both uer and lower bounds are easily obtained for some m-tule h. Lemma 3.3. Let k m. There is an absolute constant c > 0 such that if h is a randomly selected m-tule from N = {n x, x] Z : n, k = } and x is large enough in terms of m and k, then the robability that n h m > log 3m cm log log k is k 6m. Proof. The result is trivial if k m 2, so we will assume that k > m 2. Similarly, we may assume that k is large enough. Moreover, note that there are k N = o x N m m-tules h,..., h m with non-distinct elements. So it suffices to show that if we randomly select a subset B = {b,..., b m } of distinct elements of N, then the robability that is k n B m > log 3m cm log log k 7m. By Mertens Theorem, the contribution of the small rimes is m 2 n B m 2 < k m m 2 for some absolute constant c > 0. If c 2c and we set fb = n B m, then we are left to show that P fb > log 3m cm/2 log log k m log 3m c m 7m.
7 Taking logarithms, we have log fb m n m 2 + O 2 m 2 < k m m 2 < k BEST POSSIBLE DENSITIES 7 X B + O log m m 2 < k, m n + O log m where X B = if n B < m, and X B = 0 if n B = m. Therefore, if we set XB = m 2 < k X B/ and we assume that c is large enough, then it suffices to show that P XB > c 3 log log3m + log log log k 7m. In turn, the above inequality is a consequence of the weaker estimate 3.2 P XB > log logmax{m 2, m log k} + c 7m, where c is a sufficiently large constant. The X can be viewed as indeendent random variables as we run over all ossible sets B. As in the birthday aradox, the robability that X = 0 is 2... m = ex m2 + Om 2 m 2 = + O For any r, if r, then we trivially have that E[e rx / ] e r/, and otherwise E[e rx/ ] = PX = 0 + PX = e r/ = + PX = e r/ m 2 r ex O. Therefore, for any values of s and r, we have that e rs P X s E[e rx ] = k E[e rx / ] r e r/ r ex r log log r + Or + Om 2 / log r. 2 e Om2 r/ 2 Thus, if r m 2, then setting s = log log r + c for c sufficiently large, we find that P X log log r + c e r. Substituting r = max{m 2, m log k} establishes 3.2 for k large enough, thus comleting the roof of the lemma. Proof of Lemma 3.2. We artition the elements of [ 2x, 2x] m into translation classes, utting two elements in the same class if and only if they differ by l, l,..., l for some integer l. Each translation class T intersecting [ x, x] m contains at least 2x elements of [ 2x, 2x] m and at most 6x. The main idea of the roof is that if we can find at least U elements of A N m whose translation class has at most M elements inside N m, then A 2x U/M. Note that n h is fixed over all h T, so we denote it by n T. The number of integers l for which h + l, l,..., l N m is 3x k n T for x large enough. If we set.
8 8 A. GRANVILLE, D. M. KANE, D. KOUKOULOPOULOS, AND R. J. LEMKE OLIVER R = k, then Lemma 3.3 imlies that the roortion of elements of N m for which n m B φr 3.3 log 3m cm log log k R k is / 6m, rovided that x is large enough, with c begin an absolute constant. Since A contains at least N m / 8m elements in N m by assumtion, we find that A contains at least N m / 6m for which 3.3 holds. Therefore, we conclude that A N /{ m m } φr 24m log 3m cm log log k > xm log 3m Om R k log log k m m for x large enough, and the result follows. 4. The number of admissible k-tules Our goal in this section is to show relation.3. Given a rime, we say that an m-tule is admissible mod if its elements do not occuy all of the residue classes mod, so an m- tule is admissible if and only if it is admissible mod for every rime. By the igeonhole rincile, any set of m integers is admissible mod if > m, so to test for admissibility we need only work with the rimes m. This imlies, using the Chinese Remainder Theorem, that ρ ad m = m ρ ad m,, where ρ ad m, denotes the roortion of m-tules that are admissible mod. If m/ log m < m, then we note the trivial bounds / m ρ ad m,, with the lower bound coming from counting m-tules whose elements are not 0 mod. Therefore m/ log m< m ρ ad m, m/ log m< m m m log log m O = e log m. It remains to comute the contribution of rimes m/ log m. It is not difficult to determine an exact exression for ρ ad m, using an inclusion-exclusion argument: the robability that the elements of an m-tule h belong to a given subset of residue classes is m. There are choices of the residue classes. If the elements of h belong to exactly 2 residue classes mod then h was just counted twice and so we need to subtract the robability of this haening. That robability is 2 k, and there are 2 choices of the 2 residue classes. Continuing in the way, we find that ρ ad m, = j j m = j j+ j= m We note that ratio of two consecutive summands in absolute value is m j j m j + m = + j+ j j m m { } m 2 ex log 2 log m
9 for all m/ log m. Therefore, we deduce that ρ ad m, = which imlies that m log log m O ρ ad m = e log m BEST POSSIBLE DENSITIES 9 m/ log m m + O which roves a quantitative version of relation.3. m =, log m eo m log log m log m e γ log m m, 5. A better density in the continuous case Analogous to the discrete question considered here, one can also ask about the continuous version, i.e. the set of limit oints L of the set of values of n+ n / log n, where n is the nth rime. One can deduce from a uniform version of Zhang s Theorem that for any 0 β β 2... β k with k = k 2 there exists i < j k such that β j β i L. By a small modification of the argument used to rove Corollary., Banks, Freiberg and Maynard [] showed that L [0, T ] has Lebesgue measure T/. It is not difficult to see that this is more-or-less best ossible, given the result used, since the set L 0 := {t : t /k } contains a β j β i for all ossible choices of the β s. References [] W. D. Banks, T. Freiberg, J. Maynard, On limit oints of the sequence of normalized rime gas, rerint. [2] A. Granville, Primes in intervals of bounded length, Bull. Amer. Math. Soc., to aear [3] J. Maynard, Small gas between rimes, Annals of Mathematics, to aear. [4] J. Maynard, Dense clusters of rimes in subsets, rerint. [5] J. Pintz, Polignac Numbers, Conjectures of Erdős on Gas between Primes, Arithmetic Progressions in Primes, and the Bounded Ga Conjecture, rerint. [6] D.H.J. Polymath, Variants of the Selberg sieve, and bounded intervals containing many rimes, Research in the Mathematical Sciences, to aear. [7] T. Tao, Public communication, htt://terrytao.wordress.com/ [8] Y. Zhang, Bounded gas between rimes, Annals of Mathematics, 79 no. 3, AG: Déartement de mathématiques et de statistique, Université de Montréal, CP 628 succ. Centre-Ville, Montréal, QC H3C 3J7, Canada address: andrew@dms.umontreal.ca DMK: Deartment of Mathematics, University of California-San Diego, 9500 Gilman Drive #0404, La Jolla, CA 92093, USA address: dakane@math.ucsd.edu DK: Déartement de mathématiques et de statistique, Université de Montréal, CP 628 succ. Centre-Ville, Montréal, QC H3C 3J7, Canada address: koukoulo@dms.umontreal.ca RJLO: Deartment of Mathematics, Stanford University, Building 380, Stanford, CA 94305, USA address: rjlo@stanford.edu
MATH 250: THE DISTRIBUTION OF PRIMES. ζ(s) = n s,
MATH 50: THE DISTRIBUTION OF PRIMES ROBERT J. LEMKE OLIVER For s R, define the function ζs) by. Euler s work on rimes ζs) = which converges if s > and diverges if s. In fact, though we will not exloit
More informationON THE RESIDUE CLASSES OF (n) MODULO t
#A79 INTEGERS 3 (03) ON THE RESIDUE CLASSES OF (n) MODULO t Ping Ngai Chung Deartment of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts briancn@mit.edu Shiyu Li Det of Mathematics,
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More information#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS
#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More informationarxiv:math/ v2 [math.nt] 21 Oct 2004
SUMS OF THE FORM 1/x k 1 + +1/x k n MODULO A PRIME arxiv:math/0403360v2 [math.nt] 21 Oct 2004 Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu
More informationRepresenting Integers as the Sum of Two Squares in the Ring Z n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationAn Estimate For Heilbronn s Exponential Sum
An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined
More informationMarch 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011
International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,
More informationON FREIMAN S 2.4-THEOREM
ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained
More informationBOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia
GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More informationJARED DUKER LICHTMAN AND CARL POMERANCE
THE ERDŐS CONJECTURE FOR PRIMITIVE SETS JARED DUKER LICHTMAN AND CARL POMERANCE Abstract. A subset of the integers larger than is rimitive if no member divides another. Erdős roved in 935 that the sum
More informationON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES
C O L L O Q U I U M M A T H E M A T I C U M VOL. * 0* NO. * ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES BY YOUNESS LAMZOURI, M. TIP PHAOVIBUL and ALEXANDRU ZAHARESCU
More informationπ(x) π( x) = x<n x gcd(n,p)=1 The sum can be extended to all n x, except that now the number 1 is included in the sum, so π(x) π( x)+1 = n x
Math 05 notes, week 7 C. Pomerance Sieving An imortant tool in elementary/analytic number theory is sieving. Let s begin with something familiar: the sieve of Ertatosthenes. This is usually introduced
More informationAlmost All Palindromes Are Composite
Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,
More informationTHE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS
Annales Univ. Sci. Budaest., Sect. Com. 38 202) 57-70 THE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS J.-M. De Koninck Québec,
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationErnie Croot 1. Department of Mathematics, Georgia Institute of Technology, Atlanta, GA Abstract
SUMS OF THE FORM 1/x k 1 + + 1/x k n MODULO A PRIME Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu Abstract Using a sum-roduct result
More informationOn Erdős and Sárközy s sequences with Property P
Monatsh Math 017 18:565 575 DOI 10.1007/s00605-016-0995-9 On Erdős and Sárközy s sequences with Proerty P Christian Elsholtz 1 Stefan Planitzer 1 Received: 7 November 015 / Acceted: 7 October 016 / Published
More informationMATH 3240Q Introduction to Number Theory Homework 7
As long as algebra and geometry have been searated, their rogress have been slow and their uses limited; but when these two sciences have been united, they have lent each mutual forces, and have marched
More informationSOME SUMS OVER IRREDUCIBLE POLYNOMIALS
SOME SUMS OVER IRREDUCIBLE POLYNOMIALS DAVID E SPEYER Abstract We rove a number of conjectures due to Dinesh Thakur concerning sums of the form P hp ) where the sum is over monic irreducible olynomials
More informationx 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,
13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b
More informationIntrinsic Approximation on Cantor-like Sets, a Problem of Mahler
Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How
More informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
More informationAliquot sums of Fibonacci numbers
Aliquot sums of Fibonacci numbers Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de Méico C.P. 58089, Morelia, Michoacán, Méico fluca@matmor.unam.m Pantelimon Stănică Naval Postgraduate
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationBy Evan Chen OTIS, Internal Use
Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there
More informationTAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS
#A4 INTEGERS 8 (208) TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS Akhilesh P. IV Cross Road, CIT Camus,Taramani, Chennai, Tamil Nadu, India akhilesh.clt@gmail.com O. Ramaré 2 CNRS / Institut de Mathématiques
More informationNOTES. The Primes that Euclid Forgot
NOTES Eite by Sergei Tabachnikov The Primes that Eucli Forgot Paul Pollack an Enrique Treviño Abstract. Let q 2. Suosing that we have efine q j for all ale j ale k, let q k+ be a rime factor of + Q k j
More informationDiophantine Equations and Congruences
International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,
More informationCONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION
CONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer, we rove arithmetic roerties modulo 5 7 satisfied by the function odn which denotes the
More informationPrime-like sequences leading to the construction of normal numbers
Prime-like sequences leading to the construction of normal numbers Jean-Marie De Koninck 1 and Imre Kátai 2 Abstract Given an integer q 2, a q-normal number is an irrational number η such that any reassigned
More informationImprovement on the Decay of Crossing Numbers
Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November
More informationSolvability and Number of Roots of Bi-Quadratic Equations over p adic Fields
Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL
More informationWhen do Fibonacci invertible classes modulo M form a subgroup?
Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationElementary theory of L p spaces
CHAPTER 3 Elementary theory of L saces 3.1 Convexity. Jensen, Hölder, Minkowski inequality. We begin with two definitions. A set A R d is said to be convex if, for any x 0, x 1 2 A x = x 0 + (x 1 x 0 )
More informationPARTITIONS AND (2k + 1) CORES. 1. Introduction
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007
More information#A6 INTEGERS 15A (2015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I. Katalin Gyarmati 1.
#A6 INTEGERS 15A (015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I Katalin Gyarmati 1 Deartment of Algebra and Number Theory, Eötvös Loránd University and MTA-ELTE Geometric and Algebraic Combinatorics
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationInfinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally
Infinitely Many Quadratic Diohantine Equations Solvable Everywhere Locally, But Not Solvable Globally R.A. Mollin Abstract We resent an infinite class of integers 2c, which turn out to be Richaud-Degert
More informationSmall gaps between primes
CRM, Université de Montréal Princeton/IAS Number Theory Seminar March 2014 Introduction Question What is lim inf n (p n+1 p n )? In particular, is it finite? Introduction Question What is lim inf n (p
More informationMath 104B: Number Theory II (Winter 2012)
Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums
More informationNew bounds on gaps between primes
New bounds on gaps between primes Andrew V. Sutherland Massachusetts Institute of Technology Brandeis-Harvard-MIT-Northeastern Joint Colloquium October 17, 2013 joint work with Wouter Castryck, Etienne
More informationHaar type and Carleson Constants
ariv:0902.955v [math.fa] Feb 2009 Haar tye and Carleson Constants Stefan Geiss October 30, 208 Abstract Paul F.. Müller For a collection E of dyadic intervals, a Banach sace, and,2] we assume the uer l
More informationYOUNESS LAMZOURI H 2. The purpose of this note is to improve the error term in this asymptotic formula. H 2 (log log H) 3 ζ(3) H2 + O
ON THE AVERAGE OF THE NUMBER OF IMAGINARY QUADRATIC FIELDS WITH A GIVEN CLASS NUMBER YOUNESS LAMZOURI Abstract Let Fh be the number of imaginary quadratic fields with class number h In this note we imrove
More informationTHE 2D CASE OF THE BOURGAIN-DEMETER-GUTH ARGUMENT
THE 2D CASE OF THE BOURGAIN-DEMETER-GUTH ARGUMENT ZANE LI Let e(z) := e 2πiz and for g : [0, ] C and J [0, ], define the extension oerator E J g(x) := g(t)e(tx + t 2 x 2 ) dt. J For a ositive weight ν
More informationThe Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001
The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski
More informationPATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationON THE SET a x + b g x (mod p) 1 Introduction
PORTUGALIAE MATHEMATICA Vol 59 Fasc 00 Nova Série ON THE SET a x + b g x (mod ) Cristian Cobeli, Marian Vâjâitu and Alexandru Zaharescu Abstract: Given nonzero integers a, b we rove an asymtotic result
More informationarxiv: v4 [math.nt] 11 Oct 2017
POPULAR DIFFERENCES AND GENERALIZED SIDON SETS WENQIANG XU arxiv:1706.05969v4 [math.nt] 11 Oct 2017 Abstract. For a subset A [N], we define the reresentation function r A A(d := #{(a,a A A : d = a a }
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More informationHASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES
HASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES AHMAD EL-GUINDY AND KEN ONO Astract. Gauss s F x hyergeometric function gives eriods of ellitic curves in Legendre normal form. Certain truncations of this
More informationON SETS OF INTEGERS WHICH CONTAIN NO THREE TERMS IN GEOMETRIC PROGRESSION
ON SETS OF INTEGERS WHICH CONTAIN NO THREE TERMS IN GEOMETRIC PROGRESSION NATHAN MCNEW Abstract The roblem of looing for subsets of the natural numbers which contain no 3-term arithmetic rogressions has
More informationLinear mod one transformations and the distribution of fractional parts {ξ(p/q) n }
ACTA ARITHMETICA 114.4 (2004) Linear mod one transformations and the distribution of fractional arts {ξ(/q) n } by Yann Bugeaud (Strasbourg) 1. Introduction. It is well known (see e.g. [7, Chater 1, Corollary
More informationA FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE
International Journal of Mathematics & Alications Vol 4, No 1, (June 2011), 77-86 A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE ARPAN SAHA AND KARTHIK C S ABSTRACT: In this aer, we rove a few lemmas
More informationSieve theory and small gaps between primes: Introduction
Sieve theory and small gaps between primes: Introduction Andrew V. Sutherland MASSACHUSETTS INSTITUTE OF TECHNOLOGY (on behalf of D.H.J. Polymath) Explicit Methods in Number Theory MATHEMATISCHES FORSCHUNGSINSTITUT
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationOn the Square-free Numbers in Shifted Primes Zerui Tan The High School Attached to The Hunan Normal University November 29, 204 Abstract For a fixed o
On the Square-free Numbers in Shifted Primes Zerui Tan The High School Attached to The Hunan Normal University, China Advisor : Yongxing Cheng November 29, 204 Page - 504 On the Square-free Numbers in
More informationGaps in Semigroups. Université Pierre et Marie Curie, Paris 6, Equipe Combinatoire - Case 189, 4 Place Jussieu Paris Cedex 05, France.
Gas in Semigrous J.L. Ramírez Alfonsín Université Pierre et Marie Curie, Paris 6, Equie Combinatoire - Case 189, 4 Place Jussieu Paris 755 Cedex 05, France. Abstract In this aer we investigate the behaviour
More informationMATH 361: NUMBER THEORY EIGHTH LECTURE
MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first
More informationMAS 4203 Number Theory. M. Yotov
MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment
More informationMA3H1 TOPICS IN NUMBER THEORY PART III
MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced
More informationJonathan Sondow 209 West 97th Street, New York, New York
#A34 INTEGERS 11 (2011) REDUCING THE ERDŐS-MOSER EQUATION 1 n + 2 n + + k n = (k + 1) n MODULO k AND k 2 Jonathan Sondow 209 West 97th Street, New York, New York jsondow@alumni.rinceton.edu Kieren MacMillan
More informationLecture 7. January 15, Since this is an Effective Number Theory school, we should list some effective results. x < π(x) holds for all x 67.
Lecture 7 January 5, 208 Facts about primes Since this is an Effective Number Theory school, we should list some effective results. Proposition. (i) The inequality < π() holds for all 67. log 0.5 (ii)
More informationElementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem)
Elementary Proof That There are Infinitely Many Primes such that 1 is a Perfect Square (Landau's Fourth Problem) Stehen Marshall 7 March 2017 Abstract This aer resents a comlete and exhaustive roof of
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the
More informationIMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES
IMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES OHAD GILADI AND ASSAF NAOR Abstract. It is shown that if (, ) is a Banach sace with Rademacher tye 1 then for every n N there exists
More informationDIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction
DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS INNA ZAKHAREVICH. Introduction It is a well-known fact that there are infinitely many rimes. However, it is less clear how the rimes are distributed
More informationVerifying Two Conjectures on Generalized Elite Primes
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009), Article 09.4.7 Verifying Two Conjectures on Generalized Elite Primes Xiaoqin Li 1 Mathematics Deartment Anhui Normal University Wuhu 241000,
More informationCONGRUENCES SATISFIED BY APÉRY-LIKE NUMBERS
International Journal of Number Theory Vol 6, No 1 (2010 89 97 c World Scientific Publishing Comany DOI: 101142/S1793042110002879 CONGRUENCES SATISFIED BY APÉRY-LIKE NUMBERS HENG HUAT CHAN, SHAUN COOPER
More informationWeil s Conjecture on Tamagawa Numbers (Lecture 1)
Weil s Conjecture on Tamagawa Numbers (Lecture ) January 30, 204 Let R be a commutative ring and let V be an R-module. A quadratic form on V is a ma q : V R satisfying the following conditions: (a) The
More informationNumber Theory Naoki Sato
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 IMO
More informationPETER J. GRABNER AND ARNOLD KNOPFMACHER
ARITHMETIC AND METRIC PROPERTIES OF -ADIC ENGEL SERIES EXPANSIONS PETER J. GRABNER AND ARNOLD KNOPFMACHER Abstract. We derive a characterization of rational numbers in terms of their unique -adic Engel
More informationON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 000-9939XX)0000-0 ON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS WILLIAM D. BANKS AND ASMA HARCHARRAS
More informationUniversity of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10.
Booker, A. R., & Pomerance, C. (07). Squarefree smooth numbers and Euclidean rime generators. Proceedings of the American Mathematical Society, 45(), 5035-504. htts://doi.org/0.090/roc/3576 Peer reviewed
More informationExplicit Bounds for the Sum of Reciprocals of Pseudoprimes and Carmichael Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 20 207), Article 7.6.4 Exlicit Bounds for the Sum of Recirocals of Pseudorimes and Carmichael Numbers Jonathan Bayless and Paul Kinlaw Husson University College
More informationSQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015
SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015 1. Squarefree values of olynomials: History In this section we study the roblem of reresenting square-free integers by integer olynomials.
More informationTHE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4
THE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4 PAUL POLLACK Abstract For all rimes 5, there is a rime quadratic nonresidue q < with q 3 (mod 4 For all rimes 3, there is a rime
More informationThen we characterize primes and composite numbers via divisibility
International Journal of Advanced Mathematical Sciences, 2 (1) (2014) 1-7 c Science Publishing Cororation www.scienceubco.com/index.h/ijams doi: 10.14419/ijams.v2i1.1587 Research Paer Then we characterize
More informationA CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN
A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn
More informationGENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS
GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS PALLAVI DANI 1. Introduction Let Γ be a finitely generated grou and let S be a finite set of generators for Γ. This determines a word metric on
More informationQuadratic Reciprocity
Quadratic Recirocity 5-7-011 Quadratic recirocity relates solutions to x = (mod to solutions to x = (mod, where and are distinct odd rimes. The euations are oth solvale or oth unsolvale if either or has
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More informationOn the Toppling of a Sand Pile
Discrete Mathematics and Theoretical Comuter Science Proceedings AA (DM-CCG), 2001, 275 286 On the Toling of a Sand Pile Jean-Christohe Novelli 1 and Dominique Rossin 2 1 CNRS, LIFL, Bâtiment M3, Université
More informationDISCRIMINANTS IN TOWERS
DISCRIMINANTS IN TOWERS JOSEPH RABINOFF Let A be a Dedekind domain with fraction field F, let K/F be a finite searable extension field, and let B be the integral closure of A in K. In this note, we will
More informationA construction of bent functions from plateaued functions
A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for
More informationMULTIPLICATIVE FUNCTIONS DICTATED BY ARTIN SYMBOLS ROBERT J. LEMKE OLIVER
MULTIPLICATIVE FUNCTIONS DICTATED BY ARTIN SYMBOLS ROBERT J. LEMKE OLIVER Abstract. Granville and Soundararajan have recently suggested that a general study of multilicative functions could form the basis
More informationDedekind sums and continued fractions
ACTA ARITHMETICA LXIII.1 (1993 edekind sums and continued fractions by R. R. Hall (York and M. N. Huxley (Cardiff Let ϱ(t denote the row-of-teeth function ϱ(t = [t] t + 1/2. Let a b c... r be ositive integers.
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More information