Just as you look at it, the only factor common to all three terms is 'x'.
So you can factor the 'x' out and make the equation . . .
x (3x²-19x - 14) = 0
Right there, that tells you that [ x = 0 ] is a solution of the original equation.
But you're not looking for solutions, you're looking for factors, so you continue.
What about that ugly trinomial: [ 3x² - 19x - 14 ] ? Can that be factored ?
Not easily. But if you stuff it into the quadratic equation, you'll find two solutions
to the equation
3x² - 19x - 14 = 0
and you'll recall that (x - a solution) is a factor of the left side.
So you can find the remaining two factors of the original trinomial.
The answer is -48.
You have to plug in -6 where x is.
Answer:
1/4(8+m)
Step-by-step explanation:
this is your answer for sure
Answer:
p < -7
Step-by-step explanation:
.................
Answer:
The running time is quadratic (O(n²) )
Step-by-step explanation:
For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is
C + T(n) + n*(a*n+b) = an²+bn + T + C
Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).
