Problem 2CE Exercise 1. This software lists all idempotents (see the chapter exercises for the definition) in Z n . Run the program for various values of n . Use these data to make conjectures about the number of idempotents in Z n as a function of n. For example, how many idempotents are there when n is a prime power? What about when n is divisible by exactly two distinct primes? In the case where n is of the form pq where p and q are primes can you see a relationship between the two idempotents that are not 0 and 1? Can you see a relationship between the number of idempotents for a given n and the number of distinct prime divisors of n ? Exercise 2. This software lists all nilpotent elements (see the chapter exercises for definition) in Z n . Run your program for various values of n . Use these data to make conjectures about nilpotent elements in Z n as a function of n . Exercise 3. This software determines which rings of the form Z p [ i ] are fields. Run the program for all primes up to 37. From these data, make a conjecture about the form of the primes that yield a field. Exercise 1. This software lists all idempotents (see the chapter exercises for the definition) in Z n . Run the program for various values of n . Use these data to make conjectures about the number of idempotents in Z n as a function of n. For example, how many idempotents are there when n is a prime power? What about when n is divisible by exactly two distinct primes? In the case where n is of the form pq where p and q are primes can you see a relationship between the two idempotents that are not 0 and 1? Can you see a relationship between the number of idempotents for a given n and the number of distinct prime divisors of n ? Exercise 2. This software lists all nilpotent elements (see the chapter exercises for definition) in Z n . Run your program for various values of n . Use these data to make conjectures about nilpotent elements in Z n as a function of n . Exercise 3. This software determines which rings of the form Z p [ i ] are fields. Run the program for all primes up to 37. From these data, make a conjecture about the form of the primes that yield a field.
Read moreTable of Contents
0
Preliminaries
1
Introduction to Groups
2
Groups
3
Finite Groups; Subgroups
4
Cyclic Groups
5
Permutation Groups
6
Isomorphisms
7
Cosets and Lagrange’s Theorem
8
External Direct Products
9
Normal Subgroups and Factor Groups
10
Group Homomorphisms
11
Fundamental Theorem of Finite Abelian Groups
12
Introduction to Rings
13
Integral Domains
14
Ideals and Factor Rings
15
Ring Homomorphisms
16
Polynomial Rings
17
Factorization of Polynomials
18
Divisibility in Integral Domains
19
Vector Spaces
20
Extension Fields
21
Algebraic Extensions
22
Finite Fields
23
Geometric Constructions
24
Sylow Theorems
25
Finite Simple Groups
26
Generators and Relations
27
Symmetry Groups
28
Frieze Groups and Crystallographic Groups
29
Symmetry and Counting
30
Cayley Digraphs of Groups
31
Introduction to Algebraic Coding Theory
32
An Introduction to Galois Theory
33
Cyclotomic Extensions
Textbook Solutions for Contemporary Abstract Algebra
Chapter 13 Problem 6E
Question
Find a nonzero element in a ring that is neither a zero-divisor nor a unit.
Solution
Step 1 of 3
A ring is a set with two binary operations, addition and multiplication, satisfying several properties:
Is an Abelian group under addition, and the multiplication operation satisfies the associative law
And the distributive laws
And
For every
Subscribe to view the
full solution
full solution
Title
Contemporary Abstract Algebra 8
Author
Joseph Gallian
ISBN
9781133599708