Revision as of 10:04, 25 April 2011

MA 265 Chapter 3 Sections 3.1-3.2

To understand determinants, you must first know about permutations.

If D = {1, 2,....,n} a set of integers from 1 to n in ascending order, then a permutation is the rearrangement of an integer in D.

Example:

If D = {6, 7, 8, 9}, then 7689 would be a permutation of D. This corresponds to the function f: D→ D defined by

@@ Line 1: / Line 1: @@
-[[Category:2011 Spring MA 26500 Momin]]
+<br>
-=What are determinants?=
+= MA 265 Chapter 3 Sections 3.1-3.2 =
+= By: Daniel Ford =
+= What are determinants? =
-Put your content here . . .
+To understand determinants, you must first know about permutations.
+If D = {1, 2,....,n} a set of integers from 1 to n in ascending order, then a permutation is the rearrangement of an integer in D.
+'''<u>Example:</u>'''
+If D = {6, 7, 8, 9}, then 7689 would be a permutation of D. &nbsp;This corresponds to the function f: D→ D defined by
-[[ 2011 Spring MA 26500 Momin|Back to 2011 Spring MA 26500 Momin]]
+&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;{{f(1) = 6
+f(2) = 7
+f(3) = 8
+f(4) = 9}}
+<br>
+<br> [[2011 Spring MA 26500 Momin|Back to 2011 Spring MA 26500 Momin]]
+[[Category:2011_Spring_MA_26500_Momin]]