forked from klevasseur/ads
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathads.idx
410 lines (410 loc) · 19.1 KB
/
ads.idx
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
\indexentry{Set-Builder Notation|hyperpage}{2}
\indexentry{Empty set|hyperpage}{3}
\indexentry{Improper subset|hyperpage}{3}
\indexentry{Proper subset|hyperpage}{3}
\indexentry{Basic Set Operations|hyperpage}{5}
\indexentry{Intersection|hyperpage}{5}
\indexentry{Disjoint Sets|hyperpage}{5}
\indexentry{Union|hyperpage}{5}
\indexentry{Universe|hyperpage}{5}
\indexentry{Complement of a set|hyperpage}{6}
\indexentry{Symmetric Difference|hyperpage}{8}
\indexentry{SageMath Note!Sets|hyperpage}{8}
\indexentry{Cartesian Product|hyperpage}{10}
\indexentry{Power Set|hyperpage}{11}
\indexentry{SageMath Note!Cartesian Products and Power Sets|hyperpage}{11}
\indexentry{Binary Representation|hyperpage}{13}
\indexentry{Binary Conversion Algorithm|hyperpage}{14}
\indexentry{Summation Notation and Generalizations|hyperpage}{16}
\indexentry{Generalized Set Operations|hyperpage}{17}
\indexentry{Rule Of Products, The|hyperpage}{21}
\indexentry{Power Set Cardinality Theorem|hyperpage}{22}
\indexentry{Factorial|hyperpage}{25}
\indexentry{Permutation|hyperpage}{26}
\indexentry{Permutation Counting Formula|hyperpage}{26}
\indexentry{Partition|hyperpage}{29}
\indexentry{Basic Law Of Addition:|hyperpage}{30}
\indexentry{Inclusion-Exclusion, Laws of|hyperpage}{31}
\indexentry{Combinations|hyperpage}{33}
\indexentry{Binomial Coefficient|hyperpage}{33}
\indexentry{Binomial Coefficient Formula|hyperpage}{34}
\indexentry{Binomial Theorem, The|hyperpage}{36}
\indexentry{SageMath Note!bridge hands|hyperpage}{36}
\indexentry{Lattice Paths|hyperpage}{37}
\indexentry{Proposition|hyperpage}{39}
\indexentry{Conjunction, Logical|hyperpage}{40}
\indexentry{Disjunction, Logical|hyperpage}{40}
\indexentry{Negation, Logical|hyperpage}{41}
\indexentry{Conditional Statement|hyperpage}{41}
\indexentry{Converse|hyperpage}{42}
\indexentry{Contrapositive|hyperpage}{42}
\indexentry{Biconditional Proposition|hyperpage}{42}
\indexentry{Tautology|hyperpage}{46}
\indexentry{Contradiction|hyperpage}{46}
\indexentry{Equivalence|hyperpage}{47}
\indexentry{Implication|hyperpage}{47}
\indexentry{Sheffer Stroke|hyperpage}{48}
\indexentry{Modus Ponens!see Detachment|hyperpage}{50}
\indexentry{Modus Tollens!see Indirect Reasoning|hyperpage}{50}
\indexentry{Detachment|hyperpage}{50}
\indexentry{Indirect Reasoning|hyperpage}{50}
\indexentry{Direct proof|hyperpage}{53}
\indexentry{Indirect proof|hyperpage}{54}
\indexentry{Truth Set|hyperpage}{57}
\indexentry{Quantifiers|hyperpage}{65}
\indexentry{Existential Quantifier|hyperpage}{66}
\indexentry{Universal Quantifier|hyperpage}{66}
\indexentry{Quantifiers!Negation|hyperpage}{66}
\indexentry{Quantifiers!Multiple|hyperpage}{67}
\indexentry{Minset|hyperpage}{82}
\indexentry{Minset Normal Form|hyperpage}{83}
\indexentry{Matrix Addition|hyperpage}{88}
\indexentry{Scalar Multiplication|hyperpage}{88}
\indexentry{Matrix Multiplication|hyperpage}{88}
\indexentry{Identity Matrix|hyperpage}{93}
\indexentry{Inverse!Matrix|hyperpage}{93}
\indexentry{Laws of Matrix Algebra|hyperpage}{96}
\indexentry{Matrix Oddities|hyperpage}{97}
\indexentry{Relation|hyperpage}{100}
\indexentry{Relation on a Set|hyperpage}{101}
\indexentry{Divides|hyperpage}{101}
\indexentry{Relation Notation|hyperpage}{102}
\indexentry{Composition of Relations|hyperpage}{102}
\indexentry{Directed graph|hyperpage}{104}
\indexentry{Digraph|hyperpage}{104}
\indexentry{Embedding of a graph|hyperpage}{104}
\indexentry{Reflexive Relation|hyperpage}{107}
\indexentry{Antisymmetric Relation|hyperpage}{107}
\indexentry{Transitive Relation|hyperpage}{107}
\indexentry{Partial Ordering|hyperpage}{107}
\indexentry{Poset|hyperpage}{107}
\indexentry{Partially ordered set|hyperpage}{107}
\indexentry{Hasse Diagram|hyperpage}{108}
\indexentry{Ordering Diagram|hyperpage}{108}
\indexentry{Equivalence Relations|hyperpage}{110}
\indexentry{Symmetric Relation|hyperpage}{110}
\indexentry{Equivalence Relation|hyperpage}{110}
\indexentry{Congruence Modulo n|hyperpage}{110}
\indexentry{Equivalence Class|hyperpage}{114}
\indexentry{Adjacency Matrix|hyperpage}{116}
\indexentry{Boolean Arithmetic|hyperpage}{116}
\indexentry{Transitive Closure|hyperpage}{120}
\indexentry{Function|hyperpage}{124}
\indexentry{Set of Functions Between Two Sets|hyperpage}{125}
\indexentry{Functions Between Two Sets!Set of|hyperpage}{125}
\indexentry{Image of an Element.|hyperpage}{125}
\indexentry{Range of a Function.|hyperpage}{125}
\indexentry{Functions!Of two Variables|hyperpage}{126}
\indexentry{SageMath Note!Functions|hyperpage}{126}
\indexentry{Characteristic function|hyperpage}{127}
\indexentry{Properties of Functions|hyperpage}{128}
\indexentry{Function!Injective|hyperpage}{128}
\indexentry{Function!One-to-one|hyperpage}{128}
\indexentry{Injection|hyperpage}{128}
\indexentry{Function!Surjective|hyperpage}{129}
\indexentry{Function!Onto|hyperpage}{129}
\indexentry{Surjection|hyperpage}{129}
\indexentry{Function!Bijective|hyperpage}{129}
\indexentry{Bijection|hyperpage}{129}
\indexentry{Cardinality.|hyperpage}{129}
\indexentry{Countable Set|hyperpage}{129}
\indexentry{Pigeonhole Principle|hyperpage}{130}
\indexentry{Function!Equality|hyperpage}{132}
\indexentry{Composition of Functions|hyperpage}{133}
\indexentry{Function!Composition|hyperpage}{133}
\indexentry{Powers of Functions|hyperpage}{133}
\indexentry{Identity Function|hyperpage}{134}
\indexentry{Inverse Function!of a function on a set|hyperpage}{134}
\indexentry{Permutation|hyperpage}{135}
\indexentry{Many Faces of Recursion, The|hyperpage}{139}
\indexentry{Polynomials and their evaluation|hyperpage}{139}
\indexentry{Binomial Coefficient!Recursive Definition|hyperpage}{139}
\indexentry{Polynomials|hyperpage}{140}
\indexentry{Polynomial Expression!Non-recursive).|hyperpage}{140}
\indexentry{Polynomial Expression!Recursive definition|hyperpage}{141}
\indexentry{Recursive Searching|hyperpage}{141}
\indexentry{Binary Search|hyperpage}{141}
\indexentry{Sequences!Recursively Defined|hyperpage}{142}
\indexentry{Fibonacci Sequence|hyperpage}{143}
\indexentry{Induction and Recursion|hyperpage}{144}
\indexentry{Closed Form Expression.|hyperpage}{145}
\indexentry{Sequences|hyperpage}{145}
\indexentry{Sequence|hyperpage}{145}
\indexentry{Recurrence Relation|hyperpage}{148}
\indexentry{Recurrence Relations!Solving|hyperpage}{149}
\indexentry{Order of a Recurrence Relation|hyperpage}{149}
\indexentry{Recurrence relations obtained from ``solutions''|hyperpage}{149}
\indexentry{Homogeneous Recurrence Relation.|hyperpage}{150}
\indexentry{Characteristic Equation|hyperpage}{151}
\indexentry{Characteristic Roots|hyperpage}{151}
\indexentry{Nonhomogeneous of Finite Order Linear Relations!Solution|hyperpage}{153}
\indexentry{Logarithms|hyperpage}{161}
\indexentry{Logarithm, base 2|hyperpage}{161}
\indexentry{Logarithms!Properties|hyperpage}{161}
\indexentry{Logarithm!General Base|hyperpage}{162}
\indexentry{Bubble Sort|hyperpage}{163}
\indexentry{Merge Sort|hyperpage}{163}
\indexentry{Derangement|hyperpage}{164}
\indexentry{Generating Functions|hyperpage}{166}
\indexentry{Generating Function|hyperpage}{167}
\indexentry{Sequences!Operations on|hyperpage}{170}
\indexentry{Multiple Pop and Push|hyperpage}{172}
\indexentry{Generating Functions!Operations on|hyperpage}{172}
\indexentry{Generating Functions!Operations on|hyperpage}{172}
\indexentry{Generating Functions!Closed form expressions for|hyperpage}{174}
\indexentry{Graph!Simple Directed|hyperpage}{181}
\indexentry{Directed Graph|hyperpage}{181}
\indexentry{Multigraph|hyperpage}{182}
\indexentry{Graph!Multigraph|hyperpage}{182}
\indexentry{Undirected Graph|hyperpage}{183}
\indexentry{Graph!Undirected|hyperpage}{183}
\indexentry{Complete Undirected Graph.|hyperpage}{183}
\indexentry{Subgraph|hyperpage}{185}
\indexentry{Induced Subgraph|hyperpage}{185}
\indexentry{Spanning Subgraph|hyperpage}{185}
\indexentry{Connected Component|hyperpage}{186}
\indexentry{Tournament Graph|hyperpage}{187}
\indexentry{Isomorphic Graphs|hyperpage}{188}
\indexentry{Degree|hyperpage}{188}
\indexentry{Degree Sequence of a Graph|hyperpage}{188}
\indexentry{Graphic Sequence|hyperpage}{189}
\indexentry{Graph!Data Structures|hyperpage}{192}
\indexentry{SageMath Note!Graphs|hyperpage}{194}
\indexentry{Connectivity in Graphs|hyperpage}{196}
\indexentry{Adjacency Matrix Method|hyperpage}{196}
\indexentry{Breadth-First Search|hyperpage}{197}
\indexentry{Breadth-first Search|hyperpage}{199}
\indexentry{Eccentricity of a vertex|hyperpage}{202}
\indexentry{Diameter of a Graph|hyperpage}{202}
\indexentry{Radius of a graph|hyperpage}{202}
\indexentry{Center of a graph|hyperpage}{202}
\indexentry{SageMath Note!Search in a Graph|hyperpage}{202}
\indexentry{Traversals of Graphs|hyperpage}{206}
\indexentry{Euler's Theorem!Koenigsberg Case|hyperpage}{206}
\indexentry{Eulerian Paths, Circuits, Graphs|hyperpage}{206}
\indexentry{Euler's Theorem|hyperpage}{207}
\indexentry{Hamiltonian Paths, Circuits, and Graphs|hyperpage}{209}
\indexentry{N-cube|hyperpage}{210}
\indexentry{Analog-to-digital Conversion|hyperpage}{210}
\indexentry{Graph Optimization|hyperpage}{215}
\indexentry{Weighted Graph|hyperpage}{216}
\indexentry{Traveling Salesman Problem, The|hyperpage}{216}
\indexentry{Closest Neighbor Algorithm|hyperpage}{217}
\indexentry{Networks|hyperpage}{220}
\indexentry{Network|hyperpage}{220}
\indexentry{Value of a Flow|hyperpage}{222}
\indexentry{Maximal flow|hyperpage}{222}
\indexentry{Flow Augmenting Path|hyperpage}{223}
\indexentry{Center of a Graph|hyperpage}{225}
\indexentry{Planar Graph|hyperpage}{228}
\indexentry{Plane Graph|hyperpage}{228}
\indexentry{Path Graph|hyperpage}{228}
\indexentry{Three Utilities Puzzle|hyperpage}{229}
\indexentry{Euler's Formula|hyperpage}{229}
\indexentry{Graph Coloring|hyperpage}{231}
\indexentry{Chromatic Number|hyperpage}{231}
\indexentry{Four-Color Theorem|hyperpage}{232}
\indexentry{Five-Color Theorem|hyperpage}{232}
\indexentry{Bipartite Graph.|hyperpage}{233}
\indexentry{Mesh Graph|hyperpage}{235}
\indexentry{What Is a Tree?|hyperpage}{236}
\indexentry{Cycle|hyperpage}{236}
\indexentry{Tree|hyperpage}{236}
\indexentry{Forest.|hyperpage}{237}
\indexentry{Spanning Trees|hyperpage}{239}
\indexentry{Spanning Tree|hyperpage}{240}
\indexentry{Minimal Spanning Tree|hyperpage}{241}
\indexentry{Bridge|hyperpage}{241}
\indexentry{Prim's Algorithm|hyperpage}{242}
\indexentry{Minimum Diameter Spanning Tree|hyperpage}{243}
\indexentry{Rooted Trees|hyperpage}{246}
\indexentry{Rooted Tree|hyperpage}{247}
\indexentry{Level of a vertex|hyperpage}{247}
\indexentry{Kruskal's Algorithm|hyperpage}{249}
\indexentry{SageMath Note!Kruskal's Algorithm|hyperpage}{249}
\indexentry{Binary Trees|hyperpage}{252}
\indexentry{Binary Tree|hyperpage}{253}
\indexentry{Full binary tree|hyperpage}{253}
\indexentry{Leaf of a binary tree|hyperpage}{253}
\indexentry{Leaf, of a binary tree|hyperpage}{253}
\indexentry{Full binary tree|hyperpage}{254}
\indexentry{Traversals of Binary Trees|hyperpage}{254}
\indexentry{Expression Tree|hyperpage}{256}
\indexentry{Counting Binary Trees|hyperpage}{259}
\indexentry{SageMath Note!Power Series|hyperpage}{260}
\indexentry{Operations|hyperpage}{262}
\indexentry{Binary Operation.|hyperpage}{263}
\indexentry{Unary Operation.|hyperpage}{263}
\indexentry{Properties of Operations|hyperpage}{263}
\indexentry{Commutative Property|hyperpage}{263}
\indexentry{Associative Property|hyperpage}{264}
\indexentry{Identity Property|hyperpage}{264}
\indexentry{Inverse Property|hyperpage}{264}
\indexentry{Idempotent Property|hyperpage}{264}
\indexentry{Left Distributive Property|hyperpage}{264}
\indexentry{Right Distributive Property|hyperpage}{264}
\indexentry{Distributive Property|hyperpage}{264}
\indexentry{Involution Property|hyperpage}{264}
\indexentry{Closure Property|hyperpage}{264}
\indexentry{Operation Tables|hyperpage}{265}
\indexentry{Algebraic Systems|hyperpage}{265}
\indexentry{Levels of Abstraction|hyperpage}{267}
\indexentry{Group|hyperpage}{268}
\indexentry{Abelian Group|hyperpage}{269}
\indexentry{Some General Properties of Groups|hyperpage}{270}
\indexentry{Cancellation in Groups|hyperpage}{272}
\indexentry{Linear Equations in a Group|hyperpage}{272}
\indexentry{Exponentiation in Groups|hyperpage}{273}
\indexentry{Division Property for Integers|hyperpage}{275}
\indexentry{Greatest Common Divisor (\(\gcd\))|hyperpage}{276}
\indexentry{Relatively Prime|hyperpage}{276}
\indexentry{Euclidean Algorithm, The|hyperpage}{276}
\indexentry{Modular Arithmetic|hyperpage}{279}
\indexentry{Modular Addition|hyperpage}{279}
\indexentry{Modular Multiplication|hyperpage}{279}
\indexentry{Modular Arithmetic!Properties|hyperpage}{280}
\indexentry{Integers Modulo \(n\)!Additive Group|hyperpage}{280}
\indexentry{Integers Modulo \(n\)!Multiplicative Group|hyperpage}{280}
\indexentry{SageMath Note!Modular Arithmetic|hyperpage}{281}
\indexentry{Subsystems|hyperpage}{283}
\indexentry{Subsystem|hyperpage}{283}
\indexentry{Cyclic Subgroup|hyperpage}{286}
\indexentry{Generator|hyperpage}{286}
\indexentry{Cyclic Group|hyperpage}{286}
\indexentry{Order of a Group Element|hyperpage}{286}
\indexentry{Direct Products|hyperpage}{288}
\indexentry{Direct Product|hyperpage}{288}
\indexentry{Isomorphisms|hyperpage}{294}
\indexentry{Isomorphism!Group|hyperpage}{296}
\indexentry{Systems of Linear Equations|hyperpage}{300}
\indexentry{Solution Set|hyperpage}{300}
\indexentry{Elementary Operations on Equations|hyperpage}{301}
\indexentry{Elementary Row Operations|hyperpage}{303}
\indexentry{Row Equivalent Matrices|hyperpage}{303}
\indexentry{Gauss-Jordan Algorithm|hyperpage}{306}
\indexentry{SageMath Note!Matrix Reduction|hyperpage}{307}
\indexentry{Matrix Inversion|hyperpage}{309}
\indexentry{Vector Spaces|hyperpage}{313}
\indexentry{Vector Space|hyperpage}{313}
\indexentry{Linear Combination.|hyperpage}{315}
\indexentry{Generate|hyperpage}{316}
\indexentry{Span|hyperpage}{316}
\indexentry{Linear Independence|hyperpage}{317}
\indexentry{Linear Dependence|hyperpage}{317}
\indexentry{Basis|hyperpage}{317}
\indexentry{Dimension of a Vector Space|hyperpage}{318}
\indexentry{Diagonalization Process, The|hyperpage}{320}
\indexentry{Eigenvalue|hyperpage}{320}
\indexentry{Eigenvector|hyperpage}{320}
\indexentry{Diagonalizable Matrix|hyperpage}{322}
\indexentry{SageMath Note!Matrix Diagonalization|hyperpage}{326}
\indexentry{Fibonacci Sequence!Matrix Representation|hyperpage}{329}
\indexentry{SageMath Note!Matrix Exponential|hyperpage}{332}
\indexentry{Linear Equations!over the Integers Mod 2|hyperpage}{334}
\indexentry{Posets Revisited|hyperpage}{339}
\indexentry{Partial Ordering|hyperpage}{339}
\indexentry{Lower Bound|hyperpage}{339}
\indexentry{Upper Bound|hyperpage}{339}
\indexentry{Greatest Lower Bound|hyperpage}{340}
\indexentry{Least Upper Bound|hyperpage}{340}
\indexentry{Greatest Element|hyperpage}{340}
\indexentry{Least Element|hyperpage}{340}
\indexentry{Divisors of an Integer|hyperpage}{341}
\indexentry{Lattices|hyperpage}{343}
\indexentry{Join|hyperpage}{343}
\indexentry{Meet|hyperpage}{343}
\indexentry{Lattice|hyperpage}{343}
\indexentry{Distributive Lattice|hyperpage}{343}
\indexentry{Boolean Algebras|hyperpage}{345}
\indexentry{Bounded Lattice|hyperpage}{345}
\indexentry{Complement of a Lattice Element|hyperpage}{345}
\indexentry{Complemented Lattice|hyperpage}{345}
\indexentry{Complement of a Lattice Element!as an operation|hyperpage}{346}
\indexentry{Boolean Algebra|hyperpage}{346}
\indexentry{Duality for Boolean Algebras|hyperpage}{347}
\indexentry{Atom of a Boolean Algebra|hyperpage}{349}
\indexentry{covering relation|hyperpage}{350}
\indexentry{Boolean Expressions|hyperpage}{353}
\indexentry{Boolean Expression|hyperpage}{354}
\indexentry{Minterm|hyperpage}{355}
\indexentry{Minterm Normal Form|hyperpage}{355}
\indexentry{Switching Theory|hyperpage}{357}
\indexentry{Logic Design|hyperpage}{357}
\indexentry{Monoids|hyperpage}{365}
\indexentry{Monoid|hyperpage}{365}
\indexentry{Submonoid!Generated by a Set|hyperpage}{366}
\indexentry{Free Monoids and Languages|hyperpage}{368}
\indexentry{Strings over an Alphabet|hyperpage}{368}
\indexentry{Concatenation|hyperpage}{369}
\indexentry{Formal Language|hyperpage}{369}
\indexentry{Recursive Language|hyperpage}{370}
\indexentry{Phrase Structure Grammar|hyperpage}{371}
\indexentry{Regular Grammar|hyperpage}{373}
\indexentry{Automata|hyperpage}{374}
\indexentry{Finite-State Machines|hyperpage}{374}
\indexentry{Finite-State Machine|hyperpage}{375}
\indexentry{Monoid!of a Finite-State Machine|hyperpage}{379}
\indexentry{Machine of a Monoid|hyperpage}{382}
\indexentry{Machine of a Monoid|hyperpage}{382}
\indexentry{Cyclic Group|hyperpage}{385}
\indexentry{Order!of elements of a finite cyclic group|hyperpage}{388}
\indexentry{Chinese Remainder Theorem|hyperpage}{388}
\indexentry{CRT|hyperpage}{388}
\indexentry{Cosets and Factor Groups|hyperpage}{391}
\indexentry{Coset|hyperpage}{392}
\indexentry{Coset Representative|hyperpage}{392}
\indexentry{Partition!of a group by cosets|hyperpage}{393}
\indexentry{Coset Counting Formula|hyperpage}{393}
\indexentry{Lagrange's Theorem|hyperpage}{394}
\indexentry{Cosets!Operation on|hyperpage}{394}
\indexentry{Factor Group|hyperpage}{396}
\indexentry{Permutation Groups|hyperpage}{397}
\indexentry{Symmetric Group|hyperpage}{398}
\indexentry{Cycle Notation|hyperpage}{399}
\indexentry{Disjoint Cycles|hyperpage}{399}
\indexentry{Permutations!Composition|hyperpage}{400}
\indexentry{Transposition|hyperpage}{400}
\indexentry{Alternating Group|hyperpage}{401}
\indexentry{Dihedral Group|hyperpage}{403}
\indexentry{Dihedral Group!Definition|hyperpage}{405}
\indexentry{Normal Subgroups|hyperpage}{406}
\indexentry{Homomorphism!Group|hyperpage}{406}
\indexentry{Normal Subgroups|hyperpage}{406}
\indexentry{Normal Subgroup.|hyperpage}{408}
\indexentry{Homomorphism|hyperpage}{409}
\indexentry{Natural Homomorphism|hyperpage}{410}
\indexentry{Kernel|hyperpage}{410}
\indexentry{Fundamental Theorem of Group Homomorphisms|hyperpage}{411}
\indexentry{Coding Theory|hyperpage}{413}
\indexentry{Codes!Group|hyperpage}{413}
\indexentry{Ring|hyperpage}{419}
\indexentry{Ring!Commutative|hyperpage}{420}
\indexentry{Unity of a Ring|hyperpage}{420}
\indexentry{Ring with unity|hyperpage}{420}
\indexentry{Multiplicative Inverses|hyperpage}{421}
\indexentry{Units!of a ring|hyperpage}{421}
\indexentry{Ring Isomorphism.|hyperpage}{422}
\indexentry{Zero Divisor|hyperpage}{424}
\indexentry{Integral Domain|hyperpage}{425}
\indexentry{Field|hyperpage}{427}
\indexentry{Polynomial over a Ring|hyperpage}{431}
\indexentry{Polynomial Addition|hyperpage}{432}
\indexentry{Polynomial Multiplication|hyperpage}{432}
\indexentry{Division Property for Polynomials|hyperpage}{434}
\indexentry{Factor Theorem|hyperpage}{435}
\indexentry{Irreducibility of a Polynomial|hyperpage}{435}
\indexentry{Reducible Polynomial|hyperpage}{435}
\indexentry{Polynomial!Irreducible|hyperpage}{435}
\indexentry{Polynomial Code|hyperpage}{439}
\indexentry{Code!Polynomial|hyperpage}{439}
\indexentry{Power Series|hyperpage}{441}
\indexentry{Polynomial Units|hyperpage}{443}
\indexentry{Units!of Polynomial Rings|hyperpage}{443}
\indexentry{Power Series Units|hyperpage}{443}
\indexentry{Units!of Power Series Rings|hyperpage}{443}
\indexentry{Determinant!\(1 \times 1\) and a \(2 \times 2\) cases|hyperpage}{457}
\indexentry{Minor|hyperpage}{457}
\indexentry{Cofactor|hyperpage}{458}
\indexentry{Determinant|hyperpage}{458}
\indexentry{Characteristic Polynomial|hyperpage}{458}
\indexentry{References|hyperpage}{545}