In mathematics and computing, a root-finding algorithm is an algorithm for finding.
A real number x will be called a solution or a root if it satisfies the equation, meaning . It is easy to see that the roots are exactly the x-intercepts of the quadratic function , that is the intersection between the graph of the quadratic function with the x-axis. a<0. a>0. Example 1: Find the roots of the equation.
Finding the root of nonlinear algebraic equations is an issue usually found in engineering and sciences. This article presents a new method for the approximate calculation of the roots of a one-variable function through Monte Carlo Method. This method is actually based on the production of a random number in the target range of the root. Finally, some examples with acceptable error are provided to prove the efficiency of this method.
use the quadratic formula
hope it helps u
mark as brainliest
The roots of the quadratic equation ax2 + bx + c = 0, a ≠0 are given by the following formula: In this formula, the term b2–4ac is called the discriminant. If b2–4ac = 0, then the equation has a single (repeated) root. If b2–4ac > 0, the equation has two real roots.
Step-by-step explanation:hope it helpsfollow me for the more helps
( 1+x )^-n = 1- nx
where n is a rational number
this conditions is applicable if
x <<< 1
hopes it can help you.
don't forgot like