I'm currently working on a program that does lagrange multipliers, minimizing and maximizing a function given n number of constraints. The problem is that in order for it work, I need to create a system of equations and solve for n number of constants, is there a way to do that with the ti-89? Currently I have split this into multiple programs, one for one constraint (and therefore one constant), one for two constraints and so on but I'd like to make it more efficient. Any help is much appreciated.
First, I have a question: Have you gotten to take Linear Algebra yet? If not, it is some fun stuff that can help you with these kinds of problems :D Basically, make a matrix using the coefficients of your system of equations. For example:
This would turn in to:
[[2 3 4 3 1 5]]
Now you just find the reduced row echelon form of the matrix using the command rref() and it will give you the following:
[[1 0 11/7 0 1 2/7]]
What that tells you is that your first variable ('x' in this case) is 11/7 to solve the system and y=2/7.
I hope that helps! By the way, this works for larger matrices, to. On the calc, it looks like this:
Unfortunately, the rref() command has yet to be filled in for the 68k calcs, but it is basically the same syntax as for the TI-83+/84+ calcs, so here is a link: rref(
47%? Take a look and try to imagine how cool 100% will be. This has won zContest 2011 and made news on TICalc. This compromise between Assembly and BASIC parses like BASIC and is fast like assembly. Grammer 2