Congruences and Exponential Sums with the Euler Function
|
|
- Norman Owen Stafford
- 6 years ago
- Views:
Transcription
1 Fields Institute Communications Volume 00, 0000 Congruences and Exonential Sums with the Euler Function William D. Banks Deartment of Mathematics, University of Missouri Columbia, MO 652 USA Igor E. Sharlinski Deartment of Comuting, Macquarie University Sydney, NSW 209, Australia Dedicated to Hugh Williams on his sixtieth birthday Abstract. We give uer bounds for the number of solutions to congruences with the Euler function ϕn) and with the Carmichael function λn). We also give nontrivial bounds for certain exonential sums involving ϕn). Analogous results can also be obtained for the sum of divisors function and similar arithmetic functions. Let ϕn) denote the Euler function: Introduction ϕn) = #{ a n gcda, n) = }. Let be a rime number, fixed throughout, and ut e x) = ex2πix/) for all x R. In this aer, we give uer bounds for exonential sums of the form N S a, N) = e aϕn)), n= where gcda, ) =, and N is sufficiently large. Our bounds are nontrivial for a wide range of values of, starting with log 9 N. We remark that although it might be ossible to imrove on this ower of log N, for very small values of relative to N, it is simly not ossible to obtain nontrivial bounds. In fact, it has been shown in Theorem 3.5 of [5] that for any rime number of size = olog log N),.) 2000 Mathematics Subject Classification. Primary L07, N69; Secondary N37, L20. c 0000 American Mathematical Society
2 2 William D. Banks and Igor E. Sharlinski the congruence ϕn) 0 mod ) holds for all ositive integers n N with at most on) excetions; see 2.3) below for a more recise formulation of this statement. Thus, for rimes of this size, one has S a, N) = N + on). We also estimate more general sums of the form N S f, N) = e fϕn))), n= where fx) is a olynomial with integer coefficients and degree d 2 that is not constant modulo. In fact, our methods can be used without any further modifications to estimate the similar sums when fx) is a rational function one only needs to deal aroriately with the oles). We also exect that our methods can be alied to exonential sums with relaced by an arbitrary ositive integer m, although certain arguments would be more comlicated. One should also be able to work with various other arithmetic functions, including the sum of divisors function σn). We also give bounds for the number T a, N) of ositive integers n N such that ϕn) a mod ) and for the number L a, N) of ositive integers n N such that λn) a mod ), where λn) denotes the Carmichael function. We recall that λn) is defined to be the largest ossible order of any element in the unit grou of the residue ring modulo n. More recisely, for a rime ower q k, one has λ q k) { q = k q ) if q 3 or k 2, 2 k 2 if q = 2 and k 3, and for arbitrary n 2, λn) = lcm λ q k ),...,λ q k ν ) ) ν, where n = q k... qkν ν is the rime factorization of n. Of course, λ) =. Throughout the aer, the imlied constants in the symbols O, and may occasionally, where obvious, deend on a real arameter ε > 0 and an integer d but are absolute otherwise. We recall that the notations U V and V U are equivalent to the statement that U = OV ) for ositive functions U and V. We also use the symbol o with its usual meaning: the statement U = ov ) is equivalent to U/V 0. Acknowledgements. Most of this work was done during a visit by W. B. to Macquarie University, whose hositality and suort are gratefully acknowledged. Work also suorted in art, for W. B. by NSF grant DMS , and for I. S. by ARC grant DP Prearations Here we collect some known number-theoretic estimates which are used in the sequel. For any integer n 2, let Pn) denote the largest rime divisor of n, and ut P) =. As usual, we say that an integer n is Y -smooth if and only if Pn) Y. Let ψx, Y ) = #{ n X n is Y -smooth}. The following estimate is a substantially relaxed and simlified version of Corollary.3 of [3]; see also [3].
3 Congruences and Exonential Sums with the Euler Function 3 Lemma 2. Let u = log X/ logy. For any u with u Y /2, we have ψx, Y ) Xu u+ou). Throughout the sequel, we denote by P the set of all rime numbers, P[Y, X] the set of l P with Y < l X, and P[X] = P[, X]. We also need the following simlified form of the Brun-Titchmarsh theorem; see Theorem in Section 2.3. of [9] or Theorem 3.7 in Chater 3 of [0]. Lemma 2.2 For any X > k, let πx; k, a) be the number of rimes l P[X] such that l a mod k). Then πx; k, a) X ϕk)log2x/k). Finally, our rincial tool is the following bound for exonential sums with rime numbers, which follows immediately from Theorem 2 of [6]. Lemma 2.3 For any X 2, the following bound holds: max gcdc,)= e cl) /2 + X /4 /8 + /2 X /2 )X log 3 X. l P[X] Proof Let Λn) denote the von Mangoldt function: { log l if n is a ositive ower of some rime l, Λn) = 0 otherwise. According to Theorem 2 of [6], we have for any integer m 2: m max Λn)e cn) gcdc,)= /2 + m /4 /8 + /2 m /2 )m log 4 m. Taking M = X, we aly artial summation: M e cl) = log n Λn)e cn) + OM /2 ) l P[X] = log M M Λn)e cn) M ) + log m m Λn)e cn) + OX /2 ) logm + ) m=2 M M Λn)e cn) log M + m m log 2 Λn)e cn) m + M/2. The result follows. m=2 Let F d, denote the set of olynomials with integer coefficients of degree d whose leading coefficient is relatively rime to ; that is, F d, = { fx) = a d x d a x + a 0 Z[x] ad 0 mod ) }. 2.) For exonential sums over rimes with olynomials from F d,, d 2, we use the following bound of [7]. We remark that the condition d 2 is imortant; thus Lemma 2.3 and Lemma 2.4 do not overla.
4 4 William D. Banks and Igor E. Sharlinski Lemma 2.4 For any ε > 0, d 2 and X 2, the following bound holds: max g F d, e gl)) 3/6+ε X 25/32. For any integer a, let l P[X] T a, N) = { n N ϕn) a mod )}, 2.2) and ut T a, N) = #T a, N). In the secial case where a 0 mod ), we have the following bound, which is a artial case of Theorem 3.5 of [5]. Lemma 2.5 For any N 2, we have T 0, N) N log log N. We remark that the bound of Lemma 2.5 becomes trivial when = Olog log N), which is very close to the threshold.) below which it is not ossible to obtain nontrivial uer bounds. Indeed, for satisfying.), we have by inequality 4.2) of [5]: T 0, N) = N + ON ex c log log N)), 2.3) for some absolute constant c > 0. To study congruences with the Carmichael function, we need the following statement, which is Theorem 5 of [8]. Lemma 2.6 For all sufficiently large numbers N and any log log N) 3, the number of ositive integers n N with λn) n ex ) is at most N ex 0.69 log ) /3). 3 Congruences with ϕn) As in Section 2, let T a, N) be defined by 2.2), and let T a, N) = #T a, N). In this section, we consider the roblem of estimating T a, N) in the case where a 0 mod ). Theorem 3. The following bound holds: max T a, N) Nw w/2+ow) + Nw gcda,)=, where w = log N/ log. Moreover, if ex 0.5 logn log log N ), then max T a, N) N +o). gcda,)= Proof Without loss of generality, we can assume that as N, since the bounds are trivial otherwise. Throughout the roof, let a be fixed with gcda, ) =. We define log N if ex 0.5 logn log log N ), 2 log u = log if < ex 0.5 logn log log N ). log log
5 Congruences and Exonential Sums with the Euler Function 5 We also define a smoothness bound K = N /u. Note that K 2/3 and u K /2 for sufficiently large values of N, and that u as N. Let E be the set of integers n [, N] such that n is K-smooth. Since all of the conditions of Lemma 2. hold, we have l P[K,N /2 ] K<n N l 2 n #E Nu u+ou). Next, let E 2 be the set of integers n [, N] such that Pn) > K and Pn) 2 n. Then #E 2 k 2 N/K. l P[K,N /2 ] N/l 2 N k>k Now define N = {,..., N}\ E E 2 ). Using the results above, we obtain that T a, N) Nu u+ou) + N/K +. ϕn) a mod ) Since every n N can be exressed in the form n = lm with l P[K, N/m] and gcdl, m) =, and since gcda, ) =, it follows that, l P[K,N/m] l a m mod ) ϕn) a mod ) <m N/K l P[K,N/m] ϕm) 0 mod ) l a m mod ) where a m + aϕm) mod ). By Lemma 2.2, N m log2n/m) since K 2/3. Hence, Therefore ϕn) a mod ) N logk <m N/K N m log2k/) N m logk, m N logn/k) log K < Nu. T a, N) Nu u+ou) + N/K + Nu/. Because K 2/3, we see that the second term never dominates, and the result follows. The bound 2.3) suggests that when is very small relative to N, one might exect that T a, N) = on/). By refining the arguments in Theorem 3. in order to make use of 2.3), we show that this is indeed the case in the following quantitative form: Theorem 3.2 There exists an absolute constant C > 0, such that for the following bound holds: log log N C log log log N, max T a, N) N gcda,)= ex C log log N).
6 6 William D. Banks and Igor E. Sharlinski Proof Without loss of generality, we can assume that as N since otherwise the result follows trivially from 2.3). Let a be fixed with gcda, ) =. Put u = ex0.5c log log N), where c > 0 is the constant from 2.3); by our hyothesis on the size of, we see that u as N. Finally, define the smoothness bound K = N /u. Since u = log N) o), we have that K = exlog N) +o) ), hence u K /2 and K /2 if N is sufficiently large. Proceeding as in Theorem 3. with these choices for u and K, we obtain the estimate T a, N) Nu u+ou) + N/K + N log K <m N/K ϕm) 0 mod ) Using artial summation together with the estimate 2.3), we also have with M = N/K ): Since <m N/K ϕm) 0 mod ) m = M M T 0, M)) + M + we derive the estimate m=3 M m=2 ex c log log m) m + log M) c log N) c. m. m ) m T 0, m)) m + M = + m=3 mlog m) c N log N) c = N log K ex 0.5c log log N), T a, N) Nu u+ou) + NK + N ex 0.5c log log N). Now let C = c/3, and suose that satisfies the hyothesis of the theorem. It is easily seen that Also, K = exlog N) +o) ) ex0.5c log log N). u = ex0.5c log log N) log log N).5 log C + log log N log log log N log, thus and therefore u logu + o)) u/2)logu log u log, The result follows. u u+ou) u = ex 0.5c log log N).
7 Congruences and Exonential Sums with the Euler Function 7 Let us define 4 Congruences with λn) L a, N) = { n N λn) a mod )}, and ut L a, N) = #L a, N). Since the integers λn) and ϕn) always have the same set of rime divisors, it follows that L 0, N) = T 0, N); thus the estimate for T 0, N) in Lemma 2.5 alies to L 0, N) as well. In this section, we combine Theorem 3. with Lemma 2.6 to estimate L a, N) in certain ranges when a 0 mod ). Theorem 4. For ex 3log log N) 3) log N log log log N ex 5log log N) 3 the following bound holds: max L a, N) gcda,)= N ex 0.4w /3 log w) 2/3) + ex 0.5 log loglog ) /3)), where w = log N/ log. Proof Denote hn) = ϕn)/λn). For any η, we have L a, N) + T ah, N) + h<η n L a,n) hn)=h n L a,n) hn) η h<η ), n L a,n) hn) η. Then, rovided that η ex log log N) 3), 4.) Theorem 3. and Lemma 2.6 together imly L a, N) η Nw w/2+ow) + Nw Now ut ) + N ex { η = min w w/4, /2} log η log log η) /3). It follows from the conditions of the theorem that 4.) is satisfied and also that w = o) ; consequently, L a, N) Nη /2+o) + N ex 0.69 log η log log η) /3) N ex 0.69 log η log log η) /3), and the result follows. It is easy to see that one can slightly imrove the constants that occur in the statement of Theorem 4., both in the range secified for and in the bound, but we have not done so in order to rovide a cleaner statement.
8 8 William D. Banks and Igor E. Sharlinski 5 Exonential Sums with ϕn) We now show that the same arguments used in the roof of Theorem 3., combined with the bound of Lemma 2.5, can be used to estimate exonential sums with the Euler function. Theorem 5. The following bound holds: log 4 max S N a, N) N gcda,)= where w = log N/ log. /2 ) + w 2w/5+ow), Proof Without loss of generality, we can assume that log 8 N since the bound is trivial otherwise. In articular, we can assume that is sufficiently large for our uroses. Throughout the roof, fix a with gcda, ) =. We define K = 2.5 and denote by E the set of n [, N] which are K-smooth. Let u = log N log K = 2w/5. It is easy to see that if w /3, then log 3 N and the bound is trivial; thus we can assume that u /2 K /2. By Lemma 2., we have that #E Nu u+ou). Denote by E 2 the set of n [, N] for which Pn) > K and Pn) 2 n. Then #E 2 N/l 2 N/K. l P[K,N] Denote by E 3 the set of n [, N] such that Pn) 2 n and ϕm), where m = n/pn). Since ϕn) for every n E 3, Lemma 2.5 yields the estimate #E 3 N log log N N log. Finally, let N = {,..., N}\ E E 2 E 3 ). From the receding bounds, it follows that S a, N) = )) log e aϕn)) + O N + u u+ou) + K = )) log e aϕn)) + O N + w 2w/5+ow). Now, every integer n N has a unique reresentation of the form n = ml, where l P[K, N], l > Pm), and ϕm). Conversely, if L m = max{k, Pm)}, then for any m N/K such that ϕm) and any l P[L m, N/m], we have n = ml N. Observing that ϕn) = ϕm)l ), we obtain e aϕn)) = e aϕml)) = m N/K ϕm) m N/K ϕm) e aϕm)) e aϕm)l).
9 Congruences and Exonential Sums with the Euler Function 9 Write e aϕm)l) = l P[N/m] e aϕm)l) l P[L m] e aϕm)l), and observe that the right hand side of the bound in Lemma 2.3 is a monotonically increasing function of X. Then it follows that e aϕml)) N /2 + N /4 m /4 /8 + /2 m /2 N /2) log 3 N. m Recalling that m N/K = N 5/2, we see that the first term always dominates the other two. Hence, Therefore, and we obtain the stated result. e aϕn)) N log3 N /2 e aϕml)) N log3 N m /2, N m= m N log4 N, /2 It is easy to see that the bound of Theorem 5. is nontrivial when the conditions log N = o /8 ) and = N o) both hold. We now turn our attention to sums with olynomials f from the class F d, given by 2.), with d 2. As before, we remark that the condition d 2 is imortant, thus Theorem 5. and Theorem 5.2 do not overla. Theorem 5.2 For any ε > 0 and d 2, the following bound holds: max S f, N) N /4+ε + w w/2+ow)), f F d, for log N, where w = log N/ log. Proof We use the same notation as in the roof of Theorem 5. excet that we ut K = 2 ; thus u = log N/ logk = w/2 = K /2. As in the roof of Theorem 5. we obtain S f, N) = = m N/K ϕm) e fϕn))) + O )) log N + u u+ou) + K e fϕm)l ))) + O )) log N + w w/2+ow). It is clear that for each m in the sum above, the olynomial fϕm)x )) F d,. Therefore using Lemma 2.4 instead of Lemma 2.3, as in the roof of Theorem 5., we derive that e fϕm)l ))) 3/6+ε N/m) 25/32 m N/K ϕm) m N/K 3/6+ε NK 7/32 = N /4+ε,
10 0 William D. Banks and Igor E. Sharlinski and we obtain the stated result. Clearly, there are many ossible admissible choices for K and thus a trade-off between the exonent of and w w and the required bottom range of ). 6 Remarks As we have already remarked, our aroach should work in rincile for exonential sums with fϕn)), where f is a olynomial with integer coefficients. Aroriate analogues of Lemma 2.3 can be found in [7,, 2]. It would also be interesting to consider such sums when f is a olynomial with irrational coefficients, however our methods do not seem to extend to this case. One can also fix an integer g of multilicative order t modulo m 2 and consider the rather exotic sums N V m a, g, N) = e m ag ϕn)). n= At least when t is rime, our method, combined with the uer bounds from [] on sums with ag l taken over rimes l, should work in rincile to estimate such sums. It would also be interesting to estimate exonential sums with the Euler function over integers taken from various secial sets S, such as shifted rimes. It would also be interesting to extend our results in another direction, namely to sums with arbitrary integer denominator m. In this case, as well as in the estimate of sums V m a, g, N) for comosite multilicative orders t, one would need an analogue of Lemma 2.5 for arbitrary m. Clearly, roving such an analogue seems ossible, but it requires some additional arguments. The roblem of estimating the number of solutions to the congruence ϕn) a mod m), n N, is an interesting question in its own right, and it certainly deserves more attention. For moduli that are roducts of a fixed number of rimes not necessarily distinct), a generalization of Lemma 2.5 is given in [2]; in fact, it also alies to iterations of the Euler function. In the case where the modulus m is fixed and N is growing, rather detailed information about the distribution of ϕn), n N, in residue classes modulo m can be found in [4, 6, 5]. However, this question remains oen in the general case. We also remark that by Lemma 2 of [4], almost all values of ϕn), n N, are divisible by all rime owers α log log N log log log N. Therefore, for some constant c > 0 and some integer c/log log log N m log N) one has T m 0, N) = N + on). Sums with multilicative characters might also be considered; in rincile, our methods should rovide nontrivial bounds in certain ranges, similar to those of Theorem 5.. Finally, we mention that our methods can be alied to the sum of divisors function σn). However, it is still not clear how to estimate exonential sums with the Carmichael function λn), even given its close relationshi to the Euler function.
11 Congruences and Exonential Sums with the Euler Function References [] W. Banks, A. Conflitti, J. B. Friedlander and I. E. Sharlinski, Exonential sums with Mersenne numbers, Comositio Math., to aear). [2] N. L. Bassily, I. Kátai and M. Wijsmuller, On the rime ower divisors of the iterates of the Euler-φ function, Publ. Math. Debrecen ), [3] E. R. Canfield, P. Erdős and C. Pomerance, On a roblem of Oenheim concerning Factorisatio Numerorum, J. Number Theory, 7 983), 28. [4] T. Dence and C. Pomerance, Euler s function in residue classes, The Ramanujan J ), [5] P. Erdős, A. Granville, C. Pomerance and C. Siro, On the normal behaviour of the iterates of some arithmetic functions, in Analytic Number Theory, Birkhäuser, Boston, 990, [6] K. Ford, S. Konyagin, and C. Pomerance, Residue classes free of values of Euler s function, Number theory in rogress, Zakoane-Kościelisko, 997), Vol. 2, de Gruyter, Berlin, 999, [7] É. Fouvry and P. Michel, Sur certaines sommes d exonentielles sur les nombres remiers, Ann. Sci. École Norm. Su., 3 998), [8] J. B. Friedlander, C. Pomerance and I. E. Sharlinski, Period of the ower generator and small values of Carmichael s function, Math. Com., ), [9] G. Greaves, Sieves in number theory, Sringer-Verlag, Berlin, 200. [0] H. Halberstam and H. E. Richert, Sieve methods, Academic Press, London, 974. [] G. Harman, Trigonometric sums over rimes, I, Mathematika, 28 98), [2] G. Harman, Trigonometric sums over rimes, II, Glasgow Math. J., ), [3] A. Hildebrand and G. Tenenbaum, Integers without large rime factors, J. de Théorie des Nombres de Bordeaux, 5 993), [4] F. Luca and C. Pomerance, On some roblems of M akowski Schinzel and Erdős concerning the arithmetical functions ϕ and σ, Colloq. Math., ), 30. [5] W. Narkiewicz, Uniform distribution of sequences of integers in residue classes, Lecture Notes in Math., Vol. 087, Sringer-Verlag, Berlin, 984. [6] R. C. Vaughan, Mean value theorems in rime number theory, J. Lond. Math. Soc., 0 975),
Congruences 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 informationAlmost All Palindromes Are Composite
Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More informationOn Erdős and Sárközy s sequences with Property P
Monatsh Math 017 18:565 575 DOI 10.1007/s00605-016-0995-9 On Erdős and Sárközy s sequences with Proerty P Christian Elsholtz 1 Stefan Planitzer 1 Received: 7 November 015 / Acceted: 7 October 016 / Published
More informationDistribution of Matrices with Restricted Entries over Finite Fields
Distribution of Matrices with Restricted Entries over Finite Fields Omran Ahmadi Deartment of Electrical and Comuter Engineering University of Toronto, Toronto, ON M5S 3G4, Canada oahmadid@comm.utoronto.ca
More informationAliquot sums of Fibonacci numbers
Aliquot sums of Fibonacci numbers Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de Méico C.P. 58089, Morelia, Michoacán, Méico fluca@matmor.unam.m Pantelimon Stănică Naval Postgraduate
More informationAn Estimate For Heilbronn s Exponential Sum
An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined
More information#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS
#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES
C O L L O Q U I U M M A T H E M A T I C U M VOL. * 0* NO. * ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES BY YOUNESS LAMZOURI, M. TIP PHAOVIBUL and ALEXANDRU ZAHARESCU
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
More informationarxiv:math/ v2 [math.nt] 21 Oct 2004
SUMS OF THE FORM 1/x k 1 + +1/x k n MODULO A PRIME arxiv:math/0403360v2 [math.nt] 21 Oct 2004 Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationON THE RESIDUE CLASSES OF (n) MODULO t
#A79 INTEGERS 3 (03) ON THE RESIDUE CLASSES OF (n) MODULO t Ping Ngai Chung Deartment of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts briancn@mit.edu Shiyu Li Det of Mathematics,
More informationarxiv: v1 [math.nt] 11 Jun 2016
ALMOST-PRIME POLYNOMIALS WITH PRIME ARGUMENTS P-H KAO arxiv:003505v [mathnt Jun 20 Abstract We imrove Irving s method of the double-sieve [8 by using the DHR sieve By extending the uer and lower bound
More informationOn Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form.
On Character Sums of Binary Quadratic Forms 2 Mei-Chu Chang 3 Abstract. We establish character sum bounds of the form χ(x 2 + ky 2 ) < τ H 2, a x a+h b y b+h where χ is a nontrivial character (mod ), 4
More informationON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 000-9939XX)0000-0 ON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS WILLIAM D. BANKS AND ASMA HARCHARRAS
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationRepresenting Integers as the Sum of Two Squares in the Ring Z n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment
More informationPrime-like sequences leading to the construction of normal numbers
Prime-like sequences leading to the construction of normal numbers Jean-Marie De Koninck 1 and Imre Kátai 2 Abstract Given an integer q 2, a q-normal number is an irrational number η such that any reassigned
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationErnie Croot 1. Department of Mathematics, Georgia Institute of Technology, Atlanta, GA Abstract
SUMS OF THE FORM 1/x k 1 + + 1/x k n MODULO A PRIME Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu Abstract Using a sum-roduct result
More 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 informationMarch 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011
International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,
More informationOn 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 informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationIMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES
IMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES OHAD GILADI AND ASSAF NAOR Abstract. It is shown that if (, ) is a Banach sace with Rademacher tye 1 then for every n N there exists
More informationCHARACTER SUMS AND CONGRUENCES WITH n!
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 356, Number 12, Pages 5089 5102 S 0002-99470403612-8 Article electronically ublished on June 29, 2004 CHARACTER SUMS AND CONGRUENCES WITH n! MOUBARIZ
More informationSmall Zeros of Quadratic Forms Mod P m
International Mathematical Forum, Vol. 8, 2013, no. 8, 357-367 Small Zeros of Quadratic Forms Mod P m Ali H. Hakami Deartment of Mathematics, Faculty of Science, Jazan University P.O. Box 277, Jazan, Postal
More informationWhen do Fibonacci invertible classes modulo M form a subgroup?
Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales
More informationTHE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS
Annales Univ. Sci. Budaest., Sect. Com. 38 202) 57-70 THE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS J.-M. De Koninck Québec,
More 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 Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001
The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski
More informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
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 informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the
More informationExponential and character sums with Mersenne numbers
Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 652, USA bankswd@missouri.edu John B. Friedlander Dept. of Mathematics, University
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 informationYOUNESS LAMZOURI H 2. The purpose of this note is to improve the error term in this asymptotic formula. H 2 (log log H) 3 ζ(3) H2 + O
ON THE AVERAGE OF THE NUMBER OF IMAGINARY QUADRATIC FIELDS WITH A GIVEN CLASS NUMBER YOUNESS LAMZOURI Abstract Let Fh be the number of imaginary quadratic fields with class number h In this note we imrove
More informationThe sum of digits function in finite fields
The sum of digits function in finite fields Cécile Dartyge, András Sárközy To cite this version: Cécile Dartyge, András Sárközy. The sum of digits function in finite fields. Proceedings of the American
More informationMATH342 Practice Exam
MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice
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 informationExplicit Bounds for the Sum of Reciprocals of Pseudoprimes and Carmichael Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 20 207), Article 7.6.4 Exlicit Bounds for the Sum of Recirocals of Pseudorimes and Carmichael Numbers Jonathan Bayless and Paul Kinlaw Husson University College
More informationAlgebraic number theory LTCC Solutions to Problem Sheet 2
Algebraic number theory LTCC 008 Solutions to Problem Sheet ) Let m be a square-free integer and K = Q m). The embeddings K C are given by σ a + b m) = a + b m and σ a + b m) = a b m. If m mod 4) then
More informationarxiv:math/ v2 [math.nt] 10 Oct 2009
On certain arithmetic functions involving exonential divisors arxiv:math/0610274v2 [math.nt] 10 Oct 2009 László Tóth Pécs, Hungary Annales Univ. Sci. Budaest., Sect. Com., 24 2004, 285-294 Abstract The
More informationMATH 361: NUMBER THEORY EIGHTH LECTURE
MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More 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 informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
More information#A6 INTEGERS 15A (2015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I. Katalin Gyarmati 1.
#A6 INTEGERS 15A (015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I Katalin Gyarmati 1 Deartment of Algebra and Number Theory, Eötvös Loránd University and MTA-ELTE Geometric and Algebraic Combinatorics
More informationON THE SET a x + b g x (mod p) 1 Introduction
PORTUGALIAE MATHEMATICA Vol 59 Fasc 00 Nova Série ON THE SET a x + b g x (mod ) Cristian Cobeli, Marian Vâjâitu and Alexandru Zaharescu Abstract: Given nonzero integers a, b we rove an asymtotic result
More informationarxiv:math/ v1 [math.nt] 5 Apr 2006
arxiv:math/0604119v1 [math.nt] 5 Ar 2006 SUMS OF ARITHMETIC FUNCTIONS OVER VALUES OF BINARY FORMS R. DE LA BRETÈCHE AND T.D. BROWNING Abstract. Given a suitable arithmetic function h : N R 0, and a binary
More informationGENERALIZING THE TITCHMARSH DIVISOR PROBLEM
GENERALIZING THE TITCHMARSH DIVISOR PROBLEM ADAM TYLER FELIX Abstract Let a be a natural number different from 0 In 963, Linni roved the following unconditional result about the Titchmarsh divisor roblem
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationp-adic Measures and Bernoulli Numbers
-Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationπ(x) π( x) = x<n x gcd(n,p)=1 The sum can be extended to all n x, except that now the number 1 is included in the sum, so π(x) π( x)+1 = n x
Math 05 notes, week 7 C. Pomerance Sieving An imortant tool in elementary/analytic number theory is sieving. Let s begin with something familiar: the sieve of Ertatosthenes. This is usually introduced
More informationSmooth Values of Shifted Primes in Arithmetic Progressions
Smooth Values of Shifted Primes in Arithmetic Progressions William D. Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Asma Harcharras Department
More informationHOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH
HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH 1. Section 2.1, Problems 5, 8, 28, and 48 Problem. 2.1.5 Write a single congruence that is equivalent to the air of congruences x 1 mod 4 and x 2
More informationNumber Theory Naoki Sato
Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO
More informationBEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO
BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationNumber Theoretic Designs for Directed Regular Graphs of Small Diameter
Number Theoretic Designs for Directed Regular Graphs of Small Diameter William D. Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Alessandro Conflitti
More informationJARED DUKER LICHTMAN AND CARL POMERANCE
THE ERDŐS CONJECTURE FOR PRIMITIVE SETS JARED DUKER LICHTMAN AND CARL POMERANCE Abstract. A subset of the integers larger than is rimitive if no member divides another. Erdős roved in 935 that the sum
More informationOn the Greatest Prime Divisor of N p
On the Greatest Prime Divisor of N Amir Akbary Abstract Let E be an ellitic curve defined over Q For any rime of good reduction, let E be the reduction of E mod Denote by N the cardinality of E F, where
More informationINTRODUCTORY LECTURES COURSE NOTES, One method, which in practice is quite effective is due to Abel. We start by taking S(x) = a n
INTRODUCTORY LECTURES COURSE NOTES, 205 STEVE LESTER AND ZEÉV RUDNICK. Partial summation Often we will evaluate sums of the form a n fn) a n C f : Z C. One method, which in ractice is quite effective is
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More 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 informationTAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS
#A4 INTEGERS 8 (208) TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS Akhilesh P. IV Cross Road, CIT Camus,Taramani, Chennai, Tamil Nadu, India akhilesh.clt@gmail.com O. Ramaré 2 CNRS / Institut de Mathématiques
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More informationON SETS OF INTEGERS WHICH CONTAIN NO THREE TERMS IN GEOMETRIC PROGRESSION
ON SETS OF INTEGERS WHICH CONTAIN NO THREE TERMS IN GEOMETRIC PROGRESSION NATHAN MCNEW Abstract The roblem of looing for subsets of the natural numbers which contain no 3-term arithmetic rogressions has
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More informationarxiv: v4 [math.nt] 11 Oct 2017
POPULAR DIFFERENCES AND GENERALIZED SIDON SETS WENQIANG XU arxiv:1706.05969v4 [math.nt] 11 Oct 2017 Abstract. For a subset A [N], we define the reresentation function r A A(d := #{(a,a A A : d = a a }
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationBOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia
GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive
More informationApplicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS
Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi
More informationON FREIMAN S 2.4-THEOREM
ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained
More informationDIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions
DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS ANG LI Abstract. Dirichlet s theorem states that if q and l are two relatively rime ositive integers, there are infinitely many rimes of the
More informationWhen do the Fibonacci invertible classes modulo M form a subgroup?
Annales Mathematicae et Informaticae 41 (2013). 265 270 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Alications Institute of Mathematics and Informatics, Eszterházy
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationChapter 3. Number Theory. Part of G12ALN. Contents
Chater 3 Number Theory Part of G12ALN Contents 0 Review of basic concets and theorems The contents of this first section well zeroth section, really is mostly reetition of material from last year. Notations:
More informationON THE LEAST QUADRATIC NON-RESIDUE. 1. Introduction
ON THE LEAST QUADRATIC NON-RESIDUE YUK-KAM LAU AND JIE WU Abstract. We rove that for almost all real rimitive characters χ d of modulus d, the least ositive integer n χd at which χ d takes a value not
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem on Arithmetic Progressions Thai Pham Massachusetts Institute of Technology May 2, 202 Abstract In this aer, we derive a roof of Dirichlet s theorem on rimes in arithmetic rogressions.
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,
More informationarxiv: v5 [math.gm] 6 Oct 2018
Primes In Arithmetic Progressions And Primitive Roots N. A. Carella arxiv:70.0388v5 [math.gm] 6 Oct 208 Abstract: Let x be a large number, and let a < q be integers such that gcd(a,q) and q O(log c ) with
More informationUniversity of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10.
Booker, A. R., & Pomerance, C. (07). Squarefree smooth numbers and Euclidean rime generators. Proceedings of the American Mathematical Society, 45(), 5035-504. htts://doi.org/0.090/roc/3576 Peer reviewed
More informationCompositions with the Euler and Carmichael Functions
Compositions with the Euler and Carmichael Functions William D. Banks Department of Mathematics University of Missouri Columbia, MO 652, USA bbanks@math.missouri.edu Florian Luca Instituto de Matemáticas
More informationOn the Diophantine Equation x 2 = 4q n 4q m + 9
JKAU: Sci., Vol. 1 No. 1, : 135-141 (009 A.D. / 1430 A.H.) On the Diohantine Equation x = 4q n 4q m + 9 Riyadh University for Girls, Riyadh, Saudi Arabia abumuriefah@yahoo.com Abstract. In this aer, we
More informationarxiv:math/ v1 [math.nt] 3 Dec 2004
arxiv:math/0412079v1 [math.nt] 3 Dec 2004 PRIMITIVE DIVISORS OF QUADRATIC POLYNOMIAL SEQUENCES G. EVEREST, S. STEVENS, D. TAMSETT AND T. WARD Abstract. We consider rimitive divisors of terms of integer
More informationarxiv: v2 [math.nt] 9 Oct 2018
ON AN EXTENSION OF ZOLOTAREV S LEMMA AND SOME PERMUTATIONS LI-YUAN WANG AND HAI-LIANG WU arxiv:1810.03006v [math.nt] 9 Oct 018 Abstract. Let be an odd rime, for each integer a with a, the famous Zolotarev
More informationHASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES
HASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES AHMAD EL-GUINDY AND KEN ONO Astract. Gauss s F x hyergeometric function gives eriods of ellitic curves in Legendre normal form. Certain truncations of this
More informationPETER J. GRABNER AND ARNOLD KNOPFMACHER
ARITHMETIC AND METRIC PROPERTIES OF -ADIC ENGEL SERIES EXPANSIONS PETER J. GRABNER AND ARNOLD KNOPFMACHER Abstract. We derive a characterization of rational numbers in terms of their unique -adic Engel
More informationDiophantine Equations and Congruences
International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,
More informationTHE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4
THE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4 PAUL POLLACK Abstract For all rimes 5, there is a rime quadratic nonresidue q < with q 3 (mod 4 For all rimes 3, there is a rime
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationThe Euler Phi Function
The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the
More information1 Integers and the Euclidean algorithm
1 1 Integers and the Euclidean algorithm Exercise 1.1 Prove, n N : induction on n) 1 3 + 2 3 + + n 3 = (1 + 2 + + n) 2 (use Exercise 1.2 Prove, 2 n 1 is rime n is rime. (The converse is not true, as shown
More informationPractice Final Solutions
Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written
More information