equation

I am trying to write a function in C++ that solves for X using the quadratic equation. This is what I have written initially, which seems to work as long as there are no complex numbers for an answer: float solution1 = (float)(-1.0 * b) + (sqrt((b * b) - (4 * a * c))); solution1 = solution1 / (2*a); cout << "Solution 1: " << solution1 << endl; float solution2 = (float)(-b) - (sqrt((b*b) - (4 * a * c))); solution2 = solution2 / (2*a); cout << "Solution 2: " << solution2; If, for example, I use the equation: x^2 - x - 6, I get the solution 3, -2 correctly. My question is how would I account for

I'm using Mathjax to display equations in a web application done in PHP/Ajax. The equations are rendered correctly when the page is loaded first.In the same page, when user clicks a button, an ajax code works to fetch some data from database and display it on the same page.But, there the equations are not displaying correctly, instead the latex code is shown as such.But if i refresh the page, then the equations are rendered correctly.How can i solve this issue? Davide Cervone See the MathJax documentation on modifying math on the page for details. 来源： https://stackoverflow.com/questions

I'm writing a program in python and in it I need to find the roots of a function that is: a*x^n + b*x -c = 0 where a and b are constants that are calculated earlier in the program but there are several thousand of them. I need to repeat this equation twice for all values of a and b once with n = 77/27 and once with n = 3 . How can i do this in python? I checked numpy.roots(p) and that would work for when n = 3 I think. But for n = 77/27 how would I be able to do that? I think your beast choice is scipy.optimize.brentq() : def f(x, n, a, b, c): return a * x**n + b * x - c print scipy.optimize

We are using a programming language that does not have a linear regression function in it. We have already implemented a single variable linear equation: y = Ax + B and have simply calculated the A and B coefficents from the data using a solution similar to this Stack Overflow answer . I know this problem gets geometrically harder as variables are added, but for our purposes, we only need to add one more: z = Ax + By + C Does anyone have the closed form equations, or code in any language that can solve for A, B and C given an array of x, y, and z's? so you have three linear equations k = aX1 +

Is there a JavaScript library or function that will solve equations for variables? Such as 9 = 3 + x and solve for x. But it should also solve more advanced equations that include sine, cosine, and tangent. You can approximate the solution by doing what excel calls "Goal Seek" - testing values for x until both sides of the equation approximately match. You can do this by splitting the equation by the "=" sign, replacing each occurence of x with a value, eval ing both sides, and determining if the difference falls below a certain threshold. While relatively simple, there are flaws to this

Possible Duplicate: I need a fast runtime expression parser How do I make it that when someone types in x*y^z in a textbox on my page to calculate that equation in the code behind and get the result? .NET does not have a built-in function for evaluating arbitrary strings. However, an open source .NET library named NCalc does. NCalc is a mathematical expressions evaluator in .NET. NCalc can parse any expression and evaluate the result, including static or dynamic parameters and custom functions. Greg Answer from operators as strings by user https://stackoverflow.com/users/1670022/matt-crouch :