answersLogoWhite

0

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.

User Avatar

Wiki User

8y ago

What else can I help you with?

Related Questions

Which of the quadratics has a graph with only one x-intercept?

Quadratics that can be written in the form y = a*(x - r)2


A function whose graph is not a straight line?

LOTS- cubic - quadratics - reciprocal - hyperbola - trigonometric - and more


Which of the quadratics has a graph with x-intercepts of 5 and -1?

6


What do the zeros of a polynomial function represent on a graph?

The zeros of a polynomial represent the points at which the graph crosses (or touches) the x-axis.


When does a graph have 2 zeros?

So the two zeros on a coordinate plane is the origin.


How can you use a graph to find zeros of a quadratic function?

The zeros of a quadratic function, if they exist, are the values of the variable at which the graph crosses the horizontal axis.


How do you find the zeros in an equation by looking on a graph?

They are all the points where the graph crosses (or touches) the x-axis.


How do you find the equation of a graph?

You find the equation of a graph by finding an equation with a graph.


What are integral zeros?

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.


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 specific interval?

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?


What is the fastest algorithm for finding the shortest path in a graph?

The fastest algorithm for finding the shortest path in a graph is Dijkstra's algorithm.


Is finding the longest path in a graph an NP-complete problem?

Yes, finding the longest path in a graph is an NP-complete problem.