answersLogoWhite

0

A cubic function is a smooth function (differentiable everywhere). It has no vertices anywhere.

User Avatar

Wiki User

10y ago

Still curious? Ask our experts.

Chat with our AI personalities

ReneRene
Change my mind. I dare you.
Chat with Rene
CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
TaigaTaiga
Every great hero faces trials, and you—yes, YOU—are no exception!
Chat with Taiga

Add your answer:

Earn +20 pts
Q: How do you find the vertices of a cubic function?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Movies & Television

How can you use the zeros of a function to find the maximum or minimum value of the function?

You cannot. The function f(x) = x2 + 1 has no real zeros. But it does have a minimum.


Given an undirected graph G and an integer k?

Given an undirected graph G=(V,E) and an integer k, find induced subgraph H=(U,F) of G of maximum size (maximum in terms of the number of vertices) such that all vertices of H have degree at least k


What is the maximum number of distinct edges in an undirected graph with N vertices?

Let G be a complete graph with n vertices. Consider the case where n=2. With only 2 vertices it is clear that there will only be one edge. Now add one more vertex to get n = 3. We must now add edges between the two old vertices and the new one for a total of 3 vertices. We see that adding a vertex to a graph with n vertices gives us n more edges. We get the following sequence Edges on a graph with n vertices: 0+1+2+3+4+5+...+n-1. Adding this to itself and dividing by two yields the following formula for the number of edges on a complete graph with n vertices: n(n-1)/2.


A simple graph with n vertices and k components can have atmost how many edges?

In a connected component of a graph with Mi vertices, the maximum number of edges is MiC2 or Mi(Mi-1)/2. So if we have k components and each component has Mi vertices then the maximum number of edges for the graph is M1C2+M2C2+...+MKC2. Of course the sum of Mi as i goes from 1 to k must be n since the sum of the vertices in each component is the sum of all the vertices in the graph which you gave as n. Where MC2 means choose 2 from M and there are M(M-1)/2 ways to do that.


What is the height of 18.8 cubic feet?

Cubic feet is a measure of volume, not length or distance.