ON MULTIPLICATIVE SEMIGROUPS OF RESIDUE CLASSES

Similar documents
1.6 Congruence Modulo m

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.

5 Symmetric and alternating groups

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

ALGEBRA: Chapter I: QUESTION BANK

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02

Wilson s Theorem and Fermat s Theorem

NUMBER THEORY AMIN WITNO

Discrete Math Class 4 ( )

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method

Primitive Roots. Chapter Orders and Primitive Roots

An elementary study of Goldbach Conjecture

Constructions of Coverings of the Integers: Exploring an Erdős Problem

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

Variations on a Theme of Sierpiński

Practice Midterm 2 Solutions

Math 127: Equivalence Relations

SOLUTIONS TO PROBLEM SET 5. Section 9.1

Goldbach Conjecture (7 th june 1742)

Congruence properties of the binary partition function

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

Public Key Encryption

p 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

Foundations of Cryptography

A REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.

Zhanjiang , People s Republic of China

Math 255 Spring 2017 Solving x 2 a (mod n)

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.

12. Let Rm = {0,1,2,..., m 1} be a complete residue system modulo ra. Let a be an integer. When is a Rm = {0,1 a, 2 a,...

Applications of Fermat s Little Theorem and Congruences

Solutions for the Practice Questions

SYMMETRIES OF FIBONACCI POINTS, MOD m

PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania

On the Periodicity of Graph Games

Implementation / Programming: Random Number Generation

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012

Chapter 4 Cyclotomic Cosets, the Mattson Solomon Polynomial, Idempotents and Cyclic Codes

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey

ON THE EQUATION a x x (mod b) Jam Germain

ELEMENTS OF NUMBER THEORY & CONGRUENCES. Lagrange, Legendre and Gauss. Mth Mathematicst

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013

Congruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands

SOLUTIONS FOR PROBLEM SET 4

Carmen s Core Concepts (Math 135)

Introduction to Modular Arithmetic

The Chinese Remainder Theorem

What is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?

Number Theory. Konkreetne Matemaatika

by Michael Filaseta University of South Carolina

Two-person symmetric whist

Introduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.

FORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS

A theorem on the cores of partitions

arxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY

University of British Columbia. Math 312, Midterm, 6th of June 2017

Math 319 Problem Set #7 Solution 18 April 2002

Quadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).

CHAPTER 2. Modular Arithmetic

MAT Modular arithmetic and number theory. Modular arithmetic

Colouring tiles. Paul Hunter. June 2010

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Generating trees and pattern avoidance in alternating permutations

Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field

ON SPLITTING UP PILES OF STONES

Some t-homogeneous sets of permutations

Modular Arithmetic. Kieran Cooney - February 18, 2016

Discrete Square Root. Çetin Kaya Koç Winter / 11

Fermat s little theorem. RSA.

Assignment 2. Due: Monday Oct. 15, :59pm

Mark Kozek. December 7, 2010

Power = 36² mod 99 Power = 9 5 a 5 = 0 x = 81 Power = 9² mod 99 Power = 81 6 a 6 = 1 x = 81 x 81 mod 99 x = 27 7 a 7 = 1 x = 27 x 27 mod 99 x = 36

UNIVERSITY OF MANITOBA DATE: December 7, FINAL EXAMINATION TITLE PAGE TIME: 3 hours EXAMINER: M. Davidson

Permutation Groups. Definition and Notation

Final exam. Question Points Score. Total: 150

PERMANENTLY OPTIMAL STRATEGIES IN EXTENSIVE GAMES

Greedy Flipping of Pancakes and Burnt Pancakes

FOR THE CONSTRUCTION OF SAMAGARBHA AND VIṢAMA MAGIC SQUARES

Is 1 a Square Modulo p? Is 2?

Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS

Number Theory for Cryptography

Three-player impartial games

Cryptography CS 555. Topic 20: Other Public Key Encryption Schemes. CS555 Topic 20 1

LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS

Diffie-Hellman key-exchange protocol

Distribution of Primes

In this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

Math 124 Homework 5 Solutions

X = {1, 2,...,n} n 1f 2f 3f... nf

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory

A SET OF POSTULATES FOR GENERAL PROJECTIVE GEOMETRY*

The Chinese Remainder Theorem

Graduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore

Transcription:

ON MULTIPLICATIVE SEMIGROUPS OF RESIDUE CLASSES E. T. PARKER1 The set of residue classes, modulo any positive integer, is commutative and associative under the operation of multiplication. The author made the conjecture: For each finite commutative semigroup, S, there exists a positive integer, n, such that S is isomorphic with a subsemigroup of the multiplicative semigroup of residue classes (mod n). (A semigroup is a set closed with respect to a single-valued associative binary operation.) A counter-example to the above follows: Let S be the set, {z, a, b, c}, with all products defined to be z except bc = cb a. Assume that there exists a positive integer, n, and four distinct residue classes, z, a, b, c (mod n) forming a system under multiplication isomorphic with S. Form the residue classes, 0=3 2, a'=a z, b' b z, c' c z. For x and y any ordered pair of z, a, 0, c, we have ix z)iy z)=xy~z z+z = xy z. Thus, 0, a', b', c' form a multiplicative semigroup isomorphic with S, where 0 is the zero residue class. The following must hold: o'2 and c'2 are each the zero residue class (mod n), but b'c' is a nonzero residue class; i.e., w /32, ra 72, n\fiy, where /3 and 7 are integers in the residue classes 0' and c' (mod n) respectively. Since m /32 and «72, it follows that n2\$2y2, and n\(3y. The desired contradiction has been obtained. We begin the main result of this paper with a Definition. For each prime-power, pk, and each positive integer, m, we define a basic semigroup, aipk, m), with generators x and y, identity 1, annihilator 0, and commutative multiplication defined by: (0 ^ s = v < m, and xry" = xuyv, if and only if < (r = u (mod pk) (s 2i m, and [v ^ m. (Letters used as exponents denote non-negative integers; the convention is adopted that any element to the zeroth power is 1.) Received by the editors July 9, 1953 and, in revised form, December 27, 1953. 1 The author wishes to express his sincere gratitude to the referee for finding an error in the original version of this paper, and for suggesting several clarifying alterations. 612

ON MULTIPLICATIVE SEMIGROUPS OF RESIDUE CLASSES 613 It follows that x is a generator ym = 0. We shall prove the of a cyclic group of order pk, and Principal Theorem. The necessary and sufficient condition that a semigroup, S, be embeddable in a multiplicative semigroup of residue classes, modulo some positive integer, is that S be embeddable in a direct product of finitely many basic semigroups. "Embeddable in " means "isomorphic with a sub-semigroup (not necessarily proper) of." We note that if a semigroup is embeddable in a second semigroup, then each sub-semigroup of the former is embeddable in the latter. Thus the principal theorem is equivalent to the following two theorems collectively: Theorem I. Each multiplicative semigroup of residue classes is embeddable in a direct product of finitely many basic semigroups. Theorem II. Each direct product of finitely many basic semigroups is embeddable in a multiplicative semigroup of residue classes. We proceed now to a lemma, which may be in the literature: Lemma. // n = p\'p^ pcn, where pi, p2,, pn are distinct primes, and C\, c2,, cn are positive integers, then the multiplicative semigroup of residue classes (mod re) is isomorphic with the direct product of the multiplicative semigroups of residue classes (mod p\), (mod #),, (mod ft). Proof. The result follows immediately by induction once we prove that if «= reire2 with (rei, n2) = 1, then the multiplicative semigroup of residue classes (mod re) is isomorphic with the direct product of multiplicative semigroups of residue classes (mod Wi) and (mod n2). First, the correspondence between residue classes (mod re) and ordered pairs of residue classes (mod Wi) and (mod re2) is one-to-one.2 Since the sets of residue classes =0 (mod rei), (mod re2) constitute ideals, we ignore addition and have our result.3 We observe that, if S\, S{, S2, S2 are semigroups such that Si is embeddable in S{ and S2 is embeddable in S{, then the direct product of Si and 52 is embeddable in the direct product of S{ and S2. 2 Uspensky and Heaslet, Elementary number theory, New York, McGraw-Hill, 1939, Chapter VI, Section 5. 3 Birkhoff and MacLane, A survey of modern algebra, New York, Macmillan, 1941, p. 360, problem 12 (p. 381 in rev. ed.).

614 E. T. PARKER [August By induction, this is true for any finite number of pairs of semigroups. Applying the lemma, we may assert that Theorem I will be established when we prove: Theorem la. Each multiplicative semigroup of residue classes modulo a prime-power is embeddable in a direct product of finitely many basic semigroups. Similarly, Theorem II follows when we prove: Theorem I la. For each basic semigroup, <ripk, m), there exist infinitely many primes, q, such that aipk, m) is embeddable in the multiplicative semigroup of residue classes (mod qm). Proof of Theorem la. Case 1. The modulus is pc, where p is an odd prime. It is well known that the residue classes relatively prime to an odd prime-power modulus form a cyclic4 group under multiplication. Let r be a primitive root of pc. The multiplicative semigroup of residue classes (mod pc) is generated by r and it, with commutative multiplication satisfying t*v* =- t<v (mod pc), if and only if or (0 ^ s = v < c, and I r = u (mod <pipc~')), where "<p" denotes Euler's Function, (s S; c, and \v Si C. Let P~l=qTq? " " " qlk, where qi, q2,, qk are distinct primes, and ai, a2,, ak are positive integers. Let <Ji, with generators x* and yt-, be 0"(g?', c), for i=l, 2,, k. Let a-*, with generators x* and yf, be <ripc~',j), for j = l, 2,, c-1. Form the direct product of the ai and the of. Let T <-> (Xi, X2,, Xjfe, Xi, x2,, Xc_i), T «-> (yu yi,, yic, yi, yi,, yc-i). Now Trir"<->iO, 0,, 0), the annihilator of the direct product, if 4 Speiser, Die Theorie der Gruppen von Endlicher Ordnung, 3d ed., New York, License Dover, or copyright 1943, restrictions Theorem may apply to 56, redistribution; p. 57. see http://www.ams.org/journal-terms-of-use

1954] ON MULTIPLICATIVE SEMIGROUPS OF RESIDUE CLASSES 615 and only if s^c. And, if 0^5<e, and r'ir* = t"7t" in the direct product, then s = v; for, when 0^5<c, xjyi=x"yi only if s=v. Further, if 0^s<c, and rrirs = tutts, then r = u (mod q") for * = 1, 2,, k; and r = w (mod pc~') for j = 5 + l, 5 + 2,, c 1. It follows that r = u modulo the least common multiple of these various moduli; that is, r = u (mod p^'^ylu) qv); r = u (mod p -'-l(p-1)); or, r = u (mod (p(pc~)). Conversely, if 0^5<c, and r = u (mod <p(pc~")), the congruence may be factored into the preceding moduli, and the correspondences hold in the <r» and the a*, so that This completes the proof of Case 1. Case 2. The modulus is 2C. For c^3, using some known results,5 we may assert that the multiplicative semigroup of residue classes is generated by 1, 3, 2, and that if and only if (-!)"(-3)^y a (-l)«'(-3)/»'2*' (mod 2) I 7 ^ c, and or 7 = 7' = c 1 'o ^ 7 = y ^c - 2 or a = a (mod 2).0 3=0' (mod 2c~y~2). Form the direct product of the following ai, with generators x,- and y* respectively: o-i = <r(2i, c i 1) for t = l, 2, 3,, c 2; <rc_i = cr(2, c 1); o-c=<r(2, c 1); o-c+i = o-(j>, c), p any prime. When we let - 1 <-> (1, 1, 1,, 1; xc; 1), 3 *-> (xi, x2, x3,, xc_2; xc_i; 1; 1), 2 <-> (yi. ysf y»,, yc-2 = 0; y _i; yc; yc+i), we have the desired automorphism. For c = 2, we note that under multiplication {0, 4, 1, 3} (mod 8) ~ {0, 2, 1, 3} (mod 4). For c = 1, the proof is trivial. Proof of Theorem I la. Let q be a prime, q=\ (mod pk). By Dirichlet's theorem, there exist infinitely many such primes, q. The multiplicative semigroup of residue classes (mod qm) is generated by 6 Speiser, op. cit., Theorem 56 and preceding paragraph.

616 E. T. PARKER t and q subject to the conditions, trq" = tuqv (mod q'"), if and only if CO : s = v < m, and \r = u (mod 4>iqm~")) is S: m, and {v S; w. Let «= ^«>/p*. Then trq*=luqv (mod g">) if and only if 0 ^ 5 = d < m, and < ($'") <t>(qm),,,, - r ss -u (mod <t>iqm~e)) pk pk (s S: m, and l» Si m. Using 4>iqm) =qm~1iq 1) and the assumption that (q l)/pk is an integer, an elementary calculation shows that the first of these conditions holds if and only if r = u (mod pk). Thus, the semigroup generated by / and q is isomorphic with aipk, m), and the proof is complete. Final remarks. The principal theorem is rather analogous with the "Basis Theorem for Abelian groups." Trivially, if 2 is a semigroup embeddable in a multiplicative semigroup of residue classes, then such is also true for each sub-semigroup of 2. Another immediate corollary is that if two semigroups are embeddable in multiplicative semigroups of residue classes, then their direct product is likewise embeddable. (This latter property was the crucial question in the investigations leading to this paper.) From another standpoint, the analogy with the Basis Theorem breaks down. There exists a semigroup embeddable in a multiplicative semigroup of residue classes having a homomorphic image which fails to have this property. Let p be an odd prime. The residue classes (mod p3) containing 0, p2, p2, p, p are distinct, and form a multiplicative semigroup. Let 0 and p2 correspond to z, p2 to a, p to b, and ptoc. We have a homomorphic image with 5 (at the beginning of the paper). University of Texas