answersLogoWhite

0

v1 = initial velocity

v2 = final velocity

User Avatar

Wiki User

8y ago

Still curious? Ask our experts.

Chat with our AI personalities

RossRoss
Every question is just a happy little opportunity.
Chat with Ross
LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
More answers

usually v1 is initial speed and v2 final speed

User Avatar

Wiki User

8y ago
User Avatar

Add your answer:

Earn +20 pts
Q: In the acceleration equation what do v1 and v2 represent?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Other Math

How does one rearrange the acceleration formula for time?

Delta "T"=V2-V1 ---- A


What is the angle in degrees for 60 degrees of declination?

1. If V1 and V2 be two vectors at 900 from each other, having magnitudes of 10 and 20 units each, what will be the value of V1.V2 ?


Can unit vector have negative component?

Yes, a unit vector can have negative component since a unit vector has same magnitude and direction as a negative unit vector. Here is the general work out of the problem: Let |v| be the norm of (v1, v2). Then, the unit vector is (v1/|v|, v2/|v|). Determine the "modulus" or the norm |(v1/|v|, v2/|v|)| to get 1, which is the new norm. If we determine the norm of |(-v1/|v|, -v2/|v|)|, we still have the same norm 1.


How do you calculate a percentage increase of 3624 and 8236 in two decimals?

Calculate percentage changefrom V1 = 3624 to V2 = 8236[ ((V2 - V1) / |V1|) * 100 ]= ((8236 - 3624) / |3624|) * 100= (4612 / 3624) * 100= 1.272627 * 100= 127.2627% change= 127.26% increase.


What is a compound graph?

A Compound Graph is an extension of a standard graph. Let G be a graph, G=(V,E) where V is a set of vertices and E is a set of edges, that is e = (v1, v2) in V2 A compound graph C is defined by a tree T=(V,F) where V is the same set as G and F are tree edges f=(v1,v2) in V2. C=(G,T) where G=(V,E) and T=(V,F) Furthermore, C has two additional constraints: e=(v1,v2) in E implies: 1) v1 is not on the path of v2 to the root of T AND 2) v2 is not on the path of v1 to the root of T. Intuitively, T defines a hierarchy. All the vertices sharing the same parent in T are in the same "group". The constraints state that you cannot have an edge connecting a vertex to one of its parent in the hierarchy.