HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 1. Introduction
|
|
- Mabel Rodgers
- 5 years ago
- Views:
Transcription
1 HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? PAUL POLLACK Abstract. Fix an integer k 2. We investigate the number of n x for which ϕn) is a perfect kth power. If we assume plausible conjectures on the distribution of smooth shifted primes, then the count of such n is at least x/lx) +o), as x, where Lx) = exp log log / log ). This lower bound is implicit in work of Banks Friedlander Pomerance Shparlinski. We prove unconditionally that x/lx) +o) serves as an upper bound. In fact, we establish this same bound for the count of n x for which ϕn) is squarefull. The proof builds on methods recently introduced by the author to study popular subsets for Euler s function.. Introduction Let ϕn) denote Euler s totient function, i.e., ϕn) = #Z/nZ). One of several problems studied in the paper [2] of Banks, Friedlander, Pomerance, and Shparlinski is the question of how often ϕn) assumes square values. The methods of [2] for obtaining lower bounds in this problem depend on the distribution of smooth shifted primes. Recall that a positive integer n is called Y -smooth alternatively, Y -friable) if there are no primes dividing n that exceed Y. We write ΨX, Y ) for the count of Y -smooth n X. It is natural to guess that shifted primes p are smooth with roughly the same frequency as ordinary integers of the same size. This thought, which in vague form goes back at least to Erdős s work in [4], led Pomerance to float the following precise conjecture in [0]. Conjecture. If X, Y with X Y, then #{p X : p is Y -smooth} ΨX, Y ) log X. Conjecture appears rather difficult, and may even be overly optimistic. But the authors of [2] show that even much weaker statements in this direction have interesting consequences for the distribution of square values of ϕn). Specifically, suppose that for a certain fixed U > and a certain real number K, we have that ) #{p X : p is X /U -smooth} ΨX, X/U ) log X) K for all large X. Then it is shown in [2] that there are at least x /U+o) values of n x for which ϕn) is a square, as x. Baker and Harman have proved that ) holds for any U Consequently, ϕn) is a square for at least x values of n x. Conjecture would predict that any U > is admissible in ), so that there are more than x ɛ values of n x with ϕn) a square. 200 Mathematics Subject Classification. N64 primary), N25, N37 secondary).
2 2 PAUL POLLACK Running these arguments with U allowed to vary, we can obtain a sharper lower bound than x ɛ. This is the substance of our first theorem, which also treats kth powers rather than merely squares. Writing log j for the jth iterate of the natural logarithm, let ) log3 x Lx) = exp. log 2 x Theorem conditional on Conjecture ). Fix an integer k 2. As x, the number of n x for which ϕn) is a kth power is at least x/lx) +o). It will emerge from the proof that the full strength of Conjecture is not needed; all we need is a lower bound of roughly the predicted size when Y exp log X).) While Theorem does not appear explicitly in [2], our argument below is a straightforward modification of the proof of Theorem 6.4 in [2]. We include the proof for completeness, and for comparison with our main result, which we now turn to. The discussion so far has focused on lower bounds. As regards upper bounds, it is proved in [2] that as x ) the number of n x for which ϕn) is squarefull does not exceed x exp + o)) log log ). Of course, this serves as an upper bound on the number of n x for which ϕn) is a kth power for any k 2). There is quite a gap between this upper bound and the lower bound of x/lx) +o) in Theorem. The main purpose of this note is to close this gap. Theorem 2. As x, the number of n x for which ϕn) is squarefull is at most x/lx) +o). The proof of Theorem 2 uses methods recently introduced by the author in [8] to study popular values of Euler s function cf. [0,, 2]). The cognate problem of counting squarefull m in the range of the Euler function rather than their preimages, as done here) was recently studied in [9]. It was shown there that x/) 3 #{squarefull m x 2 : m ϕn)} x/) In fact, the lower bound holds for the number of squares up to x 2 in the range of ϕ. For related results, see [3, 5, 6]. We note that the expression x/lx) +o) also arises in the study of counterexamples to the converse of Fermat s little theorem. Conjecturally, it describes the count of Carmichael numbers up to x, as well the count of base a pseudoprimes for each fixed a 0, ±. For Carmichael numbers, the upper bound implicit in the conjecture is known, while for base a pseudoprimes, an upper bound of x/lx) /2 for x > x 0 a)) has been shown. The heuristic lower bound arguments invoke a variant of Conjecture. For details, see []. Notation. The letter p is reserved throughout for primes. For Y > 0, we define arithmetic functions ω >Y ) and Ω >Y ) by ω >Y n) = p n p>y, and Ω >Y n) = p e n p>y e;
3 HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 3 when Y = 0, we omit the subscripts and write simply ω ) and Ω ). 2. Proof of Theorem The following result in combinatorial group theory follows from combining Theorem. and Proposition.2 of []. Lemma 3. Let G be a finite abelian group of exponent m, and let d = m + log G /m)). For each pair of integers r, t) with r > t > d, any sequence of r elements of G contains at least r t) / r d) distinct subsequences of length at most t and at least t d, whose product is the identity element. Proof of Theorem. Let X = explog 2 x) 2 ) and y = /log 2 x) 3. Let r denote the number of primes p X for which p is y-smooth. We will construct the values of n in Theorem as certain squarefree products of at most t of these r primes, where t := /log 2 x) 2. Note that all such products are at most x. For each of the r primes p described above, write p = l y lv lp ), where l runs over the primes at most y. We associate to p the mod k)-reduced exponent vector v l p ) mod k) l y Z/kZ) πy). Asking for the product n of t of these primes to have ϕn) a kth power amounts to asking that the sum of the corresponding exponent vectors be the zero element in G := Z/kZ) πy). This implies that the number of n as in Theorem is at least r ) t / r ) d, where d = dg) is the quantity of Lemma 3. Assuming Conjecture, we have for large x that r ΨX, y)/ log X. Now applying standard estimates for Ψ, ) for example, Theorem 2. of [2]), we find that, with U := log X log y, r Since G has exponent k, X exp + o))u log U) log X = X exp + o)) log 2 x log 3 x). d + k + logk πy) )) < y once x is large enough). Thus, r d) r d X y = Lx) o). On the other hand, ) r r ) t = r t t t r t Lx) o) X t /Lx) +o) = x/lx) +o). t t It follows that r t) / r d) x/lx) +o), as desired.
4 4 PAUL POLLACK Remark. The kth powers appearing above are all y-smooth. There are only Lx) o) y-smooth numbers n x see, e.g., Theorem 5.2 of [3]), so by the pigeonhole principle, some kth power m x satisfies #ϕ m) x/lx) +o). Compare with the first half of [2, Theorem 6.2].) Pomerance [0] has shown that max m x #ϕ m) x/lx) +o). We conclude that there are kth powers that are essentially as popular as possible as ϕ-values. 3. Preliminaries for the proof of Theorem 2 We quote several results from the author s recent work [8]. Given a real number z 2, we let W z ) denote the additive arithmetic function whose value at each prime power p e is given by W z p e ) = ω >z ϕp e )). Lemma 4 [8, Lemma 2]). Let Fix any η 0, ), and let As x, z = explog 2 x) /2 ). A = log 2 x) η. A Wzn) xlx) o). n x Lemma 5 [8, Lemma 3]). Let Y, Z. The number of positive integers n x with Ω >Y p ) ω >Y p )) Z p n is at most xlx) 2+o) Y Z/2, as x uniformly in Y, Z). Lemma 6 [8, Lemma 4]). Let Z. The number of n x with 2) ωn) log 3 x log 2 x) 2 satisfying is at most as x uniformly in Z). Ωp ) Z p n xlx) 2+o) 2 Z/2, Lemma 7 see [8, Lemma 5] and the remark following). The following statement holds for a certain constant C > 0: Let x 3, and let d be a positive integer. Then the number of positive integers n x for which d ϕn) is at most x d Clog 2 x) 2 ) Ωd) Ωd) Ωd). We also require the following exponential moment estimate, which will be used to bound the number of integers possessing many prime factors exceeding.
5 Lemma 8. Let y := uniformly for real T [, x]. HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 5. Then, as x, log 2 x) 2 y Ω >n) T x o), n T Proof. Let G be the multiplicative function determined by the convolution identity y Ω >n) = d n Gd). Then G vanishes at prime powers p a with p, while if p >, then Gp a ) = y a y a. Hence, y Ω >n) = T Gd) d n T d T T Gd) T + y ) + y2 y d p p 2 d T <p T If T, the product is empty and thus equal to ). So suppose that T >. For all p, T ], we have that assuming x is large enough) and so <p T y p + y2 y p 2 + = y p y < y p/2 < 2y p, + y ) + y2 y ) ) y +... exp + y2 y +... p p 2 p p 2 <p T ) 2y exp < exp 2y log p 2 T ) exp2 / log 2 x) = x o). <p T Collecting the estimates completes the proof. 4. Proof of Theorem 2 In this section, z has the same meaning as in Lemma 4: z = explog 2 x) /2 ). We let ɛ > 0 be arbitrary but fixed. We begin by excluding a set of inconvenient values of n, of cardinality Ox/Lx) 2ɛ ). This part of the argument closely parallels work in [8], but we repeat the details for the convenience of the reader. We start by assuming that ωn) satisfies the inequality 2). By a 97 theorem of Hardy Ramanujan [7], the number of n x with ωn) > log 3 x/log 2 x) 2 is x log 2 x + O))k x/lx) +o), k )! k> log 3 x/log 2 x) 2 as x, which is well within our target upper bound. Next, we assume that ϕn) > x/lx). Since ϕn) n/ log 2 n, the number of n x with ϕn) x/lx) is Ox log 2 x/lx)), which is acceptable.
6 6 PAUL POLLACK We further assume that W z n) ɛ) log 2 x. By Lemma 4, with η = ɛ, this excludes at most x/lx) ɛ)2 +o) values of x as x ). Again, this is acceptable. Next, we assume that 3) Ω z ϕn)) If this inequality fails, then 2 ɛ log 2 x < Ω >zϕn)) W z n) = p e nω >z ϕp e )) ω >z ϕp e ))) 2 ɛ ) log 2 x. = Ω >z p e ) ω >z p e )) + p e n p n Ω >z p ) ω >z p )) = e 2) + p e n p n e 2 p>z Ω >z p ) ω >z p )). Thus, one of the final two sums exceeds ɛ 4 log 2 x p e n e 2 p e p e n e 2 p>z z e > z 4 ɛ log 2 x = exp. If it is the first sum, then ) 4 ɛ. log 2 x) /2 The number of n x with a squarefull divisor of this size does not exceed x m x exp ) 8 ɛ. log 2 x) /2 ) m>exp 4 ɛ log 2 x) /2 m squarefull The sum on m has been estimated by partial summation, after recalling that the count of squarefull m T is OT /2 ), for all T.) In particular, the number of these n is smaller than x/lx) for large x. If the second of the two sums exceeds ɛ, then Lemma 5 with Y = z and Z = ɛ ) shows that n belongs to a set 4 log 2 x 4 log 2 x of size at most xlx) 2+o) Y Z/2 = xlx) 2+o) exp 8 ɛ log 2 x) /2 which is again smaller than x/lx) for large x. Finally, we assume that 4) Ωϕn)) log 2 x) 2/3. Supposing this inequality fails, we have that Ωp ) + Ωϕp e )) = Ωϕn)) > p n p e n, e 2e ) = p n ), log 2 x) 2/3.
7 HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 7 So one of the two sums on the far left exceeds. If it is the latter, then n 2 log 2 x) 2/3 is divisible by a squarefull number exceeding 2 2 /log 2 x)2/3. The number of such n x does not exceed x m x exp log 2 ) ; 4 log 2 x) 2/3 m>2 2 /log 2 x)2/3 m squarefull this is smaller than x/lx) for large x. If it is the former, we apply Lemma 6 to see that n is placed in a certain set of size at most xlx) 2+o) exp log 2 ), 4 log 2 x) 2/3 which is again smaller than x/lx) for large x. We will show that the number of n x for which ϕn) is squarefull, and for which all of the above assumptions are satisfied, is smaller than x 0 ɛ. As this is ox/lx)), we conclude that the total number of n x with ϕn) squarefull is Ox/Lx) 2ɛ ). Since ɛ may be taken arbitrarily small, the theorem follows. Every squarefull integer can be decomposed as a 2 b 3, with a, b positive integers. Hence, we may write where ϕn) = a 2 a 2 2a 2 3b 3 b 3 2b 3 3 p a b p z, p a 2 b 2 z < p, p a 3 b 3 < p. From the definition of z together with 4), ) a 2 b 3 z Ωa2 b3 ) z Ωϕn)) exp = x o). log 2 x) /6 Since ϕn) > x/lx), we deduce that 5) a 2 2a 2 3b 3 2b 3 3 > x Lx)a 2 b 3 = x +o). Put R = and δ = /R. Choose α 2, α 3, β 2, β 3 {/R, 2/R,..., R )/R, } such that, for i = 2, 3, a i [x α i δ, x α i ], while b i [x β i δ, x β i ]. Note that x /R, and so a i x α i, b i x β i. By 5), 6) 2α 2 + 2α 3 + 3β 2 + 3β 3 + o). Also, recalling 3), 7) 2Ωa 2 ) + 2Ωa 3 ) + 3Ωb 2 ) + 3Ωb 3 ) = Ω z ϕn)) 2 ɛ ) log 2 x.
8 8 PAUL POLLACK Switching perspective, we may view a, a 2, a 3, b, b 2, b 3 as given, and count the number of corresponding values of n x. By Lemma 7, #{n x : ϕn) = a 2 a 2 2a 2 3b 3 b 3 2b 3 3} #{n x : a 2 3b 3 3 ϕn)} x Clog a 2 3b 3 2 x) 2 ) Ωa2 3 b3 3 ) Ωa 2 3b 3 3) Ωa2 3 b3 3 ). 3 Keeping 7) in mind, and using that a i x α i, b i x β i, this upper bound is seen to be at most x 2α 3 3β 3 +o) ) Ωa2 3 b3 3 ) = x 2α 3 3β 3 +o) ) 2A 3+3B 3, where we define A i = Ωa i ) and B i = Ωb i ). Our strategy for the rest of the proof is as follows: We fix values for α 3, β 3, A 3, and B 3. This puts an additional constraint on the tuples a, a 2, a 3, b, b 2, b 3 ; namely, it amounts to specifying the order of magnitude and the number of prime factors of a 3 and b 3. In the next paragraph, we bound from above the number of tuples a, a 2, a 3, b, b 2, b 3 obeying this constraint. Each such tuple corresponds to at most x 2α 3 3β 3 +o) ) 2A 3+B 3 values of n. Thus, multiplying our bound on the number of these tuples by x 2α 3 3β 3 +o) ) 2A 3+B 3 yields a bound on the number of n corresponding to this particular choice of α 3, β 3, A 3, and B 3. As we will see, some additional effort is required to suss out the size of this bound.) Finally, we bound the total number of n by summing on α 3, β 3, A 3, and B 3. We emphasize that all o) terms appearing here and below are to be understood with x, and that the convergence of o) to 0 is uniform in all other parameters. Let y be as in Lemma 8, i.e., y =. The total number of )-smooth log 2 x) 2 integers in [, x] is x o) see again Theorem 5.2 of [3]), and so there are at most x o) possibilities for each of a, b, a 2, b 2. We have that a 3 x α 3 with α 3 fixed), that every prime factor of a 3 exceeds, and that Ωa 3 ) takes the fixed value A 3 ; thus, the number of possibilities for a 3 is at most y A 3 y Ω >m) y A 3 x α3+o). m x α 3 Similarly, the number of possibilities for b 3 is at most y B 3 x β 3+o). Thus, the number of n corresponding to a fixed choice of α 3, β 3, A 3, B 3 is at most 8) x 2α 3 3β 3 +o) ) 2A 3+3B3 x α 3+β 3 +o) y A 3 B 3. Assume that there is some tuple a, a 2, a 3, b, b 2, b 3 corresponding to our fixed choice of α 3, β 3, A 3, and B 3. If this fails, then there are no corresponding n.) Choose one and define, for i = 2, 3, α i = A i / log 2 x, and βi = B i / log 2 x. Since A 3, B 3 are fixed, the values of α 3 and β 3 do not depend on the choice of tuple a, a 2, a 3, b, b 2, b 3, but the values of α 2 and β 2 may.) By 7), 9) 2 α α β β 3 2 ɛ. For both i = 2, 3, we have that ) A i = x α i, ) B i = x β i, y A i = x α i+o), and y B i = x β i +o) as x ); making these substitutions above transforms our upper
9 bound 8) into HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 9 0) x α 3 α 3 ) 2β 3 β 3 )+o). How large is the exponent here? Subtracting 9) from 6), hence, 2α 2 α 2 ) + 2α 3 α 3 ) + 3β 2 β 2 ) + 3β 3 β 3 ) 2 ɛ + o); 2α 3 α 3 ) + 3β 3 β 3 ) 2 ɛ + 2 α 2 α 2 ) + 3 β 2 β 2 ) + o). Since every prime factor of a 2 b 2 is at most, we see that x α 2 δ a 2 ) A 2 = x α 2 ; thus, α 2 α 2 + o). Similarly, β 2 β 2 + o). Therefore, 2α 3 α 3 ) + 3β 3 β 3 ) 2 ɛ + o). Since each prime factor of a 3, b 3 exceeds, we find that α 3 α 3 and β 3 β 3 ; so both of the left-hand summands in the last display are nonnegative. Thus, either α 3 α 3 ɛ + o) or β 8 3 β 3 ɛ + o). Putting this back into 0), we find that 2 the number of n corresponding to a fixed choice of α 3, β 3, A 3, B 3 is at most x 8 ɛ+o). It remains to sum on α 3, β 3, A 3, B 3. There are crudely) only O) possibilities for each of these parameters. Hence, the total number of n satisfying our assumptions for which ϕn) squarefull is at most x 8 ɛ+o) ) 4, and so is smaller than x 0 ɛ for large x, as desired. Acknowledgements The author thanks Carl Pomerance and the anonymous referee for helpful comments. Work of the author is supported by NSF award DMS References. W. R. Alford, A. Granville, and C. Pomerance, There are infinitely many Carmichael numbers, Ann. of Math. 2) ), 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, Fields Inst. Commun., vol. 4, Amer. Math. Soc., Providence, RI, 2004, pp W. D. Banks and F. Luca, Power totients with almost primes, Integers 20), P. Erdős, On the normal number of prime factors of p and some related problems concerning Euler s ϕ-function, Quart. J. Math ), T. Freiberg, Products of shifted primes simultaneously taking perfect power values, J. Aust. Math. Soc ), T. Freiberg and C. Pomerance, A note on square totients, Int. J. Number Theory 205), G. H. Hardy and S. Ramanujan, The normal number of prime factors of a number n, Quart. J. Math ), P. Pollack, Popular subsets for Euler s ϕ-function, submitted. Preprint available from http: //pollack.uga.edu/research.html. 9. P. Pollack and C. Pomerance, Square values of Euler s function, Bull. Lond. Math. Soc ),
10 0 PAUL POLLACK 0. C. Pomerance, Popular values of Euler s function, Mathematika ), , On the distribution of pseudoprimes, Math. Comp ), , Two methods in elementary analytic number theory, Number theory and applications Banff, AB, 988), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 265, Kluwer Acad. Publ., Dordrecht, 989, pp G. Tenenbaum, Introduction to analytic and probabilistic number theory, third ed., Graduate Studies in Mathematics, vol. 63, American Mathematical Society, Providence, RI, 205. Department of Mathematics, University of Georgia, Athens, GA address: pollack@uga.edu
ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS
J. Aust. Math. Soc. 88 (2010), 313 321 doi:10.1017/s1446788710000169 ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS WILLIAM D. BANKS and CARL POMERANCE (Received 4 September 2009; accepted 4 January
More informationOn Carmichael numbers in arithmetic progressions
On Carmichael numbers in arithmetic progressions William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Carl Pomerance Department of Mathematics
More informationThe ranges of some familiar functions
The ranges of some familiar functions CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Let us
More informationA 1935 Erdős paper on prime numbers and Euler s function
A 1935 Erdős paper on prime numbers and Euler s function Carl Pomerance, Dartmouth College with Florian Luca, UNAM, Morelia 1 2 3 4 Hardy & Ramanujan, 1917: The normal number of prime divisors of n is
More informationThe ranges of some familiar arithmetic functions
The ranges of some familiar arithmetic functions Carl Pomerance Dartmouth College, emeritus University of Georgia, emeritus based on joint work with K. Ford, F. Luca, and P. Pollack and T. Freiburg, N.
More informationCarmichael numbers with a totient of the form a 2 + nb 2
Carmichael numbers with a totient of the form a 2 + nb 2 William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Abstract Let ϕ be the Euler function.
More informationEuler s ϕ function. Carl Pomerance Dartmouth College
Euler s ϕ function Carl Pomerance Dartmouth College Euler s ϕ function: ϕ(n) is the number of integers m [1, n] with m coprime to n. Or, it is the order of the unit group of the ring Z/nZ. Euler: If a
More informationThe ranges of some familiar arithmetic functions
The ranges of some familiar arithmetic functions Max-Planck-Institut für Mathematik 2 November, 2016 Carl Pomerance, Dartmouth College Let us introduce our cast of characters: ϕ, λ, σ, s Euler s function:
More informationFACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE. 1. Introduction Recall that a Carmichael number is a composite number n for which
FACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE THOMAS WRIGHT Abstract. In light of the recent work by Maynard and Tao on the Dickson k-tuples conjecture, we show that with a small improvement
More informationCounting subgroups of the multiplicative group
Counting subgroups of the multiplicative group Lee Troupe joint w/ Greg Martin University of British Columbia West Coast Number Theory 2017 Question from I. Shparlinski to G. Martin, circa 2009: How many
More informationIrreducible radical extensions and Euler-function chains
Irreducible radical extensions and Euler-function chains Florian Luca Carl Pomerance June 14, 2006 For Ron Graham on his 70th birthday Abstract We discuss the smallest algebraic number field which contains
More informationINTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS
INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS JEAN-MARIE DE KONINCK and FLORIAN LUCA Abstract. For each integer n 2, let β(n) be the sum of the distinct prime divisors of n and let B(x) stand for
More informationRepeated Values of Euler s Function. a talk by Paul Kinlaw on joint work with Jonathan Bayless
Repeated Values of Euler s Function a talk by Paul Kinlaw on joint work with Jonathan Bayless Oct 4 205 Problem of Erdős: Consider solutions of the equations ϕ(n) = ϕ(n + k), σ(n) = σ(n + k) for fixed
More informationCarmichael numbers and the sieve
June 9, 2015 Dedicated to Carl Pomerance in honor of his 70th birthday Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) Carmichael numbers Fermat s little
More informationCounting in number theory. Fibonacci integers. Carl Pomerance, Dartmouth College. Rademacher Lecture 3, University of Pennsylvania September, 2010
Counting in number theory Fibonacci integers Carl Pomerance, Dartmouth College Rademacher Lecture 3, University of Pennsylvania September, 2010 Leonardo of Pisa (Fibonacci) (c. 1170 c. 1250) 1 We all know
More informationDIVISOR-SUM FIBERS PAUL POLLACK, CARL POMERANCE, AND LOLA THOMPSON
DIVISOR-SUM FIBERS PAUL POLLACK, CARL POMERANCE, AND LOLA THOMPSON Abstract. Let s( ) denote the sum-of-proper-divisors function, that is, s(n) = d n, d
More informationAmicable numbers. CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014
Amicable numbers CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Recall that s(n) = σ(n) n,
More informationPALINDROMIC SUMS OF PROPER DIVISORS. Paul Pollack Department of Mathematics, University of Georgia, Athens, GA 30602, USA
PALINDROMIC SUMS OF PROPER DIVISORS Paul Pollack Department of Mathematics, University of Georgia, Athens, GA 30602, USA pollack@math.uga.edu Received:, Revised:, Accepted:, Published: Abstract Fi an integer
More informationDepartmento de Matemáticas, Universidad de Oviedo, Oviedo, Spain
#A37 INTEGERS 12 (2012) ON K-LEHMER NUMBERS José María Grau Departmento de Matemáticas, Universidad de Oviedo, Oviedo, Spain grau@uniovi.es Antonio M. Oller-Marcén Centro Universitario de la Defensa, Academia
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 informationTWO REMARKS ON ITERATES OF EULER S TOTIENT FUNCTION
TWO REMARKS ON ITERATES OF EULER S TOTIENT FUNCTION PAUL POLLACK Abstract. Let ϕ k denote the kth iterate of Euler s ϕ-function. We study two questions connected with these iterates. First, we determine
More informationActa Mathematica Academiae Paedagogicae Nyíregyháziensis 32 (2016), ISSN
Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 32 (206), 303 3 wwwemisde/journals ISSN 786-009 THE INDEX OF COMPOSITION OF THE ITERATES OF THE EULER FUNCTION JEAN-MARIE DE KONINCK AND IMRE KÁTAI
More informationarxiv: v1 [math.nt] 22 Jun 2017
lexander Kalmynin arxiv:1706.07343v1 [math.nt] 22 Jun 2017 Nová-Carmichael numbers and shifted primes without large prime factors bstract. We prove some new lower bounds for the counting function N C (x)
More informationOrder and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationHerman te Riele Centrum Wiskunde & Informatica Postbus GB Amsterdam
1 Florian Luca, Herman te Riele φ and σ : from Euler to Erdős NAW 5/12 nr. 1 maart 2011 31 Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de México C.P. 58089, Morelia, Michoacán México
More informationarxiv:math/ v3 [math.nt] 23 Apr 2004
Complexity of Inverting the Euler Function arxiv:math/0404116v3 [math.nt] 23 Apr 2004 Scott Contini Department of Computing Macquarie University Sydney, NSW 2109, Australia contini@ics.mq.edu.au Igor E.
More informationOn the Distribution of Carmichael Numbers
On the Distribution of Carmichael Numbers Aran Nayebi arxiv:0906.3533v10 [math.nt] 12 Aug 2009 Abstract {1+o(1)} log log log x 1 Pomerance conjectured that there are x log log x Carmichael numbers up to
More informationOn a combinatorial method for counting smooth numbers in sets of integers
On a combinatorial method for counting smooth numbers in sets of integers Ernie Croot February 2, 2007 Abstract In this paper we develop a method for determining the number of integers without large prime
More informationEuler s, Fermat s and Wilson s Theorems
Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing
More informationThe Average Number of Divisors of the Euler Function
The Average Number of Divisors of the Euler Function Sungjin Kim Santa Monica College/Concordia University Irvine Department of Mathematics i707107@math.ucla.edu Dec 17, 2016 Euler Function, Carmichael
More informationarxiv:math/ v1 [math.nt] 17 Apr 2006
THE CARMICHAEL NUMBERS UP TO 10 18 arxiv:math/0604376v1 [math.nt] 17 Apr 2006 RICHARD G.E. PINCH Abstract. We extend our previous computations to show that there are 1401644 Carmichael numbers up to 10
More informationLEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID
LEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID JORDAN SCHETTLER Abstract. Lehmer s totient problem consists of determining the set of positive integers n such that ϕ(n) n 1 where ϕ is Euler s
More informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationLecture notes: Algorithms for integers, polynomials (Thorsten Theobald)
Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures
More informationOn primitive sets of squarefree integers
On primitive sets of suarefree integers R. Ahlswede and L. Khachatrian Fakultät für Mathematik Universität Bielefeld Postfach 003 3350 Bielefeld and A. Sárközy * Eötvös Loránd University Department of
More informationAN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS
AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k
More informationPALINDROMIC SUMS OF PROPER DIVISORS. Paul Pollack Department of Mathematics, University of Georgia, Athens, Georgia
#A3 INTEGERS 5A (205) PALINDROMIC SUMS OF PROPER DIVISORS Paul Pollack Department of Mathematics, University of Georgia, Athens, Georgia pollack@math.uga.edu Received: 0/29/3, Accepted: 6/8/4, Published:
More informationCongruences and exponential sums with the sum of aliquot divisors function
Congruences and exonential sums with the sum of aliquot divisors function Sanka Balasuriya Deartment of Comuting Macquarie University Sydney, SW 209, Australia sanka@ics.mq.edu.au William D. Banks Deartment
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationOrder and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationVARIANTS OF KORSELT S CRITERION. 1. Introduction Recall that a Carmichael number is a composite number n for which
VARIANTS OF KORSELT S CRITERION THOMAS WRIGHT Abstract. Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer a, there are infinitely many
More informationTwo problems in combinatorial number theory
Two problems in combinatorial number theory Carl Pomerance, Dartmouth College Debrecen, Hungary October, 2010 Our story begins with: Abram S. Besicovitch 1 Besicovitch showed in 1934 that there are primitive
More information#A42 INTEGERS 10 (2010), ON THE ITERATION OF A FUNCTION RELATED TO EULER S
#A42 INTEGERS 10 (2010), 497-515 ON THE ITERATION OF A FUNCTION RELATED TO EULER S φ-function Joshua Harrington Department of Mathematics, University of South Carolina, Columbia, SC 29208 jh3293@yahoo.com
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA International Number Theory Conference in Memory of Alf van der Poorten, AM 12 16 March, 2012 CARMA, the University of Newcastle
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationOn Values Taken by the Largest Prime Factor of Shifted Primes
On Values Taken by the Largest Prime Factor of Shifted Primes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationGENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A52 GENERALIZATIONS OF SOME ZERO-SUM THEOREMS Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA. Dartmouth Mathematics Society May 16, 2012
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Dartmouth Mathematics Society May 16, 2012 Based on joint work with P. Kurlberg, J. C. Lagarias, & A. Schinzel Let s begin
More informationBounds for the first several prime character nonresidues
Bounds for the first several prime character nonresidues Paul Pollack Abstract. Let ε > 0. We prove that there are constants m 0 = m 0 ε and κ = κε > 0 for which the following holds: For every integer
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More informationHouston Journal of Mathematics c 2050 University of Houston Volume 76, No. 1, Communicated by George Washington
Houston Journal of Mathematics c 2050 University of Houston Volume 76, No., 2050 SUMS OF PRIME DIVISORS AND MERSENNE NUMBERS WILLIAM D. BANKS AND FLORIAN LUCA Communicated by George Washington Abstract.
More informationSolved and unsolved problems in elementary number theory
Solved and unsolved problems in elementary number theory Paul Pollack Athens/Atlanta Number Theory Seminar February 25, 2014 1 of 45 For a less slanted view of the subject, consider purchasing: 2 of 45
More informationarxiv: v1 [math.nt] 2 Oct 2015
PELL NUMBERS WITH LEHMER PROPERTY arxiv:1510.00638v1 [math.nt] 2 Oct 2015 BERNADETTE FAYE FLORIAN LUCA Abstract. In this paper, we prove that there is no number with the Lehmer property in the sequence
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
More informationOn the average number of divisors of the Euler function
On the average number of divisors of the Euler function Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de Méico CP 58089, Morelia, Michoacán, Méico fluca@matmorunamm Carl Pomerance
More informationShort Kloosterman Sums for Polynomials over Finite Fields
Short Kloosterman Sums for Polynomials over Finite Fields William D Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@mathmissouriedu Asma Harcharras Department of Mathematics,
More informationThe first dynamical system
The first dynamical system Carl Pomerance, Dartmouth College Charles University November 8, 2016 As we all know, functions in mathematics are ubiquitous and indispensable. But what was the very first function
More informationThe multiplicative order mod n, on average
The multiplicative order mod n, on average Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA (Joint work with: Michel Balazard, Pär Kurlberg) Perfect shuffles Suppose you take a deck of 52
More informationAnatomy of torsion in the CM case
Anatomy of torsion in the CM case (joint work with Abbey Bourdon and Pete L. Clark) Paul Pollack Illinois Number Theory Conference 2015 August 14, 2015 1 of 27 This talk is a report on some recent work
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationOptimal primitive sets with restricted primes
Optimal primitive sets with restricted primes arxiv:30.0948v [math.nt] 5 Jan 203 William D. Banks Department of Mathematics University of Missouri Columbia, MO 652 USA bankswd@missouri.edu Greg Martin
More informationActa Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24 PRIMITIVE DIVISORS OF LUCAS SEQUENCES AND PRIME FACTORS OF x 2 + 1 AND x 4 + 1 Florian Luca (Michoacán, México) Abstract. In this
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationNOTES ON SOME NEW KINDS OF PSEUDOPRIMES
MATHEMATICS OF COMPUTATION Volume 75, Number 253, Pages 451 460 S 0025-5718(05)01775-8 Article electronically published on September 15, 2005 NOTES ON SOME NEW KINDS OF PSEUDOPRIMES ZHENXIANG ZHANG Abstract.
More informationMath 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications
Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications An elementary and indeed naïve approach to the distribution of primes is the following argument: an
More informationOn the Fractional Parts of a n /n
On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev
More informationDense product-free sets of integers
Dense product-free sets of integers Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Joint Mathematics Meetings Boston, January 6, 2012 Based on joint work with P. Kurlberg, J. C. Lagarias,
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
More informationPrime divisors in Beatty sequences
Journal of Number Theory 123 (2007) 413 425 www.elsevier.com/locate/jnt Prime divisors in Beatty sequences William D. Banks a,, Igor E. Shparlinski b a Department of Mathematics, University of Missouri,
More informationJEAN-MARIE DE KONINCK AND IMRE KÁTAI
BULLETIN OF THE HELLENIC MATHEMATICAL SOCIETY Volume 6, 207 ( 0) ON THE DISTRIBUTION OF THE DIFFERENCE OF SOME ARITHMETIC FUNCTIONS JEAN-MARIE DE KONINCK AND IMRE KÁTAI Abstract. Let ϕ stand for the Euler
More informationWhy the ABC conjecture
Why the ABC conjecture Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Kummer classes and anabelian geometry U. Vermont, September 10 11, 2016 (The Farside, Gary Larson) 1 What is the ABC
More informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationSECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C
p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer
More informationChris Smyth School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3JZ, UK.
THE DIVISIBILITY OF a n b n BY POWERS OF n Kálmán Győry Institute of Mathematics, University of Debrecen, Debrecen H-4010, Hungary. gyory@math.klte.hu Chris Smyth School of Mathematics and Maxwell Institute
More informationA talk given at the University of California at Irvine on Jan. 19, 2006.
A talk given at the University of California at Irvine on Jan. 19, 2006. A SURVEY OF ZERO-SUM PROBLEMS ON ABELIAN GROUPS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093 People s
More informationFERMAT S TEST KEITH CONRAD
FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA. Providence College Math/CS Colloquium April 2, 2014
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Providence College Math/CS Colloquium April 2, 2014 Let s begin with products. Take the N N multiplication table. It has
More informationOn the number of co-prime-free sets. Neil J. Calkin and Andrew Granville *
On the number of co-prime-free sets. by Neil J. Calkin and Andrew Granville * Abstract: For a variety of arithmetic properties P such as the one in the title) we investigate the number of subsets of the
More informationON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS
ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS L. HAJDU 1 AND N. SARADHA Abstract. We study some generalizations of a problem of Pillai. We investigate the existence of an integer M such that for m M,
More informationPlaying Ball with the Largest Prime Factor
Playing Ball with the Largest Prime Factor An Introduction to Ruth-Aaron Numbers Madeleine Farris Wellesley College July 30, 2018 The Players The Players Figure: Babe Ruth Home Run Record: 714 The Players
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationNotes on the second moment method, Erdős multiplication tables
Notes on the second moment method, Erdős multiplication tables January 25, 20 Erdős multiplication table theorem Suppose we form the N N multiplication table, containing all the N 2 products ab, where
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More information#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More informationPseudoprime Statistics to 10 19
Pseudoprime Statistics to 10 19 Jens Kruse Andersen and Harvey Dubner CONTENTS 1. Introduction 2. Background Information 3. Results References A base-b pseudoprime (psp) is a composite N satisfying b N
More informationNOTES ON ZHANG S PRIME GAPS PAPER
NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for
More informationLARGE PRIME NUMBERS (32, 42; 4) (32, 24; 2) (32, 20; 1) ( 105, 20; 0).
LARGE PRIME NUMBERS 1. Fast Modular Exponentiation Given positive integers a, e, and n, the following algorithm quickly computes the reduced power a e % n. (Here x % n denotes the element of {0,, n 1}
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationFlat primes and thin primes
Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes
More informationarxiv: v1 [math.nt] 9 Jan 2019
NON NEAR-PRIMITIVE ROOTS PIETER MOREE AND MIN SHA Dedicated to the memory of Prof. Christopher Hooley (928 208) arxiv:90.02650v [math.nt] 9 Jan 209 Abstract. Let p be a prime. If an integer g generates
More informationGap Between Consecutive Primes By Using A New Approach
Gap Between Consecutive Primes By Using A New Approach Hassan Kamal hassanamal.edu@gmail.com Abstract It is nown from Bertrand s postulate, whose proof was first given by Chebyshev, that the interval [x,
More information