# A COMPUTATIONAL INTRODUCTION TO NUMBER THEORY AND ALGEBRA by VICTOR SHOUP

By VICTOR SHOUP

Similar algebra books

Introduction to Algebra

Constructed to fulfill the wishes of recent scholars, this moment version of the vintage algebra textual content via Peter Cameron covers the entire summary algebra an undergraduate pupil is probably going to wish. beginning with an introductory assessment of numbers, units and services, matrices, polynomials, and modular mathematics, the textual content then introduces crucial algebraic buildings: teams, jewelry and fields, and their homes.

Modern Dimension Theory

The subsequent description is in Russian (transliterated), through an automatic English translation. We make an apology for inaccuracies within the computer-generated English translation. Please be happy to touch us for a correct human English translation, which good be at liberty to organize upon request We send to around the world locations from around the globe origination issues, together with our in another country amenities.

The Future of the Teaching and Learning of Algebra The 12 th ICMI Study

This publication provides a wide-ranging, overseas point of view at the country of the sector of algebra from invited members to the twelfth ICMI learn convention held in Melbourne, Australia in 2001. The authors are popular teachers from everywhere in the international who've written person chapters linked to the instructing and studying of algebra that relate to their specific components of analysis and educating services.

Group Theory and Its Applications: Volume II: v. 2

Team thought and its purposes, quantity II covers the 2 large parts of functions of staff concept, particularly, all atomic and molecular phenomena, in addition to all elements of nuclear constitution and straightforward particle concept. This quantity comprises 5 chapters and starts with the illustration and tensor operators of the unitary teams.

Additional resources for A COMPUTATIONAL INTRODUCTION TO NUMBER THEORY AND ALGEBRA (VERSION 1)

Example text

6, we can compute successive powers of a modulo n to ﬁnd its multiplicative order modulo n. 1i 2i 3i 4i 5i 6i i mod 7 mod 7 mod 7 mod 7 mod 7 mod 7 1 1 2 3 4 5 6 2 1 4 2 2 4 1 3 1 1 6 1 6 6 4 1 2 4 4 2 1 5 1 4 5 2 3 6 6 1 1 1 1 1 1 So we conclude that modulo 7: 1 has order 1; 6 has order 2; 2 and 4 have order 3; and 3 and 5 have order 6. 15 (Euler’s Theorem). For any positive integer n, and any integer a relatively prime to n, we have aφ(n) ≡ 1 (mod n). In particular, the multiplicative order of a modulo n divides φ(n).

Pe − 1 are 0 · p, 1 · p, . . , (pe−1 − 1) · p, of which there are precisely pe−1 . Thus, φ(pe ) = pe − pe−1 = pe−1 (p − 1). 14. If n = pe11 · · · perr is the factorization of n into primes, then r pei i −1 (pi φ(n) = i=1 r − 1) = n (1 − 1/pi ). 14. Show that φ(nm) = gcd(n, m) · φ(lcm(n, m)). 5 Fermat’s little theorem Let n be a positive integer, and let a ∈ Z with gcd(a, n) = 1. Consider the sequence of powers of α := [a]n ∈ Z∗n : [1]n = α0 , α1 , α2 , . . TEAM LinG 26 Congruences Since each such power is an element of Z∗n , and since Z∗n is a ﬁnite set, this sequence of powers must start to repeat at some point; that is, there must be a positive integer k such that αk = αi for some i = 0, .

For example, suppose f (d) = 1/d in the above theorem, and let n = · · · perr be the prime factorization of n. Then we obtain: pe11 µ(d)/d = (1 − 1/p1 ) · · · (1 − 1/pr ). 8) d|n TEAM LinG 30 Congruences As another example, suppose f = J. Then we obtain r (1 − 1), µ(d) = (µ J)(n) = i=1 d|n which is 1 if n = 1, and is zero if n > 1. Thus, we have µ J = I. 18 (M¨ obius inversion formula). Let f and F be arithmetic functions. Then we have F = J f if and only if f = µ F . Proof. If F = J f , then µ F = µ (J f ) = (µ J) f = I f = f, and conversely, if f = µ F , then J f =J (µ F ) = (J µ) F = I F = F.