Is there a way to trick the java code into solving algebra problems, others than for:
ax + b = cx + d; and ax2 + bx + c = 0 ?
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
Is there a way to trick the java code into solving algebra problems, others than for:
ax + b = cx + d; and ax2 + bx + c = 0 ?
There are some private party packages that will evaluate some expressions.
Don't know about simultaneous(??) equations
Google it.
Depends on how much functionality you want in.
For a Linear System of equations, you can easily implement some sort of algorithm to compute a Reduced Row Echelon matrix, or implement an iterative Linear Algebra solver (I put 2 such implementations here), just note that iterative solvers are not always guaranteed to give you the answer if there is one.
For higher-powered algebra calculations, the "easiest" method would be to implement a computer algebra system/solver or CAS (note: this is used extremely lightly. CAS's are extremely difficult to implement well). I believe there is one implementation here in Java, you probably can dig through the source code there.
edit:
Polynomial solvers shouldn't be too difficult to implement, either. Do a google search and you'll probably find some along with algorithms to solve them numerically.
Have you tried JEval?