Mondstadt to be 500 m, and the constant walking speed of both siblings to be 0.5 m/s, how long until the siblings achieve the greatest separation distance between them? 2. Please refer to the following vectors: A = 6i + 2j - 3k B = 3i - j - 2k C = -i + j - 4k D = j - 3k E = -i + 2k
1. Two siblings, Kaeya and Diluc, decided to take a walk around Mondstadt, following its perimeter guarded by walls. For those who haven't seen Mondstadt, you can imagine it as a city of walls with beautiful German architecture. Let's roughly assume that the walls are encircling it in a perfect circle. Both Kaeya and Diluc started at the front of the huge city gate (marked at 0 degrees), and they walk separately, away from each other. Assuming that radius of the circular city of Mondstadt to be 500 m, and the constant walking speed of both siblings to be 0.5 m/s, how long until the siblings achieve the greatest separation distance between them?
2. Please refer to the following vectors:
A = 6i + 2j - 3k
B = 3i - j - 2k
C = -i + j - 4k
D = j - 3k
E = -i + 2k
F = -5k
G = 2i
H = -3j
I = -4i +4j
Find the projection of vector C on vector D.
Step by step
Solved in 2 steps with 2 images
