Line 1: | Line 1: | ||
<br> | <br> | ||
− | = MA 265 Chapter 3 Sections 3.1-3.2 = | + | = MA 265 Chapter 3 Sections 3.1-3.2 = |
− | = By: Daniel Ford = | + | = By: Daniel Ford = |
− | = What are determinants? = | + | = What are determinants? = |
− | To understand determinants, you must first know about permutations. | + | 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. | + | 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>''' | + | '''<u>Example:</u>''' |
− | If D = {6, 7, 8, 9}, then 7689 would be a permutation of D. This corresponds to the function f: D→ D defined by | + | If D = {6, 7, 8, 9}, then 7689 would be a permutation of D. This corresponds to the function f: D→ D defined by |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
+ | | ||
+ | <br> | ||
<br> | <br> | ||
Line 26: | Line 23: | ||
<br> [[2011 Spring MA 26500 Momin|Back to 2011 Spring MA 26500 Momin]] | <br> [[2011 Spring MA 26500 Momin|Back to 2011 Spring MA 26500 Momin]] | ||
− | [[Category: | + | [[Category:MA265Spring2011Momin]] |
Revision as of 09:20, 25 April 2011
MA 265 Chapter 3 Sections 3.1-3.2
By: Daniel Ford
What are determinants?
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