Handbook of Number Theory Ii

Total Page:16

File Type:pdf, Size:1020Kb

Handbook of Number Theory Ii HANDBOOK OF NUMBER THEORY II by J. Sandor´ Babes¸-Bolyai University of Cluj Department of Mathematics and Computer Science Cluj-Napoca, Romania and B. Crstici formerly the Technical University of Timis¸oara Timis¸oara Romania KLUWER ACADEMIC PUBLISHERS DORDRECHT / BOSTON / LONDON A C.I.P. Catalogue record for this book is available from the Library of Congress. ISBN 1-4020-2546-7 (HB) ISBN 1-4020-2547-5 (e-book) Published by Kluwer Academic Publishers, P.O. Box 17, 3300 AA Dordrecht, The Netherlands. Sold and distributed in North, Central and South America by Kluwer Academic Publishers, 101 Philip Drive, Norwell, MA 02061, U.S.A. In all other countries, sold and distributed by Kluwer Academic Publishers, P.O. Box 322, 3300 AH Dordrecht, The Netherlands. Printed on acid-free paper All Rights Reserved C 2004 Kluwer Academic Publishers No part of this work may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording or otherwise, without written permission from the Publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Printed in the Netherlands. Contents PREFACE 7 BASIC SYMBOLS 9 BASIC NOTATIONS 10 1 PERFECT NUMBERS: OLD AND NEW ISSUES; PERSPECTIVES 15 1.1 Introduction .............................. 15 1.2 Some historical facts ......................... 16 1.3 Even perfect numbers ......................... 20 1.4 Odd perfect numbers ......................... 23 1.5 Perfect, multiperfect and multiply perfect numbers ......... 32 1.6 Quasiperfect, almost perfect, and pseudoperfect numbers ................................ 36 1.7 Superperfect and related numbers .................. 38 1.8 Pseudoperfect, weird and harmonic numbers ............. 42 1.9 Unitary, bi-unitary, infinitary-perfect and related numbers ...... 45 1.10 Hyperperfect, exponentially perfect, integer-perfect and γ -perfect numbers ........................ 50 1.11 Multiplicatively perfect numbers ................... 55 1.12 Practical numbers ........................... 58 1.13 Amicable numbers .......................... 60 1.14 Sociable numbers ........................... 72 References 77 2 GENERALIZATIONS AND EXTENSIONS OF THE MOBIUS¨ FUNCTION 99 2.1 Introduction .............................. 99 1 CONTENTS 2.2 Mobius¨ functions generated by arithmetical products (or convolutions) ........................... 106 1Mobius¨ functions defined by Dirichlet products ....... 106 2 Unitary Mobius¨ functions .................. 110 3 Bi-unitary Mobius¨ function . .............. 111 4Mobius¨ functions generated by regular convolutions .... 112 5 K -convolutions and Mobius¨ functions. B convolution .... 114 6 Exponential Mobius¨ functions . .............. 117 7 l.c.m.-product (von Sterneck-Lehmer) ............ 119 8 Golomb-Guerin convolution and Mobius¨ function ...... 121 9 max-product (Lehmer-Buschman) .............. 122 10 Infinitary convolution and Mobius¨ function ......... 124 11 Mobius¨ function of generalized (Beurling) integers ..... 124 12 Lucas-Carlitz (l-c) product and Mobius¨ functions ...... 125 13 Matrix-generated convolution . .............. 127 2.3 Mobius¨ function generalizations by other number theoretical considerations ............................. 129 1 Apostol’s Mobius¨ function of order k ............ 129 2 Sastry’s Mobius¨ function ................... 130 3Mobius¨ functions of Hanumanthachari and Subrahmanyasastri ...................... 132 4 Cohen’s Mobius¨ functions and totients ............ 134 5 Klee’s Mobius¨ function and totient .............. 135 6Mobius¨ functions of Subbarao and Harris; Tanaka; and Venkataraman and Sivaramakrishnan .......... 136 7Mobius¨ functions as coefficients of the cyclotomic polynomial .......................... 138 2.4 Mobius¨ functions of posets and lattices . .............. 139 1 Introduction, basic results .................. 139 2Factorable incidence functions, applications ......... 143 3Inversion theorems and applications ............. 145 4Mobius¨ functions on Eulerian posets ............. 146 5 Miscellaneous results ..................... 148 2.5 Mobius¨ functions of arithmetical semigroups, free groups, finite groups, algebraic number fields, and trace monoids ...... 148 1Mobius¨ functions of arithmetical semigroups ........ 148 2 Fee abelian groups and Mobius¨ functions .......... 151 3Mobius¨ functions of finite groups .............. 154 2 CONTENTS 4Mobius¨ functions of algebraic number and function-fields ........................ 159 5Trace monoids and Mobius¨ functions ............ 161 References 163 3 THE MANY FACETS OF EULER’S TOTIENT 179 3.1 Introduction .............................. 179 1 The infinitude of primes ................... 180 2 Exact formulae for primes in terms of ϕ ........... 180 3 Infinite series and products involving ϕ,Pillai’s (Cesaro’s)` arithmetic functions .......... 181 4 Enumeration problems on congruences, directed graphs, magic squares .................... 183 5Fourier coefficients of even functions (mod n) ........ 184 6 Algebraic independence of arithmetic functions ....... 185 7 Algebraic and analytic application of totients ........ 186 8 ϕ-convergence of Schoenberg . .............. 187 3.2 Congruence properties of Euler’s totient and related functions .... 188 1 Euler’s divisibility theorem .................. 188 2Carmichael’s function, maximal generalization of Fermat’s theorem ....................... 189 3 Gauss’ divisibility theorem .................. 191 4 Minimal, normal, and average order of Carmichael’s function ............................ 193 5Divisibility properties of iteration of ϕ ............ 195 6 Congruence properties of ϕ and related functions ...... 201 7 Euler’s totient in residue classes . .............. 204 8 Prime totatives ........................ 206 9 The dual of ϕ, noncototients . .............. 208 10 Euler minimum function ................... 210 11 Lehmer’s conjecture, generalizations and extensions .... 212 3.3 Equations involving Euler’s and related totients ........... 216 1 Equations of type ϕ(x + k) = ϕ(x) ............. 216 2 ϕ(x + k) = 2ϕ(x + k) = ϕ(x) + ϕ(k) and related equations ........................... 221 3 Equation ϕ(x) = k,Carmichael’s conjecture ........ 225 4 Equations involving ϕ and other arithmetic functions .... 230 5 The composition of ϕ and other arithmetic functions .... 234 6 Perfect totient numbers and related results .......... 240 3 CONTENTS 3.4 The totatives (or totitives) of a number . .............. 242 1 Historical notes, congruences . .............. 242 2 The distribution of totatives . .............. 246 3 Adding totatives ....................... 248 4 Adding units (mod n) .................... 249 5 Distribution of inverses (mod n) .............. 250 3.5 Cyclotomic polynomials ....................... 251 1 Introduction, irreducibility results .............. 251 2Divisibility properties .................... 253 3 The coefficients of cyclotomic polynomials ......... 256 4 Miscellaneous results ..................... 261 3.6 Matrices and determinants connected with ϕ ............. 263 1 Smith’s determinant ..................... 263 2 Poset-theoretic generalizations . .............. 266 3Factor-closed, gcd-closed, lcm-closed sets, and related determinants ..................... 270 4 Inequalities .......................... 273 3.7 Generalizations and extensions of Euler’s totient ........... 275 1Jordan, Jordan-Nagell, von Sterneck, Cohen-totients .... 275 2 Schemmel, Schemmel-Nagell, Lucas-totients ........ 276 3Ramanujan’s sum ....................... 277 4 Klee’s totient ......................... 278 5 Nagell’s, Adler’s, Stevens’, Kesava Menon’s totients .... 278 6 Unitary, semi-unitary, bi-unitary totients ........... 281 7 Alladi’s totient ........................ 282 8Legendre’s totient ....................... 283 9 Euler totients of meet semilattices and finite fields ..... 285 10 Nonunitary, infinitary, exponential-totients ......... 287 11 Thacker’s, Leudesdorf’s, Lehmer’s, Golubev’s totients. Square totient, core-reduced totient, M-void totient, additive totient ........................ 289 12 Euler totients of arithmetical semigroups, finite groups, algebraic number fields, semigroups, finite commutative rings, finite Dedekind domains . .............. 292 References 295 4 SPECIAL ARITHMETIC FUNCTIONS CONNECTED WITH THE DIVISORS, OR WITH THE DIGITS OF A NUMBER 329 4.1 Introduction .............................. 329 4 CONTENTS 4.2 Special arithmetic functions connected with the divisors of a number .............................. 330 1 Maximum and minimum exponents ............. 330 2 The product of exponents ................... 332 3 Arithmetic functions connected with the prime power factors ............................. 334 4 Other functions; the derived sequence of a number ..... 336 5 The consecutive prime divisors of a number ......... 337 6 The consecutive divisors of an integer ............ 342 7 Functional limit theorems for the consecutive divisors . 343 8 Miscellaneous arithmetic functions connected with divisors ............................ 345 9 Arithmetic functions of consecutive divisors ......... 349 10 Hooley’s function ..................... 360 11 Extensions of the Erdos¨ conjecture (theorem) ........ 363 12 The divisors in residue classes and in intervals ....... 363 13 Divisor density and distribution (mod 1) on divisors .... 366 14 The fractal structure of divisors . .............
Recommended publications
  • Idempotent Factorizations of Square-Free Integers
    information Article Idempotent Factorizations of Square-Free Integers Barry Fagin Department of Computer Science, US Air Force Academy, Colorado Springs, CO 80840, USA; [email protected]; Tel.: +1-719-333-7377 Received: 20 June 2019; Accepted: 3 July 2019; Published: 6 July 2019 Abstract: We explore the class of positive integers n that admit idempotent factorizations n = p¯q¯ such that l(n)¶(p¯ − 1)(q¯ − 1), where l is the Carmichael lambda function. Idempotent factorizations with p¯ and q¯ prime have received the most attention due to their cryptographic advantages, but there are an infinite number of n with idempotent factorizations containing composite p¯ and/or q¯. Idempotent factorizations are exactly those p¯ and q¯ that generate correctly functioning keys in the Rivest–Shamir–Adleman (RSA) 2-prime protocol with n as the modulus. While the resulting p¯ and q¯ have no cryptographic utility and therefore should never be employed in that capacity, idempotent factorizations warrant study in their own right as they live at the intersection of multiple hard problems in computer science and number theory. We present some analytical results here. We also demonstrate the existence of maximally idempotent integers, those n for which all bipartite factorizations are idempotent. We show how to construct them, and present preliminary results on their distribution. Keywords: cryptography; abstract algebra; Rivest–Shamir–Adleman (RSA); computer science education; cryptography education; number theory; factorization MSC: [2010] 11Axx 11T71 1. Introduction Certain square-free positive integers n can be factored into two numbers (p¯, q¯) such that l(n)¶ (p¯ − 1)(q¯ − 1), where l is the Carmichael lambda function.
    [Show full text]
  • The Ray Attack on RSA Cryptosystems’, in R
    The ray attack, an inefficient trial to break RSA cryptosystems∗ Andreas de Vries† FH S¨udwestfalen University of Applied Sciences, Haldener Straße 182, D-58095 Hagen Abstract The basic properties of RSA cryptosystems and some classical attacks on them are described. Derived from geometric properties of the Euler functions, the Euler function rays, a new ansatz to attack RSA cryptosystemsis presented. A resulting, albeit inefficient, algorithm is given. It essentially consists of a loop with starting value determined by the Euler function ray and with step width given by a function ωe(n) being a multiple of the order ordn(e), where e denotes the public key exponent and n the RSA modulus. For n = pq and an estimate r < √pq for the smaller prime factor p, the running time is given by T (e,n,r)= O((r p)lnelnnlnr). − Contents 1 Introduction 1 2 RSA cryptosystem 2 2.1 Properties of an RSA key system . ... 4 2.2 ClassicalRSAattacks. 5 3 The Euler function ray attack 7 3.1 The ω-function and the order of a number modulo n ............... 7 3.2 Properties of composed numbers n = pq ..................... 10 3.3 Thealgorithm................................... 13 arXiv:cs/0307029v1 [cs.CR] 11 Jul 2003 4 Discussion 15 A Appendix 15 A.1 Euler’sTheorem.................................. 15 A.2 The Carmichael function and Carmichael’s Theorem . ......... 16 1 Introduction Since the revolutionary idea of asymmetric cryptosystems was born in the 1970’s, due to Diffie and Hellman [4] and Rivest, Shamir and Adleman [9], public key technology became an in- dispensable part of contemporary electronically based communication.
    [Show full text]
  • On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function
    mathematics Article On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function ŠtˇepánHubálovský 1,* and Eva Trojovská 2 1 Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic 2 Department of Mathematics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic; [email protected] * Correspondence: [email protected] or [email protected]; Tel.: +420-49-333-2704 Received: 3 October 2020; Accepted: 14 October 2020; Published: 16 October 2020 Abstract: Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk ≡ 0 (mod n). In this paper, we shall find all positive solutions of the Diophantine equation z(j(n)) = n, where j is the Euler totient function. Keywords: Fibonacci numbers; order of appearance; Euler totient function; fixed points; Diophantine equations MSC: 11B39; 11DXX 1. Introduction Let (Fn)n≥0 be the sequence of Fibonacci numbers which is defined by 2nd order recurrence Fn+2 = Fn+1 + Fn, with initial conditions Fi = i, for i 2 f0, 1g. These numbers (together with the sequence of prime numbers) form a very important sequence in mathematics (mainly because its unexpectedly and often appearance in many branches of mathematics as well as in another disciplines). We refer the reader to [1–3] and their very extensive bibliography. We recall that an arithmetic function is any function f : Z>0 ! C (i.e., a complex-valued function which is defined for all positive integer).
    [Show full text]
  • [Math.NT] 10 May 2005
    Journal de Th´eorie des Nombres de Bordeaux 00 (XXXX), 000–000 Restriction theory of the Selberg sieve, with applications par Ben GREEN et Terence TAO Resum´ e.´ Le crible de Selberg fournit des majorants pour cer- taines suites arithm´etiques, comme les nombres premiers et les nombres premiers jumeaux. Nous demontrons un th´eor`eme de restriction L2-Lp pour les majorants de ce type. Comme ap- plication imm´ediate, nous consid´erons l’estimation des sommes exponentielles sur les k-uplets premiers. Soient les entiers posi- tifs a1,...,ak et b1,...,bk. Ecrit h(θ) := n∈X e(nθ), ou X est l’ensemble de tous n 6 N tel que tousP les nombres a1n + b1,...,akn+bk sont premiers. Nous obtenons les bornes sup´erieures pour h p T , p > 2, qui sont (en supposant la v´erit´ede la con- k kL ( ) jecture de Hardy et Littlewood sur les k-uplets premiers) d’ordre de magnitude correct. Une autre application est la suivante. En utilisant les th´eor`emes de Chen et de Roth et un «principe de transf´erence », nous demontrons qu’il existe une infinit´ede suites arithm´etiques p1 < p2 < p3 de nombres premiers, telles que cha- cun pi + 2 est premier ou un produit de deux nombres premier. Abstract. The Selberg sieve provides majorants for certain arith- metic sequences, such as the primes and the twin primes. We prove an L2–Lp restriction theorem for majorants of this type. An im- mediate application is to the estimation of exponential sums over prime k-tuples.
    [Show full text]
  • Number Theory, Dover Publications, Inc., New York, 1994
    Theory of Numbers Divisibility Theory in the Integers, The Theory of Congruences, Number-Theoretic Functions, Primitive Roots, Quadratic Residues Yotsanan Meemark Informal style based on the course 2301331 Theory of Numbers, offered at Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University Second version August 2016 Any comment or suggestion, please write to [email protected] Contents 1 Divisibility Theory in the Integers 1 1.1 The Division Algorithm and GCD . 1 1.2 The Fundamental Theorem of Arithmetic . 5 1.3 The Euclidean Algorithm and Linear Diophantine Equations . 8 2 The Theory of Congruences 13 2.1 Basic Properties of Congruence . 13 2.2 Linear Congruences . 16 2.3 Reduced Residue Systems . 18 2.4 Polynomial Congruences . 21 3 Number-Theoretic Functions 25 3.1 Multiplicative Functions . 25 3.2 The Mobius¨ Inversion Formula . 28 3.3 The Greatest Integer Function . 30 4 Primitive Roots 33 4.1 The Order of an Integer Modulo n ............................ 33 4.2 Integers Having Primitive Roots . 35 4.3 nth power residues . 39 4.4 Hensel’s Lemma . 41 5 Quadratic Residues 45 5.1 The Legendre Symbol . 45 5.2 Quadratic Reciprocity . 48 Bibliography 53 Index 54 Chapter 1 Divisibility Theory in the Integers Let N denote the set of positive integers and let Z be the set of integers. 1.1 The Division Algorithm and GCD Theorem 1.1.1. [Well-Ordering Principle] Every nonempty set S of nonnegative integers contains a least element; that is, there is some integer a in S such that a ≤ b for all b 2 S.
    [Show full text]
  • Arxiv:Math/0201082V1
    2000]11A25, 13J05 THE RING OF ARITHMETICAL FUNCTIONS WITH UNITARY CONVOLUTION: DIVISORIAL AND TOPOLOGICAL PROPERTIES. JAN SNELLMAN Abstract. We study (A, +, ⊕), the ring of arithmetical functions with unitary convolution, giving an isomorphism between (A, +, ⊕) and a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell- Everett[4] between the ring (A, +, ·) of arithmetical functions with Dirichlet convolution and the power series ring C[[x1,x2,x3,... ]] on countably many variables. We topologize it with respect to a natural norm, and shove that all ideals are quasi-finite. Some elementary results on factorization into atoms are obtained. We prove the existence of an abundance of non-associate regular non-units. 1. Introduction The ring of arithmetical functions with Dirichlet convolution, which we’ll denote by (A, +, ·), is the set of all functions N+ → C, where N+ denotes the positive integers. It is given the structure of a commutative C-algebra by component-wise addition and multiplication by scalars, and by the Dirichlet convolution f · g(k)= f(r)g(k/r). (1) Xr|k Then, the multiplicative unit is the function e1 with e1(1) = 1 and e1(k) = 0 for k> 1, and the additive unit is the zero function 0. Cashwell-Everett [4] showed that (A, +, ·) is a UFD using the isomorphism (A, +, ·) ≃ C[[x1, x2, x3,... ]], (2) where each xi corresponds to the function which is 1 on the i’th prime number, and 0 otherwise. Schwab and Silberberg [9] topologised (A, +, ·) by means of the norm 1 arXiv:math/0201082v1 [math.AC] 10 Jan 2002 |f| = (3) min { k f(k) 6=0 } They noted that this norm is an ultra-metric, and that ((A, +, ·), |·|) is a valued ring, i.e.
    [Show full text]
  • On Sufficient Conditions for the Existence of Twin Values in Sieves
    On Sufficient Conditions for the Existence of Twin Values in Sieves over the Natural Numbers by Luke Szramowski Submitted in Partial Fulfillment of the Requirements For the Degree of Masters of Science in the Mathematics Program Youngstown State University May, 2020 On Sufficient Conditions for the Existence of Twin Values in Sieves over the Natural Numbers Luke Szramowski I hereby release this thesis to the public. I understand that this thesis will be made available from the OhioLINK ETD Center and the Maag Library Circulation Desk for public access. I also authorize the University or other individuals to make copies of this thesis as needed for scholarly research. Signature: Luke Szramowski, Student Date Approvals: Dr. Eric Wingler, Thesis Advisor Date Dr. Thomas Wakefield, Committee Member Date Dr. Thomas Madsen, Committee Member Date Dr. Salvador A. Sanders, Dean of Graduate Studies Date Abstract For many years, a major question in sieve theory has been determining whether or not a sieve produces infinitely many values which are exactly two apart. In this paper, we will discuss a new result in sieve theory, which will give sufficient conditions for the existence of values which are exactly two apart. We will also show a direct application of this theorem on an existing sieve as well as detailing attempts to apply the theorem to the Sieve of Eratosthenes. iii Contents 1 Introduction 1 2 Preliminary Material 1 3 Sieves 5 3.1 The Sieve of Eratosthenes . 5 3.2 The Block Sieve . 9 3.3 The Finite Block Sieve . 12 3.4 The Sieve of Joseph Flavius .
    [Show full text]
  • Generalized Perfect Numbers
    Acta Univ. Sapientiae, Mathematica, 1, 1 (2009) 73–82 Generalized perfect numbers Antal Bege Kinga Fogarasi Sapientia–Hungarian University of Sapientia–Hungarian University of Transilvania Transilvania Department of Mathematics and Department of Mathematics and Informatics, Informatics, Tˆargu Mure¸s, Romania Tˆargu Mure¸s, Romania email: [email protected] email: [email protected] Abstract. Let σ(n) denote the sum of positive divisors of the natural number n. A natural number is perfect if σ(n) = 2n. This concept was already generalized in form of superperfect numbers σ2(n)= σ(σ(n)) = k+1 k−1 2n and hyperperfect numbers σ(n)= k n + k . In this paper some new ways of generalizing perfect numbers are inves- tigated, numerical results are presented and some conjectures are estab- lished. 1 Introduction For the natural number n we denote the sum of positive divisors by arXiv:1008.0155v1 [math.NT] 1 Aug 2010 σ(n)= X d. d|n Definition 1 A positive integer n is called perfect number if it is equal to the sum of its proper divisors. Equivalently: σ(n)= 2n, where AMS 2000 subject classifications: 11A25, 11Y70 Key words and phrases: perfect number, superperfect number, k-hyperperfect number 73 74 A. Bege, K. Fogarasi Example 1 The first few perfect numbers are: 6, 28, 496, 8128, . (Sloane’s A000396 [15]), since 6 = 1 + 2 + 3 28 = 1 + 2 + 4 + 7 + 14 496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 + 124 + 248 Euclid discovered that the first four perfect numbers are generated by the for- mula 2n−1(2n − 1).
    [Show full text]
  • Mathematical Gems
    AMS / MAA DOLCIANI MATHEMATICAL EXPOSITIONS VOL 1 Mathematical Gems ROSS HONSBERGER MATHEMATICAL GEMS FROM ELEMENTARY COMBINATORICS, NUMBER THEORY, AND GEOMETRY By ROSS HONSBERGER THE DOLCIANI MATHEMATICAL EXPOSITIONS Published by THE MArrHEMATICAL ASSOCIATION OF AMERICA Committee on Publications EDWIN F. BECKENBACH, Chairman 10.1090/dol/001 The Dolciani Mathematical Expositions NUMBER ONE MATHEMATICAL GEMS FROM ELEMENTARY COMBINATORICS, NUMBER THEORY, AND GEOMETRY By ROSS HONSBERGER University of Waterloo Published and Distributed by THE MATHEMATICAL ASSOCIATION OF AMERICA © 1978 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 73-89661 Complete Set ISBN 0-88385-300-0 Vol. 1 ISBN 0-88385-301-9 Printed in the United States of Arnerica Current printing (last digit): 10 9 8 7 6 5 4 3 2 1 FOREWORD The DOLCIANI MATHEMATICAL EXPOSITIONS serIes of the Mathematical Association of America came into being through a fortuitous conjunction of circumstances. Professor-Mary P. Dolciani, of Hunter College of the City Uni­ versity of New York, herself an exceptionally talented and en­ thusiastic teacher and writer, had been contemplating ways of furthering the ideal of excellence in mathematical exposition. At the same time, the Association had come into possession of the manuscript for the present volume, a collection of essays which seemed not to fit precisely into any of the existing Associa­ tion series, and yet which obviously merited publication because of its interesting content and lucid expository style. It was only natural, then, that Professor Dolciani should elect to implement her objective by establishing a revolving fund to initiate this series of MATHEMATICAL EXPOSITIONS.
    [Show full text]
  • The Complete Splittings of Finite Abelian Groups
    The complete splittings of finite abelian groups Kevin Zhaoa aDepartment of Mathematics, South China normal university, Guangzhou 510631, China Abstract Let G be a finite group. We will say that M and S form a complete split- ting (splitting) of G if every element (nonzero element) g of G has a unique representation of the form g = ms with m ∈ M and s ∈ S, and 0 has a such representation (while 0 has no such representation). In this paper, we determine the structures of complete splittings of finite abelian groups. In particular, for complete splittings of cyclic groups our de- scription is more specific. Furthermore, we show some results for existence and nonexistence of complete splittings of cyclic groups and find a relationship between complete splittings and splittings for finite groups. Keywords: complete splittings, splittings, cyclic groups, finite abelian groups, relationship. 1. Introduction The splittings of finite abelian groups are closely related to lattice tilings and are easy to be generated to lattice packings. Let K0 be a polytope composed of unit cubes and v + K0 be a translate of K0 for some vector v. A family of translations {v + K0 : v ∈ H} is called an integer lattice packing if H is an n-dimensional subgroup of Zn and, for any two vectors v and w in H, the interiors of v + K0 and w + K0 are disjoint; furthermore, if the n-dimensional Euclidean space Zn is contained in the family of these translations, then we call it an integer lattice tiling. The splitting problem can be traceable to a geometric problem posed by H.
    [Show full text]
  • Composite Numbers That Give Valid RSA Key Pairs for Any Coprime P
    information Article Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p Barry Fagin ID Department of Computer Science, US Air Force Academy, Colorado Springs, CO 80840, USA; [email protected]; Tel.: +1-719-339-4514 Received: 13 August 2018; Accepted: 25 August 2018; Published: 28 August 2018 Abstract: RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e and d. In some cases, specific (s, r) pairs can be found for which encryption and decryption will be correct for any (e, d) exponent pair. Certain s exist, however, for which encryption and decryption are correct for any odd prime r - s. We give necessary and sufficient conditions for s with this property. Keywords: cryptography; abstract algebra; RSA; computer science education; cryptography education MSC: [2010] 11Axx 11T71 1. Notation and Background Consider the RSA public-key cryptosystem and its operations of encryption and decryption [1]. Let (p, q) be primes, n = p ∗ q, f(n) = (p − 1)(q − 1) denote Euler’s totient function and (e, d) the ∗ Z encryption/decryption exponent pair chosen such that ed ≡ 1. Let n = Un be the group of units f(n) Z mod n, and let a 2 Un. Encryption and decryption operations are given by: (ae)d ≡ (aed) ≡ (a1) ≡ a mod n We consider the case of RSA encryption and decryption where at least one of (p, q) is a composite number s.
    [Show full text]
  • The Math Problems Notebook
    Valentin Boju Louis Funar The Math Problems Notebook Birkhauser¨ Boston • Basel • Berlin Valentin Boju Louis Funar MontrealTech Institut Fourier BP 74 Institut de Technologie de Montreal URF Mathematiques P.O. Box 78575, Station Wilderton Universite´ de Grenoble I Montreal, Quebec, H3S 2W9 Canada 38402 Saint Martin d’Heres cedex [email protected] France [email protected] Cover design by Alex Gerasev. Mathematics Subject Classification (2000): 00A07 (Primary); 05-01, 11-01, 26-01, 51-01, 52-01 Library of Congress Control Number: 2007929628 ISBN-13: 978-0-8176-4546-5 e-ISBN-13: 978-0-8176-4547-2 Printed on acid-free paper. c 2007 Birkhauser¨ Boston All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Birkhauser¨ Boston, c/o Springer Science+Business Media LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbid- den. The use in this publication of trade names, trademarks, service marks and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. 987654321 www.birkhauser.com (TXQ/SB) The Authors Valentin Boju was professor of mathematics at the University of Craiova, Romania, until his retirement in 2000. His research work was primarily in the field of geome- try.
    [Show full text]