On the Distribution of Carmichael Numbers
|
|
- Shanna Chapman
- 5 years ago
- Views:
Transcription
1 On the Distribution of Carmichael Numbers Aran Nayebi arxiv: v10 [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 x. At the time, his data tables up to appeared to support his conjecture. However, Pinch extended this data and showed that up to 10 21, Pomerance's conjecture did not appear well-supported. Thus, we build upon the work of Carl Pomerance and others to formulate an alternative conjecture regarding the distribution of Carmichael numbers that ts proven bounds and is roughly supported by Richard Pinch's data. All tables are included in the Appendix, and they are fully explained in the text. 1 Introduction Fermat's little theorem, also known as Fermat's criterion, states that for any integer b, n is prime if b n b (mod n). (1.0.1) When gcd(b, n) = 1, we can divide by b, b n 1 1 (mod n). (1.0.2) A composite natural number n for which b n 1 1 (mod n) for any xed integer b 2 is a pseudoprime. A positive composite integer n is a Carmichael number if b n 1 1 (mod n) for all integers b 2 with gcd(b, n) = 1. The importance of Carmichael numbers is that they test the limits of the Fermat primality test, and hence their distribution will be the interest of this paper. Let P b (x) denote the number of base b pseudoprimes x; and let C(x) denote the number of Carmichael numbers x. Pomerance [8] conjectures that for all large x, {1+o(1)} log log log x 1 C(x) = x log log x. (1.0.3) Unfortunately, according to Richard Pinch [19], Pomerance's conjecture does not appear to be well-supported by the data, an assertion which will be explained later in the discourse. As a result, we present an alternate conjecture based on a strongly supported conjecture that, C(x) C 3(x)P b (x), (1.0.4) P b,2 (x) where P b,2 (x) is the number of two-prime base b pseudoprimes x and C 3 (x) is the number of three-prime Carmichael numbers x. Instead, we propose that the number of Carmichael 1
2 numbers up to x suciently large is, C(x) = ψ x 5 6 log x L(x) = 1 x 3 ψ 1x 1 2 log 2 x 2 L(x) dt log 3 t, (1.0.5) log x log log log x where L(x) := exp{ }, ψ = τ 3 log log x C, ψ 1 = τ 3. If we let p, q, and d be odd primes, 27C and we dene ω a,b,c (p) as the number of distinct residues modulo p represented by a, b, c, then the constants C and τ 3 are explicitly given as such, κ 3 = n 1 C = 4T s 1 gcd(n, 6) n 4/3 r>s gcd(r,s)=1 δ(rs)ρ(rs(r s)) (rs) 3 2 T = 2 1 2/d (1 1/d), 2 d ρ(m) = d 1 d 2, d m 2, if 4 m; δ(m) = 1, if otherwise. (1.0.6) τ 3 = κ 3 λ, (1.0.7) λ := ( ) 1 3/p, (1 1/p) 3 p>3 p n p>3 p p 3 a<b<c, n=abc a,b,c pairwise coprime δ (a, b, c) p n p>3 2, if a b c 0 (mod 3); δ (a, b, c) =. 1, if otherwise. p ω a,b,c (p), p 3 We believe that ψ will approach and ψ 1 will approach We also demonstrate that this conjecture is roughly supported by Pinch's data and that it ts the proven upper and lower bounds for C(x). 2 Previous Results Before delving into the main results of this paper, we shall rst present previous results that we will explicitly use later on in our derivations. 2
3 2.1 Pseudoprimes Pseudoprime Distribution Erd s [1] proved that for the pseudoprimes dened in (1.0.2), Theorem 1 (Erd s 1950). lim x P π b (x) = o(π(x)), where P π b (x) is the number of base-b pseudoprimes x for b 2. Thus, the pseudoprimes are rarer than the primes. Although this claim is rather elementary, Erd s [11] went on to formulate an upper-bound for the pseudoprime counting function. Theorem 2 (Lehmer 1936, Erd s 1956). For some constants ɛ 11 and ɛ 2, ɛ 1 log x 2 P π 2 (x) x exp{ɛ 2 log x log log x}. In 1989, Pomerance [6] [11] proved tighter bounds for pseudoprime distribution. Theorem 3 (R.A. Mollin ed. 1989, Pomerance 1981). For the base-2 pseudoprime counting function, exp{(log x) } P 2 (x) x L(x) 1 log x log log log x 2, where L(x) = exp{ }. These log log x bounds are applicable to P b (x) for x x 0 (b). Theorem 4 (Pomerance 1981). Pomerance [11] showed that if we allow l 2 (n) to denote the exponent to which 2 belongs modulo n, then n is a pseudoprime (base 2) if and only if l 2 (n) n 1. Conjecture 5 (Pomerance 1981). Pomerance conjectured that the number of solutions w for all n is, #{w x : l 2 (w) = n} x L(x) 1+θ(x), lim θ(x) = 0. (2.1.1) x As a result, the number of base b pseudoprimes for suciently large x x 0 (b) is conjectured to be, P b (x) x L(x) 1. (2.1.2) Two-Prime Pseudoprime Distribution In 2004, William Galway conjectured a formula for the distribution of pseudoprimes with two distinct prime factors, p and q [3]. He noticed that a majority of these pseudoprimes satisfy the relation p 1 = r, where r and s are small coprime integers. Thus, q 1 s Conjecture 6 (Galway 2004). Allow p, q, and d be odd primes, allow P b,2 (x) to represent the counting function for odd pseudoprimes with two distinct prime factors, and P b,2 (x) := #{n x : n = pq, p < q, P b (n)}. Hence, 1 5 ɛ 1 can be taken as 8 log 2 [10]. 2 The lower bound is accredited to Lehmer [9]. lim P b,2(x) = Cx 1 2 x log 2 x, (2.1.3) 3
4 where C = 4T s 1 r>s gcd(r,s)=1 T = 2 d δ(rs)ρ(rs(r s)) (rs) , (2.1.4) 1 2/d 1.32, (2.1.5) (1 1/d) 2 ρ(m) = d 1 d 2, (2.1.6) d m 2, if 4 m; δ(m) = (2.1.7) 1, if otherwise. Galway's conjecture is somewhat supported by the data in Table 3 for it appears that C is slowly approaching its predicted constant value of (2.1.4). 2.2 Carmichael Numbers Carmichael Number Distribution Erd s proved an upper-bound for C(x) in 1956 [17]. Theorem 7 (Erd s 1956). where k is a constant. { k log x log log log x } C(x) < x exp, (2.2.1) log log x In the other direction, Alford, Granville, and Pomerance a lower-bound for C(x) for x suciently large [15]. Theorem 8 (Alford-Granville-Pomerance 1994). thus there are innitely many Carmichael numbers. Recently, Harman improved this lower-bound [18]. Theorem 9 (Harman 2005). just below x 1 3. It is not even known if C(x) > x 1 2. C(x) > x 2 7, (2.2.2) C(x) > x 0.332, (2.2.3) 4
5 Conjecture 10 (Pomerance 1981). The distribution of Carmichael numbers [8] is given by, for x suciently large. {1+o(1)} log log log x 1 C(x) = x log log x, (2.2.4) Remark 11. It is obvious that Conjecture 10 holds if and only if lim k = 1 in Theorem 7. However, Pinch [19] explains that the decrease in k is reversed between and 10 14, which is presented in Table 6. In fact, in Table 6, there is no clear evidence that suggests lim k = Three-Prime Carmichael Number Distribution In 2001, Granville and Pomerance [8] conjectured a formula for the distribution of Carmichael numbers with three distinct prime factors. Conjecture 12 (Granville-Pomerance 2001). If we let C 3 (x) be the counting function for Carmichael numbers with 3 distinct prime factors, then where κ 3 = n 1 gcd(n, 6) n 4/3 x 1 3 C 3 (x) τ 3 log 3 x τ 1 x dt log 3 t, (2.2.5) τ 3 = κ 3 λ 2100, (2.2.6) λ := ( ) 1 3/p , (2.2.7) (1 1/p) 3 p>3 p n p>3 p p 3 a<b<c, n=abc a,b,c pairwise coprime δ (a, b, c) p n p>3 p ω a,b,c (p), (2.2.8) p 3 2, if a b c 0 (mod 3); δ (a, b, c) =, (2.2.9) 1, if otherwise. and ω a,b,c (p) is the number of distinct residues modulo p represented by a, b, c. Recent provisional estimates by Chick and Davies [14] of the slowly converging innite series κ 3 suggest that κ 3 = which gives τ 3 = In Table 4, it is evident that τ 3 is in fact approaching We should note that we will use this value for τ 3 rather than Preliminaries We now present the main results achieved in the paper by rst introducing three important lemmas. 5
6 3.1 Three Lemmas Regarding Base b Pseudoprimes with k Distinct Prime Factors Let ω(n) represent the number of dierent prime factors of n. Also, given an integer sequence {m i } i=1, note that a prime p is said to be a primitive prime factor of m i if p divides m i but does not divide any m j for j < i. Lemma 13 (Erd s 1949). Let n be a base-2 pseudoprime. For every k, there exist innitely many squarefree base-2 pseudoprimes with ω(n) = k [2]. Lemma 14. We closely follow Erd s' proof [2] of Lemma 13 to show that there exist in- nitely many squarefree base b pseudoprimes n for any b 2 with ω(n) = k distinct prime factors. Proof. Let {n j } j=1 be an integer sequence of base b pseudoprimes such that each term is greater than its preceding term, and ω(n i ) = k 1, for any n i in {n j } j=1. Let p i be one of the primitive prime factors of b n i 1 1. Since b n i 1 1 (mod p i n i ) and b p i 1 1 (mod p i ), p i n i is a pseudoprime to base b. We observe that b p i 1 1 (mod n i ) because p i 1 0 (mod (n i 1)). As a result, it follows that b n i 1 1 (mod n i ). Also, b n ip i 1 1 (mod p i n i ) since b n ip i 1 = b (n i 1)(p i 1) b n i 1 b p i 1. Hence, p i n i is squarefree and ω(p i n i ) = k. Moreover, every integer satisfying p i n i is dierent because n i is composite, p i > n i, and p i 1 (mod (n i 1)). Lemma 15. We extend Szymiczek's proof [12] to demonstrate that for any base b pseudoprime, b 2, having k 2 distinct prime factors and for x suciently large, P b,k+1 (x) P b,k (log b x). (3.1.1) Proof. Let n be a pseudoprime with k > 1 distinct prime factors. Since n 1 is the smallest exponent ɛ such that p b ɛ 1 and ɛ divides an exponent h such that p b h 1, it follows from Fermat's little theorem that p b p 1 1. Thus, from Zsigmondy's theorem, there exists a prime p > n for which p b n 1 1 and n 1 p 1 for b 2. As a result, np b n 1 1. (3.1.2) On the other hand, since np 1 = n(p 1) + n 1 and n 1 p 1, n 1 np 1 and np b np 1 1. If we let n, m N, the set of positive natural numbers, such that n m and p > n, q > m, then np mq for primes p and q. However, suppose we let np = mq and p > n, then m p. Hence, m p and m > n. Unfortunately, the latter statement is contradictory, and as a result np mq. If n and m are two dierent base b pseudoprimes with k 2 distinct prime factors, then np and mq are distinct pseudoprimes as well. From (3.1.2), p (b n 1 2 1)(b n ), (3.1.3) and p b n < b n 2. (3.1.4) 6
7 If n log b x, then pn < x 1 2 log b x < x. It then follows that for every base b pseudoprime n with k distinct prime factors, n = p 1 p 2 p k log b x, there is at least one base b pseudoprime such that p 1 p 2 p k p < x. Our proof of Lemma 15 closely models Szymiczek's proof in [12] until (3.1.3), where the relation p 2 n < e n 2 given in [12] does not hold for bases b > 2. This is easily overcome by using the relation p b n < b n 2 instead. 3.2 Conjecture 16 and Conjecture 18 We conjecture the following relations: Conjecture 16. For any xed k 2, let P b,k (x) denote the counting function for base b pseudoprimes with k distinct prime factors, and let P b (x) denote the counting function for base b pseudoprimes. Asymptotically, P b,k (x) P b (x) = o(1). (3.2.1) as, log x log log x We are only able to partially support Conjecture 16. First, we express the ratio P b,k(x) P b (x) P b,k (x) P b (x) = P b,k(x), (3.2.2) g(x) P b,i (x) where the maximum number of distinct prime factors, g(x), of any integer x is g(x). Let log(j) b x denote the the j-fold iteration of the base b logarithm. Thus, i=2 g(x) k 1 P b,i (x) = P b,i (x) + P b,k + i=2 i=2 g(x) i=k+1 Due to Lemma 15, for any h k in (3.2.3), P b,k (x) P b,h (log (k h) b in (3.2.3), P b,w (x) P b,k (log (w k) b x). Hence, i=2 P b,i (x). (3.2.3) x), and for any w k k 1 P b,i (x) P b,2 (log (k 2) b x) + P b,3 (log (k 3) b x) + + P b,k 1 (log b x) (3.2.4) We cut o the terms from proceeding until could be suciently large to satisfy (3.2.5). g(x) i=k+1 log x log log x because if such were the case, then no x P b,i (x) P b,k+1 (log b x) + + P b,r(x) (log (r(x) k) b x), (3.2.5) 7
8 where r(x) is any function that grows slower than log x, the iterated logarithm. We explicitly dene log x as { log 0 if x 1; x := 1 + log (log x) if x > 1. (3.2.6) Remark 17. We should note that the support for Conjecture 16 is rather weak. This is largely due to the weakness of Szymiczek's construction, P b,k+1 (x) P b,k (log b x), in Lemma 15. We believe that the latter relation can be strengthened if a polynomial decrease can be proven. In other words, if P b,k+1 (x) P b,k (x c ) for some c (0, 1). However, we neither know how to prove this nor do we know what value c can acquire. Similarly, in our proof of Conjecture 16, we dened the function r(x) as any function that grows slower than log x, the iterated logarithm. Although it is not hard to see that any function growing faster than log x will fail, it is not obvious whether any function growing at the same rate as log x will succeed. However, we have several reasons to strongly believe that r(x) = log x. First, for practical values of x the iterated logarithm grows much more slowly than the logarithm. Second, log x = slog e (x), where slog e (x) is the super-logarithm, the inverse of tetration. Thus, the iterated logarithm's relation to the super-logarithm also supports its slow growth. Third, higher bases give smaller iterated logarithms, and log x is well dened for { any base greater than exp 1 e will grow even more slowly for higher pseudoprime bases. }. This implies that for any base b 2, the iterated logarithm Conjecture 18. For any xed k 3, let C k (x) denote the number of k-prime Carmichael numbers up to x, and let C(x) denote the Carmichael number counting function. Asymptotically, C k (x) = o(1). (3.2.7) C(x) 3.3 Support for Conjecture 16 and Conjecture 18 So far, the claim established by Conjecture 16 is not yet borne out by the data in Table 1. We believe that the ratio P b,2(x) P 2 will approach 0, but may do so slowly. On the other hand, it (x) appears that the ratio C 3(x) in Table 2 rapidly approaches 0, thereby supporting Conjecture C(x) 18. Furthermore, Pomerance, Selfridge, and Wagsta's results [10] support both conjectures as well. In Conjecture 1 of their paper, they believe that for each ɛ > 0, there is an x 0 (ɛ) such that for all x x 0 (ɛ), { {2 + ɛ} log x log log log x } C(x) > x exp. (3.3.1) log log x Pomerance, Selfridge, and Wagsta [10] show that P b,k (x) O k (x 2k/(2k+1) ). Hence, if (3.3.1) is true, then the pseudoprimes with exactly k prime factors form a set of relative density 0 in the set of all [pseudoprimes] [10]. Similarly, they show that C k (x) x (k 1)/k, and if 8
9 (3.3.1) holds, then for each k, C k (x) = o(c(x)) [10]. Interestingly, we can also support the statements in Conjecture 16 and Conjecture 18 by relating them to their composite superset. Let the number of composites x with k distinct prime factors be denoted by π k (x) and let the number of composites x with k prime factors (not necessarily distinct) be represented by τ k (x). Hence, we can prove upper and lower bounds for π k (x). In of Hardy and Wright [7] for k 1, where Π k (x) = ϑ k(x) log x +O( x kx(log log x) k 1 for k 2 and follows that k!π k (x) Π k (x) k!τ k (x), (3.3.2) x ) in In , since ϑ log x k(x) = Π k (x) log x x 2 Π k (x) dt = O(x), Π k (x) t 2 Π k (x) dt t kx(log log x)k 1. As a result, it log x x(log log x)k 1 π k (x) (1 + o(1)) (k 1)! log x. (3.3.3) In the same respect, a lower bound for π k can be formulated. In it is proven that, τ k (x) π k (x) 1 1 := Π k 1 (x). (3.3.4) p 1 p 2 p 2 k 1 x p 1 p 2 p k 1 x Since π k (x) τ k (x) Π k 1 (x) and π k (x) Π k(x) Π k! k 1 (x), ( ) x(log log x) k 1 (k 1)x(log log x)k 2 π k (x) O (k 1)! log x log x ( ) x + O. (3.3.5) log x Although the lower-bound in (3.3.5) is meaningless, we can improve the upper-bound given in (3.3.3) to an equality, x(log log x)k 1 π k (x) (k 1)! log x. (3.3.6) By the Erd s-kac Theorem, we can formulate the probability that a number near x has k distinct prime factors using the fact that these numbers are distributed with a mean and variance of log log x. Hence, setting log log x as the λ of the Poisson distribution P(k; λ) and taking its limit for any xed k, (log log x) k 1 exp{ log log x} lim P(k; λ) = lim x x (k 1)! = 0, (3.3.7) 1 where the asymptotic error bound is given by O( ) [13]. However, we caution the reader log log x to consider that just because the probability of a general composite near x having k distinct prime factors goes to 0, does not necessitate that this probability will hold for either P b,k (x) or C k (x). 9
10 4 On the Distribution of Carmichael Numbers From Conjecture 16 and Conjecture 18, it is obvious that the k-prime pseudoprimes and the k-prime Carmichael numbers are much more sparsely distributed than the set of all pseudoprimes and Carmichael numbers, respectively. We hypothesize that if k is minimized for both the k-prime pseudoprimes and the k-prime Carmichael numbers, then the ratios P b,2 (x) P b and C 3(x) (x) C(x) will roughly achieve the same values for large enough x. We also recommend using the minimum number of distinct prime factors for both the pseudoprimes and the Carmichael numbers because rst, there is no overlap between the three-prime Carmichael numbers and two-prime pseudoprimes and second, the distinct prime factors cannot be arbitrarily chosen. This idea leads us to believe that, Conjecture 19. C(x) C 3(x)P b (x). (4.0.8) P b,2 (x) As a result, assuming Conjecture 5, Conjecture 6, Conjecture 12, and Conjecture 19, Conjecture 20. The amount of Carmichael numbers x given by the counting function C(x) is conjectured to be for x suciently large, where and C(x) = ψ x 5 6 log x L(x) = 1 x 3 ψ 1x 1 2 log 2 x 2 L(x) ψ = τ 3 C We propose that ψ approaches and that ψ 1 dt log 3 t, (4.0.9) (4.0.10) ψ 1 = τ 3 27C. (4.0.11) approaches Conclusions Conjecture 20 ts the proven bounds for C(x) given in Theorems 7-9, and both ψ and ψ 1 appear to be approaching constant values. However, there are several reasons as to why Conjecture 20 may not be necessarily borne out by the data in Table 5. The estimate of C (2.1.4) was found by summing roughly 10 9 of the most signicant terms of the dening sum [3], and Galway proposes to make the computation of C rigorous, with explicit error bounds [3]. Similarly, the innite series κ 3 is slowly convergent, and it is not until in Table 4 that κ 3 appears to approach its estimated value of However, the primary source of inaccuracy is due to Conjecture 5. Since Pomerance's conjecture for the distribution of pseudoprimes is applicable for suciently large x and pseudoprime counts have only been 10
11 conducted to 10 15, we are not sure how suciently large x must be for Conjecture 5 to be an accurate model for pseudoprime distribution. Lastly, x must also be immensely large in order for P b,2(x) P b (x) = o(1); a claim which can be interpreted from Table 1. 6 Acknowledgements I would like to express my gratitude to Charles R. Greathouse IV who provided invaluable guidance in the direction of this paper; Johan B. Henkens who helped me count the base-2 pseudoprimes and 2-strong pseudoprimes up to using Galway's data; Professor Kazimierz Szymiczek who claried Lemma 15; and David H. Low who assisted me with formatting and typesetting errors. I would also like to thank Professor William F. Galway for sharing his viewpoints regarding the pseudoprimes with k distinct prime factors. 11
12 References [1] Crandall, Richard, and Carl Pomerance. Prime Numbers: A Computational Perspective. New York: Springer, [2] Erd s, Paul. On the Converse of Fermat's Theorem. Amer. Math. Monthly 56 (1949): [3] Galway, William F. Research Statement galway/research-statement.pdf. [4] Galway, William F. Tables of pseudoprimes and related data. 4 Nov Apr [5] Galway, William F. The Pseudoprimes below Nov Simon Fraser University. 8 Apr [6] Gordon, Daniel M., and Carl Pomerance. The Distribution of Lucas and Elliptic Pseudoprimes. Math. Comp. 57 (1991): [7] Hardy, Godfrey H., and Edward M. Wright. An Introduction to the Theory of Numbers. Oxford: Clarendon P, Oxford UP, [8] Pomerance, Carl, and Andrew Granville. Two Contradictory Conjectures Concerning Carmichael Numbers. Math. Comp. 71 (2001): [9] Pomerance, Carl. A New Lower Bound for the Pseudoprime Counting Function. Illinois J. Math. 26 (1982): 4-9. [10] Pomerance, Carl, J. L. Wagsta, and Samuel S. Wagsta, jr. Pseudoprimes to Math. Comp. 35 (1980): [11] Pomerance, Carl. On the Distribution of Pseudoprimes. Math. Comp. 37 (1981): [12] Szymiczek, Kazimierz. On Pseudoprimes which are Products of Distinct Primes. Amer. Math. Monthly 74 (1967): [13] Tenenbaum, Gérald. Introduction to Analytic and Probabilistic Number Theory. Cambridge: Cambridge UP, [14] Chick, J.M. and G.H. Davies. The Evaluation of κ 3. Math. Comp. 77 (2008): [15] Alford, W.R., Andrew Granville, and Carl Pomerance. There are Innitely Many Carmichael Numbers. Ann. of Math. 140 (1994):
13 [16] Pinch, Richard G.E. The Carmichael Numbers up to Proceedings Conference on Algorithmic Number Theory, Turku, May Turku Centre for Computer Science General Publications 46, edited by Anne-Maria Ernvall-Hytönen, Matti Jutila, Juhani Karhumäki and Arto Lepistö. [17] Erd s, Paul. On pseudoprimes and Carmichael numbers. Publ. Math. Debrecen 4 (1956), [18] Harman, Glyn. On the number of Carmichael numbers up to x. Bull. Lond. Math. Soc. 37 (2005), [19] Pinch, Richard G.E. The Carmichael Numbers up to 10 to the 21. Eighth Algorithmic Number Theory Symposium ANTS-VIII May 17-22, 2008 Ban Centre, Ban, Alberta (Canada). 13
14 APPENDIX P b,2 (x) P 2 (x) Bound P b,2 (x) P 2 (x) Table 1: Comparison between P b,2 (x) and P 2 (x) up to C 3 (x) C(x) Bound C 3 (x) C(x) Table 2: Comparison between C 3 (x) and C(x) up to
15 Bound P b,2 (x) C Table 3: Values of C up to Bound τ Table 4: Values of τ 3 up to
16 Bound C(x) 69.51x 5 6 log x L(x) 2.57x 1 2 log 2 x R x dt log 3 t L(x) ψ ψ Table 5: Values of ψ and ψ 1 up to
17 Bound k Table 6: Values of k up to Data Sources: The counts of P b,2 (x) in Table 1 and Table 3 as well as the values of C in Table 3 are from [5]. The counts of P 2 (x) in Table 1 were performed by myself using W.F. Galway's data in [4]. The counts of C 3 (x) in Table 2 and the counts of C(x) in Table 2 and Table 5 are from [16]. Table 4 is a replica of Table 3 in [14]. Table 6 is based o of values of k found in [19]. 17
Improving the Accuracy of Primality Tests by Enhancing the Miller-Rabin Theorem
Improving the Accuracy of Primality Tests by Enhancing the Miller-Rabin Theorem Shyam Narayanan Fourth Annual MIT-PRIMES Conference Mentor: David Corwin Project Proposed by Stefan Wehmeier and Ben Hinkle
More informationHOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 1. Introduction
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
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 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 informationON 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 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 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 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 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 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 informationON THE SET OF WIEFERICH PRIMES AND OF ITS COMPLEMENT
Annales Univ. Sci. Budapest., Sect. Comp. 27 (2007) 3-13 ON THE SET OF WIEFERICH PRIMES AND OF ITS COMPLEMENT J.-M. DeKoninck and N. Doyon (Québec, Canada) Dedicated to the memory of Professor M.V. Subbarao
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 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 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 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 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 informationSneaky Composites. Number Theory. Matthew Junge. March 12th, 2010
Sneaky Composites Number Theory Matthew Junge March 12th, 2010 Abstract We define n to be a pseuodoprime base a if a n 1 1 mod n and n is composite. I was intrigued by a claim I read in the book Number
More informationPrimes at a Glance. By R. K. Guy, C. B. Lacampagne, and J. L. Selfridge
mathematics of computation volume 4x. number 177 january 1987, pages 18-2(12 Primes at a Glance By R. K. Guy, C. B. Lacampagne, and J. L. Selfridge To Dan Shanks: May he stay on form und again become the
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 informationPrimality testing: variations on a theme of Lucas. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Primality testing: variations on a theme of Lucas Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA In 1801, Carl Friedrich Gauss wrote: The problem of distinguishing prime numbers from composite
More informationPRIME GENERATING LUCAS SEQUENCES
PRIME GENERATING LUCAS SEQUENCES PAUL LIU & RON ESTRIN Science One Program The University of British Columbia Vancouver, Canada April 011 1 PRIME GENERATING LUCAS SEQUENCES Abstract. The distribution of
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 informationStatistics in elementary number theory
Statistics in elementary number theory Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA CRM Workshop on Statistics and Number Theory 15 19 September, 2014 In this talk we will consider 4 statistical
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 informationAdvanced Algorithms and Complexity Course Project Report
Advanced Algorithms and Complexity Course Project Report Eklavya Sharma (2014A7PS0130P) 26 November 2017 Abstract This document explores the problem of primality testing. It includes an analysis of the
More informationp = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is
LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that
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. 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 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 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 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 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 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 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 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 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 informationRoots of Unity, Cyclotomic Polynomials and Applications
Swiss Mathematical Olympiad smo osm Roots of Unity, Cyclotomic Polynomials and Applications The task to be done here is to give an introduction to the topics in the title. This paper is neither complete
More informationA sequence of triangle-free pseudorandom graphs
A sequence of triangle-free pseudorandom graphs David Conlon Abstract A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one
More informationA Few Primality Testing Algorithms
A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationWXML Final Report: Primality of Polynomials
WXML Final Report: Primality of Polynomials William Stein, Travis Scholl, Astrid Berge, Daria Micovic, Xiaowen Yang Autumn 016 1 Introduction The density of certain types of primes is a classical question
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 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 informationResults of modern sieve methods in prime number theory and more
Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications
More informationPrimality Testing. 1 Introduction. 2 Brief Chronology of Primality Testing. CS265/CME309, Fall Instructor: Gregory Valiant
CS265/CME309, Fall 2018. Instructor: Gregory Valiant Primality Testing [These notes may not be distributed outside this class without the permission of Gregory Valiant.] 1 Introduction Prime numbers are
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 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 information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
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 informationPrimality testing: then and now
Primality testing: then and now Mathematics Department Colloquium Boise State University, February 20, 2019 Carl Pomerance Dartmouth College (emeritus) University of Georgia (emeritus) In 1801, Carl Friedrich
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 informationarxiv: v3 [math.nt] 15 Dec 2016
Lehmer s totient problem over F q [x] arxiv:1312.3107v3 [math.nt] 15 Dec 2016 Qingzhong Ji and Hourong Qin Department of Mathematics, Nanjing University, Nanjing 210093, P.R.China Abstract: In this paper,
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 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 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 informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationCharacters and triangle generation of the simple Mathieu group M 11
SEMESTER PROJECT Characters and triangle generation of the simple Mathieu group M 11 Under the supervision of Prof. Donna Testerman Dr. Claude Marion Student: Mikaël Cavallin September 11, 2010 Contents
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 informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationFactorization & Primality Testing
Factorization & Primality Testing C etin Kaya Koc http://cs.ucsb.edu/~koc koc@cs.ucsb.edu Koc (http://cs.ucsb.edu/~ koc) ucsb ccs 130h explore crypto fall 2014 1/1 Primes Natural (counting) numbers: N
More informationON A CLASS OF APERIODIC SUM-FREE SETS NEIL J. CALKIN PAUL ERD OS. that is that there are innitely many n not in S which are not a sum of two elements
ON A CLASS OF APERIODIC SUM-FREE SETS NEIL J. CALKIN PAUL ERD OS Abstract. We show that certain natural aperiodic sum-free sets are incomplete, that is that there are innitely many n not in S which are
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 informationABSTRACT 1. INTRODUCTION
ON PIMES AN TEMS OF PIME O INEX IN THE LEHME SEUENCES John H. Jaroma epartment of Mathematical Sciences, Loyola College in Maryland, Baltimore, M 110 Submitted May 004-Final evision March 006 ABSTACT It
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 informationLARGE PRIME NUMBERS. In sum, Fermat pseudoprimes are reasonable candidates to be prime.
LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that
More informationLucas Lehmer primality test - Wikipedia, the free encyclopedia
Lucas Lehmer primality test From Wikipedia, the free encyclopedia In mathematics, the Lucas Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Edouard Lucas
More informationarxiv:math/ v1 [math.nt] 9 Feb 1998
ECONOMICAL NUMBERS R.G.E. PINCH arxiv:math/9802046v1 [math.nt] 9 Feb 1998 Abstract. A number n is said to be economical if the prime power factorisation of n can be written with no more digits than n itself.
More informationPrimality testing: then and now
Seventy-five years of Mathematics of Computation ICERM, November 1 3, 2018 Primality testing: then and now Carl Pomerance Dartmouth College, Emeritus University of Georgia, Emeritus In 1801, Carl Friedrich
More informationA Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.6. A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve Ömer Küçüksakallı Mathematics Department Middle East
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 informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationMultiplicative Order of Gauss Periods
Multiplicative Order of Gauss Periods Omran Ahmadi Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, M5S 3G4, Canada oahmadid@comm.utoronto.ca Igor E. Shparlinski
More informationNOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials
NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationLarge strings of consecutive smooth integers
Large strings of consecutive smooth integers Filip Najman Abstract In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erdös that measures the minimal
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 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 informationYunhi Cho and Young-One Kim
Bull. Korean Math. Soc. 41 (2004), No. 1, pp. 27 43 ANALYTIC PROPERTIES OF THE LIMITS OF THE EVEN AND ODD HYPERPOWER SEQUENCES Yunhi Cho Young-One Kim Dedicated to the memory of the late professor Eulyong
More informationMore Hodge-Podge Pseudoprimes
More Hodge-Podge Pseudoprimes Eric Roettger Mount Royal University Based on joint work with: Richard Guy and Hugh Williams eroettger@mtroyal.ca March 2017 Eric Roettger (MRU) More Hodge-Podge Pseudoprimes
More informationUncertainty can be Better than Certainty:
Abstract Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing Richard P. Brent Australian National University For many years mathematicians and computer scientists have searched
More informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationOn the Representations of xy + yz + zx
On the Representations of xy + yz + zx Jonathan Borwein and Kwok-Kwong Stephen Choi March 13, 2012 1 Introduction Recently, Crandall in [3] used Andrews identity for the cube of the Jacobian theta function
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 informationResearch Statement. Enrique Treviño. M<n N+M
Research Statement Enrique Treviño My research interests lie in elementary analytic number theory. Most of my work concerns finding explicit estimates for character sums. While these estimates are interesting
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
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 informationOn Integers for Which the Sum of Divisors is the Square of the Squarefree Core
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 15 (01), Article 1.7.5 On Integers for Which the Sum of Divisors is the Square of the Squarefree Core Kevin A. Broughan Department of Mathematics University
More informationOEIS A I. SCOPE
OEIS A161460 Richard J. Mathar Leiden Observatory, P.O. Box 9513, 2300 RA Leiden, The Netherlands (Dated: August 7, 2009) An overview to the entries of the sequence A161460 of the Online Encyclopedia of
More 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 informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 10 February 19, 2013 CPSC 467b, Lecture 10 1/45 Primality Tests Strong primality tests Weak tests of compositeness Reformulation
More informationSUMS OF SQUARES WUSHI GOLDRING
SUMS OF SQUARES WUSHI GOLDRING 1. Introduction Here are some opening big questions to think about: Question 1. Which positive integers are sums of two squares? Question 2. Which positive integers are sums
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 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 informationThe running time of Euclid s algorithm
The running time of Euclid s algorithm We analyze the worst-case running time of EUCLID as a function of the size of and Assume w.l.g. that 0 The overall running time of EUCLID is proportional to the number
More informationThe 98th Mathematics Colloquium Prague November 8, Random number theory. Carl Pomerance, Dartmouth College
The 98th Mathematics Colloquium Prague November 8, 2016 Random number theory Carl Pomerance, Dartmouth College In 1770, Euler wrote: Mathematicians have tried in vain to discover some order in the sequence
More informationEquivalence of Pepin s and the Lucas-Lehmer Tests
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol., No. 3, 009, (35-360) ISSN 1307-5543 www.ejpam.com Equivalence of Pepin s and the Lucas-Lehmer Tests John H. Jaroma Department of Mathematics & Physics,
More informationOleg Eterevsky St. Petersburg State University, Bibliotechnaya Sq. 2, St. Petersburg, , Russia
ON THE NUMBER OF PRIME DIVISORS OF HIGHER-ORDER CARMICHAEL NUMBERS Oleg Eterevsky St. Petersburg State University, Bibliotechnaya Sq. 2, St. Petersburg, 198904, Russia Maxim Vsemirnov Sidney Sussex College,
More informationAndrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers
PRIMITIVE PRIME FACTORS IN SECOND-ORDER LINEAR RECURRENCE SEQUENCES Andrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a class of Lucas sequences
More informationPrimes of the Form n! ± 1 and p ± 1
mathematics of computation volume 38, number 158 april 1982, pages 639-643 Primes of the Form n! ± 1 and 2-3-5 p ± 1 By J. P. Buhler, R. E. Crandall and M. A. Penk Abstract. All primes less than 101000
More information