Skip to main content
PreTeXt Sample Book:
Abstract Algebra (SAMPLE ONLY)
Thomas W. Judson, Isaac Newton (Editor)
Contents
Index
Search Book
close
Search Results:
No results.
Prev
Up
Next
Scratch ActiveCode
\(\newcommand{\identity}{\mathrm{id}} \newcommand{\notdivide}{{\not{\mid}}} \newcommand{\notsubset}{\not\subset} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\gf}{\operatorname{GF}} \newcommand{\inn}{\operatorname{Inn}} \newcommand{\aut}{\operatorname{Aut}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\cis}{\operatorname{cis}} \newcommand{\chr}{\operatorname{char}} \newcommand{\Null}{\operatorname{Null}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} \newcommand{\sfrac}[2]{{#1}/{#2}} \)
Front Matter
Colophon
Author Biography
About Robert A. Beezer
Dedication
Acknowledgements
Preface
Contributors to the 4
\(^\mathrm{th}\)
Edition
1
Preliminaries
1.1
A Short Note on Proofs
1.1.1
Some Cautions and Suggestions
1.2
Sets and Equivalence Relations
1.2.1
Set Theory
1.2.2
Cartesian Products and Mappings
1.2.3
Equivalence Relations and Partitions
1.3
Sage
1.3.1
Executing Sage Commands
1.3.2
Immediate Help
1.3.3
Annotating Your Work
1.3.4
Lists
1.3.5
Lists of Integers
1.3.6
Saving and Sharing Your Work
1.4
Exercises
1.5
Sage Exercises
1.6
References and Suggested Readings
2
The Integers
2.1
Mathematical Induction and Math in a Title
\(A\notsubset B\)
2.2
The Division Algorithm
2.2.1
The Euclidean Algorithm
2.2.2
Prime Numbers
2.2.3
Historical Note
2.3
Sage
2.3.1
Division Algorithm
2.3.2
Greatest Common Divisor
2.3.3
Primes and Factoring
2.4
Exercises
2.5
Programming Exercises
2.6
Sage Exercises
2.7
References and Suggested Readings
3
Groups
3.1
Integer Equivalence Classes and Symmetries
3.1.1
The Integers mod
\(n\)
3.1.2
Symmetries
3.2
Definitions and Examples
3.2.1
Definition of a Group
3.2.2
Examples of Groups
3.2.3
Basic Properties of Groups
3.2.4
Historical Note
3.3
Subgroups
3.3.1
Definitions and Examples
3.3.2
Some Subgroup Theorems
3.4
Sage
3.4.1
Integers mod n
3.4.2
Groups of symmetries
3.4.3
Quaternions
3.4.4
Subgroups
3.5
Exercises
3.6
Additional Exercises: Detecting Errors
3.7
Sage Exercises
3.8
References and Suggested Readings
4
Cyclicity
4.1
Cyclic groups
4.2
Subgroups of a Cyclic Group
4.3
Cyclic Groups of Complex Numbers
4.4
Large Powers of Integers
4.5
Exercises
4.6
Programming Exercises
4.7
Sage Exercises
4.8
References and Suggested Readings
5
Runestone Testing
5.1
ActiveCode
5.2
Code Lens
5.3
Coding Exercises
5.4
Data Files
5.5
YouTube Videos
5.6
Deeper
5.6.1
Subsection One
5.6.2
Subsection Two
5.7
True/False Exercises
5.8
Multiple Choice Exercises
5.9
Parsons Exercises
5.10
Horizontal Parsons Exercises
5.11
Matching Exercises
5.12
Clickable Area Exercises
5.13
Select Exercises
5.14
Short Answer Exercises
5.15
Polling
5.16
DoenetML
5.17
Fill-In Exercises
5.18
Hodgepodge
5.19
Exercises that are Timed
5.19
Timed Exercises
5.20
Projects and Friends
5.21
Expedited Samples
5.22
Reading Questions
5.23
YouTube Video Embedding
5.24
Runestone Assignment Testing
5.24
Exercises
5.25
A “Group Work” Worksheet
5.26
Group Exercises
Back Matter
A
Notation
B
Hints and Answers to Selected Odd Exercises
C
Hints and Answers to Selected Even Exercises
D
Hints and Answers to Selected Exercises
E
A Structured Appendix
E.1
A Section in an Appendix
E.1.1
A Subsection in a Section in an Appendix
E.1.1.1
A Subsubsection in a Subsection in a Section in an Appendix
E.2
Numbering in the Back Matter
F
GNU Free Documentation License
Index
Colophon
Section
5.16
DoenetML
This preliminary DoenetML example is for testing use on a Runestone server, where it will use the SPLICE protocol to report out events. To the reader, it should
behave
identically when not on a Runestone server.
