On the number of cyclic subgroups of a finite Abelian group
|
|
- Charity Norton
- 5 years ago
- Views:
Transcription
1 Bull. Math. Soc. Sci. Math. Roumanie Tome 55103) No. 4, 2012, On the number of cyclic subgroups of a finite Abelian group by László Tóth Abstract We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative properties of related counting functions for finite Abelian groups are immediate consequences of these formulae. Key Words: Finite Abelian group, cyclic subgroup, order of elements, multiplicative arithmetic function Mathematics Subject Classification: Primary 20K01, 20K27, Secondary 11A25. 1 Introduction Consider an arbitrary finite Abelian group G of order #G > 1. Let c G) and cg) denote the number of cyclic subgroups of order #G) and the number of all cyclic subgroups of G, respectively. Let #G = p a1 1 par r be the prime power factorization of #G and let G G 1 G r be the primary decomposition of the group G, where #G i = p ai i 1 i r). Furthermore, let LG) and LG i ) denote the subgroup lattices of G and G i 1 i r), respectively. It is known the lattice isomorphism LG) LG 1 ) LG r ). See R. Schmidt [7], M. Suzuki [10]. It follows that c G) = c 1 G 1 ) c r G r ), 1) where = 1 r and i = p bi i with some exponents b i a i 1 i r). Also, cg) = cg 1 ) cg r ). 2) Consider now a p-group G p) of type λ 1,..., λ k ) with 1 λ 1... λ k. It is known that the number of cyclic subgroups of order p ν of G p) is c p ν G p) ) = pk jν 1 p λ0+λ1+...+λjν +k jν 1)ν 1), 3) p 1 The author gratefully acknowledges support from the Austrian Science Fund FWF) under the project Nr. M1376-N18.
2 424 László Tóth where λ jν < ν λ jν+1 and λ 0 = 0. See G. A. Miller [6], Y. Yeh [13]. For every finite Abelian group G the value of c G) is therefore completely determined by formulae 1) and 3). Obviously, cg) = #G c G), leading to a formula for cg). Recently, formula 3) was recovered by M. Tărnăuceanu [11, Th. 4.3], in a slightly different form, by a method based on properties of certain matrices attached to the invariant factor decomposition of an Abelian group G, i.e., G C i1 C is, where i 1 i s = #G, i 1 i 2... i s, C k denoting the cyclic group of order k. For arbitrary positive integers r, n 1,..., n r consider in what follows the direct product C n1 C nr and denote by cn 1,..., n r ) the number of its cyclic subgroups. Let φ denote Euler s function. Theorem 1. For any n 1,..., n r 1, cn 1,..., n r ) is given by the formula φd 1 ) φd r ) cn 1,..., n r ) = φlcmd 1,..., d r )). 4) Formula 4) was derived in [12] using the orbit counting lemma Burnside s lemma). Consequently, the number of all cyclic subgroups of a finite Abelian group can be given by formula 4) in a more compact form. Namely, consider the invariant factor decomposition of G given above and apply 4) by selecting r = s and n 1 = i 1,..., n s = i s. Note that 4) can be used also starting with the primary decomposition of G. In the case r = 2, by using the identity φd 1 )φd 2 ) = φgcdd 1, d 2 ))φlcmd 1, d 2 )) d 1, d 2 1) we deduce from 4) the next result: Corollary 1. For every n 1, n 2 1 the number of cyclic subgroups of C n1 C n2 is cn 1, n 2 ) = φgcdd 1, d 2 )). 5) d 1 n 1,d 2 n 2 It is the purpose of the present paper to give another direct proof of Theorem 1, using simple number-theoretic arguments. In fact, we prove the following formulae concerning the number o n 1,..., n r ) of elements of order in C n1 C nr. Let n := lcmn 1,..., n r ). Obviously, the order of every element of the direct product is a divisor of n. Let µ be the Möbius function. Theorem 2. For every n 1,..., n r 1 and every n, o n 1,..., n r ) = e gcde, n 1 ) gcde, n r )µ/e) 6) = φd 1 ) φd r ). 7) lcmd 1,...,d r)= Let c n 1,..., n r ) denote the number of cyclic subgroups of order n) of the group C n1 C nr. Since a cyclic subgroup of order has φ) generators, c n 1,..., n r ) = o n 1,..., n r ). 8) φ) Now 4) follows immediately from 7) and 8) by cn 1,..., n r ) = n c n 1,..., n r ).
3 On the number of cyclic subgroups 425 Corollary 2. For every prime p and every a 1,..., a r 1, 1 ν maxa 1,..., a r ), 1 c p ν p a1,..., p ar ) = p ν 1 p minν,a1)+...+minν,ar) p minν 1,a1)+...+minν 1,ar)). 9) p 1) Here 9) follows at once by 6). In case of a p-group of type λ 1,..., λ k ) and choosing r = k, a 1 = λ 1,..., a k = λ k, 9) reduces to 3). The proof of Theorem 2 is contained in Section 2. Additional remarks are given in Section 3. We point out, among others, that the multiplicative properties 1) and 2) are direct consequences of the formulae included in Theorems 1 and 2. 2 Proof of Theorem 2 Let ox) denote the order of a group element x. Let G = C n1 C nr in short. Let x i C ni such that ox i ) = n i 1 i r). Then G = {x = x i1 1,..., xir r ) : 1 i 1 n 1,..., 1 i r n r }. Using elementary properties of the order of elements in a group and of the gcd and lcm of integers, respectively we deduce that for every x = x i1 1,..., xir r ) G, ) ox ox) = lcmox i1 1 ) 1 ),..., oxir r )) = lcm gcdox 1 ), i 1 ),..., ox r ) gcdox r ), i r ) ) ) n 1 = lcm gcdn 1, i 1 ),..., n r n = lcm gcdn r, i r ) gcdn, i 1 n/n 1 ),..., n gcdn, i r n/n r ) n = gcdi 1 n/n 1,..., i r n/n r, n). Assume that ox) =, where n is fixed. Then gcdi 1 n/n 1,..., i r n/n r, n) = n/. Write i 1 n/n 1 = j 1 n/,..., i r n/n r = j r n/. Then gcdj 1,..., j r, ) = 1 and j 1 = i 1 /n 1,..., j r = i r /n r are integers, that is i 1 0 mod n 1 ),..., i r 0 mod n r ). We obtain, as solutions of these linear congruences, that i 1 = k 1 n 1 / gcd, n 1 ) with 1 k 1 gcd, n 1 ),..., i r = k r n r / gcd, n r ) with 1 k r gcd, n r ). Therefore, the number of elements of order in G is the number of ordered r-tuples k 1,..., k r ) satisfying the conditions i) 1 k 1 gcd, n 1 ),..., 1 k r gcd, ) n r ) and ii) gcd k 1 gcd,n,..., k 1) r gcd,n, r) = 1. Using the familiar formula d n µd) = 1 for n = 1 and 0 otherwise, this can be written as o n 1,..., n r ) = µe) 1. e k 1 gcd,n 1) gcd,n 1) Here the linear congruence k 1 e), and mod gcd, n 1 )) it has exactly gcd e, gcd, n 1 ) e gcd, n 1 ) e k 1 gcd,n 1 ) 0 mod e) has gcde, ) k r gcd,n r) e k r gcd,nr ) gcd,n 1) ) solutions in k 1 mod = gcd gcd, n 1 ), ) ) = gcd e e, n 1
4 426 László Tóth solutions similar for the indexes 2,..., r). Hence, o n 1,..., n r ) = e µe) gcd/e, n 1 ) gcd/e, n r ) = e µ/e) gcde, n 1 ) gcde, n r ), which is formula 6). Now using the identity d n φd) = n, o n 1,..., n r ) = e = µ/e) d 1 gcde,n 1) φd 1 ) φd r ) φd 1 ) ab lcmd 1,...,d r)= d r gcde,n r) µa), φd r ) where the inner sum is 0 unless lcmd 1,..., d r ) =, and in this case it is 1. This gives 7). The proof of Theorem 2 is complete. 3 Remarks The function cn 1,..., n r ) is representing a multiplicative function of r variables, i.e., cn 1 m 1,..., n r m r ) = cn 1,..., n r )cm 1,..., m r ) 10) holds for any n 1,..., n r, m 1,..., m r 1 such that gcdn 1 n r, m 1 m r ) = 1. Therefore, cn 1,..., n r ) = p cp epn1),..., p epnr) ), where n i = p pepni) is the prime power factorization of n i, the product being over the primes p and all but a finite number of the exponents e p n i ) are zero 1 i r). The property 10) follows by the next simple number-theoretic argument: According to 4), φn1) φnr) φlcmn 1,...,n r)) with cn 1,..., n r ) is the r variables convolution of the function n 1,..., n r ) the constant 1 function, both multiplicative. Since convolution preserves the multiplicativity we deduce that cn 1,..., n r ) is multiplicative, too. See [12, Section 2] for details. Also, let n 1,..., n r, m 1,..., m r 1 such that gcdn 1 n r, m 1 m r ) = 1. Let n := lcmn 1,..., n r ), m := lcmm 1,..., m r ). For nm write = ab with a n, b m which are unique). Then, c n 1 m 1,..., n r m r ) = c a n 1,..., n r )c b m 1,..., m r ), 11) which follows from 6) by a short computation. Now, 10) and 11) show the validity of 2) and 1) quoted in the Introduction. Let An 1,..., n r ) denote the arithmetic mean of the orders of elements in C n1 C nr. From 7) we deduce
5 On the number of cyclic subgroups 427 Corollary 3. For every n 1,..., n r 1, 1 An 1,..., n r ) = φd 1 ) φd r ) lcmd 1,..., d r ). n 1 n r The function n 1,..., n r ) An 1,..., n r ) is also multiplicative. properties of the average of orders of elements in finite Abelian groups. Consider the special case n 1 =... = n r = n. According to 6), See [1, 2] for further o n,..., n) = e e r µ/r) = φ r ) 12) is the Jordan function of order r. Note that φ 1 ) = φ) is Euler s function. This means that the number of elements of order n) in the direct product C n C n, with r factors, is φ r ) = r p 1 1/pr ). This is a less known group-theoretic interpretation of the Jordan function. See G. A. Miller [4, 5], J. Schulte [8, Th. 7]. Hence the number of cyclic subgroups of order n) of the group C n C n, with r factors, is φ r )/φ). Note that the function k φ r k)/k r 2 φk)) = k p k 1+1/p+1/p /p r 1 ) r 2) was considered quite recently in [9], in connection with Robin s inequality and the Riemann hypothesis. As a byproduct we obtain from 7) and 12) that for every positive integer, φd 1 ) φd r ) = φ r ), 13) lcmd 1,...,d r)= where the sum is over all ordered r-tuples d 1,..., d r ) such that lcmd 1,..., d r ) =. The function in the left hand side of 13) is the von Sterneck function, cf. [3, p. 14]. A final remark: The number sn 1, n 2 ) of all subgroups of the group C n1 C n2 is given by sn 1, n 2 ) = gcdd 1, d 2 ) n 1, n 2 1). 14) d 1 n 1,d 2 n 2 Compare 14) to 5). A proof of 14) will be presented elsewhere. References [1] J. von zur Gathen, A. Knopfmacher, F. Luca, L. G. Lucht, I. E. Shparlinski, Average order in cyclic groups, J. Théor. Nombres Bordeaux, ), [2] F. Luca, I. E. Shparlinski, Average multiplicative orders of elements modulo n, Acta Arith., ), [3] P. J. McCarthy, Introduction to Arithmetical Functions, Springer, [4] G. A. Miller, On the totitives of different orders, Amer. Math. Monthly, ),
6 428 László Tóth [5] G. A. Miller, Some relations between number theory and group theory, American J. Math., ), [6] G. A. Miller, Number of the subgroups of any given Abelian group, Proc. Nat. Acad. Sci. U.S.A., ), [7] R. Schmidt, Subgroup Lattices of Groups, de Gruyter Expositions in Mathematics 14, de Gruyter, Berlin, [8] J. Schulte, Über die Jordansche Verallgemeinerung der Eulerschen Funktion, Results Math., ), [9] P. Solé, M. Planat, The Robin inequality for 7-free integers, Integers, ), Article A65, 8 pp. [10] M. Suzuki, On the lattice of subgroups of finite groups, Trans. Amer. Math. Soc., ), [11] M. Tărnăuceanu, An arithmetic method of counting the subgroups of a finite abelian group, Bull. Math. Soc. Sci. Math. Roumanie N.S.), 53101) 2010), [12] L. Tóth, Menon s identity and arithmetical sums representing functions of several variables, Rend. Sem. Mat. Univ. Politec. Torino, ), [13] Y. Yeh, On prime power Abelian groups, Bull. Amer. Math. Soc., ), Received: , Revised: , Accepted: Institute of Mathematics, Department of Integrative Biology, Universität für Bodenkultur, Gregor Mendel-Straße 33, A-1180 Wien, Austria and Department of Mathematics, University of Pécs, Ifjúság u. 6, H-7624 Pécs, Hungary ltoth@gamma.ttk.pte.hu
SUBGROUPS OF FINITE ABELIAN GROUPS HAVING RANK TWO VIA GOURSAT S LEMMA. 1. Introduction
t m Mathematical Publications DOI: 10.2478/tmmp-2014-0021 Tatra Mt. Math. Publ. 59 (2014, 93 103 SUBGROUPS OF FINITE ABELIAN GROUPS HAVING RANK TWO VIA GOURSAT S LEMMA László Tóth ABSTRACT. Using Goursat
More informationON THE SUBGROUPS OF FINITE ABELIAN GROUPS OF RANK THREE
Annales Univ. Sci. Budapest., Sect. Comp. 39 (2013) 111 124 ON THE SUBGROUPS OF FINITE ABELIAN GROUPS OF RANK THREE Mario Hampejs (Wien, Austria) László Tóth (Wien, Austria and Pécs, Hungary) Dedicated
More informationarxiv: v3 [math.gr] 13 Feb 2015
Subgroups of finite abelian groups having rank two via Goursat s lemma arxiv:1312.1485v3 [math.gr] 13 Feb 2015 László Tóth Tatra Mt. Math. Publ. 59 (2014), 93 103 Abstrt Using Goursat s lemma for groups,
More informationOn the subgroups of the group Z m Z n
On the subgroups of the group Z m Z n Mario Hampejs, Nicki Holighaus, László Tóth and Christoph Wiesmeyr Abstract We discuss properties of the subgroups of the group Z m Z n, where m and n are arbitrary
More informationarxiv: v2 [math.nt] 17 Jul 2012
Sums of products of Ramanujan sums László Tóth arxiv:1104.1906v2 [math.nt] 17 Jul 2012 Department of Mathematics, University of Pécs Ifjúság u. 6, H-7624 Pécs, Hungary and Institute of Mathematics, Department
More informationOn the number of diamonds in the subgroup lattice of a finite abelian group
DOI: 10.1515/auom-2016-0037 An. Şt. Univ. Ovidius Constanţa Vol. 24(2),2016, 205 215 On the number of diamonds in the subgroup lattice of a finite abelian group Dan Gregorian Fodor and Marius Tărnăuceanu
More information1. Motivation and main result
TAIWANESE JOURNAL OF MATHEMATICS Vol. xx, No. x, pp. 1 5, xx 20xx DOI: 10.11650/tjm/180904 Short Proof and Generalization of a Menon-type Identity by Li, Hu and Kim László Tóth Abstract. We present a simple
More informationFinite groups determined by an inequality of the orders of their elements
Publ. Math. Debrecen 80/3-4 (2012), 457 463 DOI: 10.5486/PMD.2012.5168 Finite groups determined by an inequality of the orders of their elements By MARIUS TĂRNĂUCEANU (Iaşi) Abstract. In this note we introduce
More informationA survey of the alternating sum-of-divisors function
Acta Univ. Sapientiae, Mathematica, 5, 1 (2013) 93 107 A survey of the alternating sum-of-divisors function László Tóth Universität für Bodenkultur, Institute of Mathematics Department of Integrative Biology
More informationON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul...,..., f... DOI: 10.2478/aicu-2013-0013 ON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS BY MARIUS TĂRNĂUCEANU and
More informationAn arithmetic method of counting the subgroups of a finite abelian group
arxiv:180512158v1 [mathgr] 21 May 2018 An arithmetic method of counting the subgroups of a finite abelian group Marius Tărnăuceanu October 1, 2010 Abstract The main goal of this paper is to apply the arithmetic
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationTHE FOURIER TRANSFORM OF FUNCTIONS OF THE GREATEST COMMON DIVISOR. Wolfgang Schramm Schulgasse 62 / 11, A-1180 Vienna, AUSTRIA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A50 THE FOURIER TRANSFORM OF FUNCTIONS OF THE GREATEST COMMON DIVISOR Wolfgang Schramm Schulgasse 62 / 11, A-1180 Vienna, AUSTRIA
More informationFinite groups determined by an inequality of the orders of their subgroups
Finite groups determined by an inequality of the orders of their subgroups Tom De Medts Marius Tărnăuceanu November 5, 2007 Abstract In this article we introduce and study two classes of finite groups
More informationA generalization of the Euler s totient function
arxiv:1312.1428v1 [math.gr] 5 Dec 2013 A generalization of the Euler s totient function Marius Tărnăuceanu December 5, 2013 Abstract The main goal of this paper is to provide a group theoretical generalization
More informationA Note on Subgroup Coverings of Finite Groups
Analele Universităţii de Vest, Timişoara Seria Matematică Informatică XLIX, 2, (2011), 129 135 A Note on Subgroup Coverings of Finite Groups Marius Tărnăuceanu Abstract. In this note we determine the finite
More informationON THE SUBGROUP LATTICE OF AN ABELIAN FINITE GROUP
ON THE SUBGROUP LATTICE OF AN ABELIAN FINITE GROUP Marius Tărnăuceanu Faculty of Mathematics Al.I. Cuza University of Iaşi, Romania e-mail: mtarnauceanu@yahoo.com The aim of this paper is to give some
More informationarxiv: v1 [math.nt] 3 May 2017
arxiv:1705.01363v1 [math.nt] 3 May 2017 Expansions of arithmetic functions of several variables with respect to certain modified unitary Ramanujan sums László Tóth Department of Mathematics, University
More informationNILPOTENT NUMBERS JONATHAN PAKIANATHAN AND KRISHNAN SHANKAR
NILPOTENT NUMBERS JONATHAN PAKIANATHAN AND KRISHNAN SHANKAR Introduction. One of the first things we learn in abstract algebra is the notion of a cyclic group. For every positive integer n, we have Z n,
More informationGeneralized GCD matrices
Acta Univ Sapientiae, Mathematica, 2, 2 (2010) 160 167 Generalized GCD matrices Antal Bege Sapientia Hungarian University of Transylvania Department of Mathematics and Informatics, Târgu Mureş, Romania
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
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 informationarxiv: v1 [math.gr] 18 Dec 2017
Probabilistic aspects of ZM-groups arxiv:7206692v [athgr] 8 Dec 207 Mihai-Silviu Lazorec Deceber 7, 207 Abstract In this paper we study probabilistic aspects such as (cyclic) subgroup coutativity degree
More informationPascal s Triangle, Normal Rational Curves, and their Invariant Subspaces
Europ J Combinatorics (2001) 22, 37 49 doi:101006/euc20000439 Available online at http://wwwidealibrarycom on Pascal s Triangle, Normal Rational Curves, and their Invariant Subspaces JOHANNES GMAINER Each
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationCommunications in Algebra Publication details, including instructions for authors and subscription information:
This article was downloaded by: [Professor Alireza Abdollahi] On: 04 January 2013, At: 19:35 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationMath 103A Fall 2012 Exam 2 Solutions
Math 103A Fall 2012 Exam 2 Solutions November 14, 2012 NAME: Solutions Problem 1 /10 Problem 2 /10 Problem 3 /10 Problem 4 /10 Total /40 1 Problem 1 (10 points) Consider the element α = (541)(3742)(1265)
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] For
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 informationSOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE
SOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE Abstract. We provide irreducibility criteria for multivariate
More informationA Generalization of the Gcd-Sum Function
2 3 47 6 23 Journal of Integer Sequences, Vol 6 203, Article 367 A Generalization of the Gcd-Sum Function Ulrich Abel, Waqar Awan, and Vitaliy Kushnirevych Fachbereich MND Technische Hochschule Mittelhessen
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationCollatz cycles with few descents
ACTA ARITHMETICA XCII.2 (2000) Collatz cycles with few descents by T. Brox (Stuttgart) 1. Introduction. Let T : Z Z be the function defined by T (x) = x/2 if x is even, T (x) = (3x + 1)/2 if x is odd.
More informationThe least prime congruent to one modulo n
The least prime congruent to one modulo n R. Thangadurai and A. Vatwani September 10, 2010 Abstract It is known that there are infinitely many primes 1 (mod n) for any integer n > 1. In this paper, we
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationAn arithmetic theorem related to groups of bounded nilpotency class
Journal of Algebra 300 (2006) 10 15 www.elsevier.com/locate/algebra An arithmetic theorem related to groups of bounded nilpotency class Thomas W. Müller School of Mathematical Sciences, Queen Mary & Westfield
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 informationREPRESENTING HOMOLOGY AUTOMORPHISMS OF NONORIENTABLE SURFACES
REPRESENTING HOMOLOGY AUTOMORPHISMS OF NONORIENTABLE SURFACES JOHN D. MCCARTHY AND ULRICH PINKALL Abstract. In this paper, we prove that every automorphism of the first homology group of a closed, connected,
More informationImplications of the index of a fixed point subgroup
Rend. Sem. Mat. Univ. Padova, DRAFT, 1 7 Implications of the index of a fixed point subgroup Erkan Murat Türkan ( ) Abstract Let G be a finite group and A Aut(G). The index G : C G (A) is called the index
More informationMATH 420 FINAL EXAM J. Beachy, 5/7/97
MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION
ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION PAVEL RŮŽIČKA 9.1. Congruence modulo n. Let us have a closer look at a particular example of a congruence relation on
More informationLecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG)
Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG) Warm up: 1. Let n 1500. Find all sequences n 1 n 2... n s 2 satisfying n i 1 and n 1 n s n (where s can vary from sequence to
More informationAN ESTIMATE FOR THE LENGTH OF AN ARITHMETIC PROGRESSION THE PRODUCT OF WHOSE TERMS IS ALMOST SQUARE 1. INTRODUCTION
AN ESTIMATE FOR THE LENGTH OF AN ARITHMETIC PROGRESSION THE PRODUCT OF WHOSE TERMS IS ALMOST SQUARE SHANTA LAISHRAM ABSTRACT. Erdős conjectured that ( n(n + d (n + ( d = y in positive integers n,, d >,
More informationReciprocals of the Gcd-Sum Functions
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article.8.3 Reciprocals of the Gcd-Sum Functions Shiqin Chen Experimental Center Linyi University Linyi, 276000, Shandong China shiqinchen200@63.com
More informationProducts of Factorials Modulo p
Products of Factorials Modulo p Florian Luca and Pantelimon Stănică IMATE, UNAM, Ap. Postal 6-3 Xangari, CP. 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx Auburn University Montgomery,
More informationAn Elementary Proof that any Natural Number can be Written as the Sum of Three Terms of the Sequence n2
1 47 6 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.6 An Elementary Proof that any Natural Number can be Written as the Sum of Three Terms of the Sequence n Bakir Farhi Department of Mathematics
More informationOn extremal product-one free sequences and weighted Davenport constants
On extremal product-one free sequences and weighted Davenport constants Conference on Rings and Factorizations Graz, Austria Sávio Ribas Instituto Federal de Minas Gerais (IFMG) - Campus Ouro Preto Ouro
More informationTHE TOTAL NUMBER OF SUBGROUPS OF A FINITE ABELIAN GROUP. Grigore Călugăreanu. Received November 11, 2003
Scientiae Mathematicae Japonicae Online, Vol. 1, (23), 27 217 27 TE TOTAL NMBER OF SBROPS OF A FINITE ABELIAN ROP rigore Călugăreanu Received November 11, 23 Abstract. In this note, steps in order to write
More informationON THE NUMBER OF SUBGROUPS OF A GIVEN EXPONENT IN A FINITE ABELIAN GROUP. Marius Tărnăuceanu and László Tóth
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 101(115) (2017), 121 133 htts://doi.org/10.2298/pim1715121t ON THE NUMBER OF SUBGROUPS OF A GIVEN EXPONENT IN A FINITE ABELIAN GROUP Marius
More informationSUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P
SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let γ(k, p) denote Waring s number (mod p) and δ(k, p) denote the ± Waring s number (mod p). We use
More informationResolving Grosswald s conjecture on GRH
Resolving Grosswald s conjecture on GRH Kevin McGown Department of Mathematics and Statistics California State University, Chico, CA, USA kmcgown@csuchico.edu Enrique Treviño Department of Mathematics
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 informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationExtremal Orders of Certain Functions Associated with Regular Integers (mod n)
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 16 2013), Article 13.7.5 Extremal Orders of Certain Functions Associated with Regular Integers mod n) Brăduţ Apostol Spiru Haret Pedagogical High School
More informationNON-DIVERGENT INFINITELY DISCRETE TEICHMÜLLER MODULAR TRANSFORMATION
NON-DIVERGENT INFINITELY DISCRETE TEICHMÜLLER MODULAR TRANSFORMATION EGE FUJIKAWA AND KATSUHIKO MATSUZAKI Abstract. We consider a classification of Teichmüller modular transformations of an analytically
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
More informationFIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS
FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS LINDSAY N. CHILDS Abstract. Let G = F q β be the semidirect product of the additive group of the field of q = p n elements and the cyclic
More informationϕ : Z F : ϕ(t) = t 1 =
1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical
More informationThe security of RSA (part 1) The security of RSA (part 1)
The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 i.e. q = (n φ(n) + 1)
More informationFORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS
Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ
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 the Frobenius Numbers of Symmetric Groups
Journal of Algebra 221, 551 561 1999 Article ID jabr.1999.7992, available online at http://www.idealibrary.com on On the Frobenius Numbers of Symmetric Groups Yugen Takegahara Muroran Institute of Technology,
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
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 informationTripotents: a class of strongly clean elements in rings
DOI: 0.2478/auom-208-0003 An. Şt. Univ. Ovidius Constanţa Vol. 26(),208, 69 80 Tripotents: a class of strongly clean elements in rings Grigore Călugăreanu Abstract Periodic elements in a ring generate
More informationON ZERO-SUM SUBSEQUENCES OF RESTRICTED SIZE. IV
Acta Math. Hungar. 107 (4) (2005), 337 344. ON ZERO-SUM SUBSEQUENCES OF RESTRICTED SIZE. IV R. CHI, S. DING (Dalian), W. GAO (Tianjin), A. GEROLDINGER and W. A. SCHMID (Graz) Abstract. For a finite abelian
More informationON THE CONSTANT IN BURGESS BOUND FOR THE NUMBER OF CONSECUTIVE RESIDUES OR NON-RESIDUES Kevin J. McGown
Functiones et Approximatio 462 (2012), 273 284 doi: 107169/facm/201246210 ON THE CONSTANT IN BURGESS BOUND FOR THE NUMBER OF CONSECUTIVE RESIDUES OR NON-RESIDUES Kevin J McGown Abstract: We give an explicit
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationElliptic Curves Spring 2013 Lecture #8 03/05/2013
18.783 Elliptic Curves Spring 2013 Lecture #8 03/05/2013 8.1 Point counting We now consider the problem of determining the number of points on an elliptic curve E over a finite field F q. The most naïve
More informationGENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A52 GENERALIZATIONS OF SOME ZERO-SUM THEOREMS Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationJournal of Number Theory
Journal of Number Theory 129 (2009) 2766 2777 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt The critical number of finite abelian groups Michael Freeze
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 informationOn an irreducibility criterion of Perron for multivariate polynomials
Bull. Math. Soc. Sci. Math. Roumanie Tome 53(101) No. 3, 2010, 213 217 On an irreducibility criterion of Perron for multivariate polynomials by Nicolae Ciprian Bonciocat Dedicated to the memory of Laurenţiu
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 informationSquare Roots Modulo p
Square Roots Modulo p Gonzalo Tornaría Department of Mathematics, University of Texas at Austin, Austin, Texas 78712, USA, tornaria@math.utexas.edu Abstract. The algorithm of Tonelli and Shanks for computing
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationSubset sums modulo a prime
ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by
More informationExplicit global function fields over the binary field with many rational places
ACTA ARITHMETICA LXXV.4 (1996) Explicit global function fields over the binary field with many rational places by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. In a series of papers
More informationSmith theory. Andrew Putman. Abstract
Smith theory Andrew Putman Abstract We discuss theorems of P. Smith and Floyd connecting the cohomology of a simplicial complex equipped with an action of a finite p-group to the cohomology of its fixed
More informationGENERATORS OF FINITE FIELDS WITH POWERS OF TRACE ZERO AND CYCLOTOMIC FUNCTION FIELDS. 1. Introduction
GENERATORS OF FINITE FIELDS WITH POWERS OF TRACE ZERO AND CYCLOTOMIC FUNCTION FIELDS JOSÉ FELIPE VOLOCH Abstract. Using the relation between the problem of counting irreducible polynomials over finite
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationISOMORPHISM OF MODULAR GROUP ALGEBRAS OF ABELIAN GROUPS WITH SEMI-COMPLETE p-primary COMPONENTS
Commun. Korean Math. Soc. 22 (2007), No. 2, pp. 157 161 ISOMORPHISM OF MODULAR GROUP ALGEBRAS OF ABELIAN GROUPS WITH SEMI-COMPLETE p-primary COMPONENTS Peter Danchev Reprinted from the Communications of
More informationDIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH
DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete
More informationRANKIN-COHEN BRACKETS AND VAN DER POL-TYPE IDENTITIES FOR THE RAMANUJAN S TAU FUNCTION
RANKIN-COHEN BRACKETS AND VAN DER POL-TYPE IDENTITIES FOR THE RAMANUJAN S TAU FUNCTION B. RAMAKRISHNAN AND BRUNDABAN SAHU Abstract. We use Rankin-Cohen brackets for modular forms and quasimodular forms
More information数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2012), B32:
Imaginary quadratic fields whose ex Titleequal to two, II (Algebraic Number 010) Author(s) SHIMIZU, Kenichi Citation 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (01), B3: 55-69 Issue Date 01-07 URL http://hdl.handle.net/33/19638
More information1 Structure of Finite Fields
T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained
More informationarxiv: v1 [math.nt] 24 Oct 2013
A SUPPLEMENT TO SCHOLZ S RECIPROCITY LAW arxiv:13106599v1 [mathnt] 24 Oct 2013 FRANZ LEMMERMEYER Abstract In this note we will present a supplement to Scholz s reciprocity law and discuss applications
More informationZAREMBA'S CONJECTURE AND SUMS OF THE DIVISOR FUNCTION
mathematics of computation volume 61, number 203 july 1993, pages 171-176 ZAREMBA'S CONJECTURE AND SUMS OF THE DIVISOR FUNCTION T. W. CUSICK Dedicated to the memory ofd. H. Lehmer Abstract. Zaremba conjectured
More informationDepartment of Mathematics, Nanjing University Nanjing , People s Republic of China
Proc Amer Math Soc 1382010, no 1, 37 46 SOME CONGRUENCES FOR THE SECOND-ORDER CATALAN NUMBERS Li-Lu Zhao, Hao Pan Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More information