You cannot graph quadratics by finding its zeros: you need a lot more points.
Some quadratics will have no zeros. Having the zeros does not tell you whether the quadratic is open at the top (cup or smiley face) or open at the bottom (cap or grumpy face). Furthermore, it gives no indication as to how far above, or below, the apex is.
Yes, you can determine the zeros of the function ( f(x) = x^2 - 64 ) using a graph. The zeros correspond to the x-values where the graph intersects the x-axis. By plotting the function, you can see that it crosses the x-axis at ( x = 8 ) and ( x = -8 ), which are the zeros of the function.
Translation is moving a graph to the left or right, up or down (or both). Given a quadratic equation of the form y = ax^2 + bx + c, if you substitute u = x - p and v = y - q then the graph of v against u will be the same as the x-y graph, translated to the left by p and downwards by q.
they're not
A scatter graph.
The zeros of functions are the solutions of the functions when finding where a parabola intercepts the x-axis, hence the other names: roots and x-intercepts.
Quadratics that can be written in the form y = a*(x - r)2
6
LOTS- cubic - quadratics - reciprocal - hyperbola - trigonometric - and more
The zeros of a polynomial represent the points at which the graph crosses (or touches) the x-axis.
So the two zeros on a coordinate plane is the origin.
The zeros of a quadratic function, if they exist, are the values of the variable at which the graph crosses the horizontal axis.
They are all the points where the graph crosses (or touches) the x-axis.
You find the equation of a graph by finding an equation with a graph.
The integral zeros of a function are integers for which the value of the function is zero, or where the graph of the function crosses the horizontal axis.
Discuss how you can use the zeros of the numerator and the zeros of the denominator of a rational function to determine whether the graph lies below or above the x-axis in a specified interval?
The fastest algorithm for finding the shortest path in a graph is Dijkstra's algorithm.
Yes, finding the longest path in a graph is an NP-complete problem.