MHB What is the distance of closest approach

  • Thread starter Thread starter Another1
  • Start date Start date
  • Tags Tags
    Approach
Another1
Messages
39
Reaction score
0
Ln1.png


from problem I find \[ r = r_0 + At \] \[ x_0 = 3 + 2t\] \[ y_0 = -1 - 2t\] \[ z_0 = 1 + t\] and \[ A = (2,-2,1)\]
but i don't understand What is the distance of closest approach?
someone tell me to a formula please.
 
Physics news on Phys.org
If $P$ is a point in space, and $L$ is the line $r(t) = \vec{r_0} + \vec{A} t$ , then

$d(P,L) = \dfrac{|\vec{Pr_0} \times \vec{A} |}{|\vec{A}|}$
 
Another said:
View attachment 10653
from problem I find \[ r = r_0 + At \] \[ x_0 = 3 + 2t\] \[ y_0 = -1 - 2t\] \[ z_0 = 1 + t\] and \[ A = (2,-2,1)\]

you haven't actually written the path in the form r= r0+ At. It is, of course, r= <3, -1, 1>+ <2, -2, 1>t.
but i don't understand What is the distance of closest approach?

someone tell me to a formula please.

It is the shortest possible distance from a point, (x(t), y(t), z(r)), on the graph to the origin, (0, 0, 0). The "formula" you want is the distance formula. The distance from (x, y, z) to the origin is $\sqrt{x^2+ y^2+ z^2}$. "Minimizing" that distance is the same as minimizing the square- $x^2+ y^2+ z^2= (3+ 2t)^2+ (-1- 2t)^2+ (1+ t)^2= 9+ 12t+ 4t^2+ 1+ 4t+ 4t^2+ 1+ 2t+ t^2= 11+ 18t+ 10t^2$. You can minimize that by setting the derivative equal to 0 or by "completing the square".
To complete the square, $10t^2+ 18t+ 11= 10(t^2+ 1.8t)+ 11= 10(t^2+ 1.8t+ 0.81- 0.81)+ 11= 10(t+ .9)^2- 8.1+ 11= 10(t+ .9)^2+ 2.9. Since a square is never negative, that is smallest when t= -0.9 where its value is 2.9.
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...

Similar threads

Replies
10
Views
850
Replies
1
Views
2K
Replies
3
Views
2K
Replies
11
Views
3K
Replies
33
Views
2K
Replies
3
Views
1K
Back
Top