# Groovy Determinants

Discussion in 'Math' started by Sparky49, Sep 28, 2012.

1. ### Sparky49 Thread Starter Well-Known Member

Jul 16, 2011
822
421
Hi everyone.

I've been doing determinants at school, however I've come across one which is making my head spin.

We've been told to simplify them as much as possible, adding or subtracting rows, columns together, taking factors out, etc to get as many 1's and 0's as possible so we can take out factors to construct a determinant.

However, I am really stuck on this bad boy.

I've tried adding the bottom row to the middle, then to the top, but I get an extra a^2, subtracting columns, rows etc, but everything I've tried so far has left me with just one factor out of place!

I would appreciate some help and guidance with this, please. I realise that it's going to look ugly before any nice happens, but I can only get to dead ends.

Sparky

File size:
16.6 KB
Views:
21

Feb 20, 2011
2,373
1,353
3. ### Sparky49 Thread Starter Well-Known Member

Jul 16, 2011
822
421
No, although I can follow the instructions there.

If anyone can spot how to find the determinant by adding/subtracting rows and columns, I'd be very impressed.

Sparky.

4. ### DerStrom8 Well-Known Member

Feb 20, 2011
2,373
1,353
Once you get into 3rd and 4th power determinants, I don't think it's as simple as adding/subtracting rows and columns. I'm not sure if this is the method you're looking for, but it works. I believe it's called the laplace expansion method, but I could be thinking of something else:

Code ( (Unknown Language)):
1. | a  b  c |     | e f |     | d f |     | d e |
2. | d  e  f | = a | h i | - b | g i | + c | g h |
3. | g  h  i |
Can you see how that works? You basically have to split the array up into smaller parts, and multiply it by a corresponding value in the first row. You can add them together (switching the signs each time, though--that's very important) and solve it that way. If you look at the example, you'll see the pattern.

Here's an example I just found of one being done using this method:

Last edited: Sep 28, 2012