Hello, I'm new to this site. I am trying to write a program that will deal with matrices, my problem is in finding a determinate, it would be easy if I limit the usage to 2x2 and 3x3, for which I already know the algorithms. I think that limiting the usage in that way would limit the usefulness of the program. Is there an "easy to program" algorithm for an nXn matrix? I saw something about getting it to upper triangle and multiplying the diagonal numbers together does this work for all matrices?