what types of problems can be solved using the greatest common factor and what types of problems can be solved using the least c
1 answer:
You might be interested in
Answer:
He was already 120 km away from Frankfurt so they will meet at 120 + 150 = 370 km away from Frankfurt
Step-by-step explanation:
We are given that the distance between Frankfurt and Prague is 432.5 km.
Distance bw Frankfurt and prague, s(F&P) = 432.5km
Alex left Frankfurt at 10 AM and tavelled at 60 km/hr. At noon i.e 12 PM Michael started traveling from Prague to Frankfurt, which means that Alex travelled 2 hour before Michael started, so lets calculate that distance first.
At 10 AM:
Time travelled by Alex, t = 2hr
Speed, v = 60km/hr
Distance, s(Alex) = v × t = 60 × 2 = 120 km
At noon 12 PM:
Now that Alex has covered 120 km from Frankfurt, he is now 432.5 - 120 = 312.5 km away from Michael at 12 PM.
Distance between Michael and Alex is now 312.5 km
Now Micahel will start moving towards Frankfurt at a speed of 65km/hr
And Alex is also coming towards Prague at a speed of 60km/hr
As they are moving toward eachother their speed will be taken as cumulative.
Speed, v = 65 + 60 = 125
Distance between the two, s = 312.5km
Time t = =
= 2.5 hr
In these 2.5 hr Alex will cover a distance at 60km/hr = 2.5 * 60 = 150
He was already 120 km away from Frankfurt so they will meet at 120 + 150 = 370 km away from Frankfurt
Answer:
the work done by the force field = 24 π
Step-by-step explanation:
From the information given:
r(t) = 3 cos (t)i + 3 sin (t) j + 2 tk
= xi + yj + zk
∴
x = 3 cos (t)
y = 3 sin (t)
z = 2t
dr = (-3 sin (t)i + 3 cos (t) j + 2 k ) dt
Also F(x,y,z) = 6xi + 6yj + 6k
∴ F(t) = 18 cos (t) i + 18 sin (t) j +6 k
Workdone = 0 to 2π ∫ F(t) dr
= 24 π