Find the point that is at distance $1$ from $(0,0,0)$ and at distance $3$ from $(1,2,3)$ that is closest to...
$begingroup$
I have this question :
Find the point that is at distance $1$ from $(0,0,0)$ and at distance $3$ from $(1,2,3)$ that is closest to $(5,-2,4)$.
Here is my failed attempt.
I used Lagrange multipliers and the fact that the determinant of matrix is 0 when we have non trivial solution. the quad equation went bad
geometry optimization analytic-geometry nonlinear-optimization lagrange-multiplier
$endgroup$
add a comment |
$begingroup$
I have this question :
Find the point that is at distance $1$ from $(0,0,0)$ and at distance $3$ from $(1,2,3)$ that is closest to $(5,-2,4)$.
Here is my failed attempt.
I used Lagrange multipliers and the fact that the determinant of matrix is 0 when we have non trivial solution. the quad equation went bad
geometry optimization analytic-geometry nonlinear-optimization lagrange-multiplier
$endgroup$
add a comment |
$begingroup$
I have this question :
Find the point that is at distance $1$ from $(0,0,0)$ and at distance $3$ from $(1,2,3)$ that is closest to $(5,-2,4)$.
Here is my failed attempt.
I used Lagrange multipliers and the fact that the determinant of matrix is 0 when we have non trivial solution. the quad equation went bad
geometry optimization analytic-geometry nonlinear-optimization lagrange-multiplier
$endgroup$
I have this question :
Find the point that is at distance $1$ from $(0,0,0)$ and at distance $3$ from $(1,2,3)$ that is closest to $(5,-2,4)$.
Here is my failed attempt.
I used Lagrange multipliers and the fact that the determinant of matrix is 0 when we have non trivial solution. the quad equation went bad
geometry optimization analytic-geometry nonlinear-optimization lagrange-multiplier
geometry optimization analytic-geometry nonlinear-optimization lagrange-multiplier
edited Dec 6 '18 at 21:52
Batominovski
33k33293
33k33293
asked Dec 6 '18 at 21:47
Razi AwadRazi Awad
124
124
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You have done great so far. The only thing left is to substitute $x=dfrac{57z-33}{17}$ and $y=dfrac{42-54z}{17}$ into $x^2+y^2+z^2=1$. In other words, you have
$$frac{2(3227z^2-4149z+1282)}{289}=0,.$$
From this horrendous quadratic equation, you solve it using the famous quadratic formula, but not without pain, and obtain
$$z=frac{4149pm17sqrt{2305}}{6454},.$$
That is,
$$x=frac{3(461pm19sqrt{2305})}{6454}$$
and
$$y=frac{3(461mp9sqrt{2305})}{3227},.$$
Therefore, the distances to $(5,-2,4)$ from these optimizing points are $$sqrt{frac{283mpsqrt{2305}}{7}},.$$
Thus, the minimizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461+19sqrt{2305})}{6454},frac{3(461-9sqrt{2305})}{3227},frac{4149+17sqrt{2305}}{6454}right)}\&approx(0.638,0.027,0.769),,end{align}$$
yielding the minimum distance $sqrt{dfrac{283-sqrt{2305}}{7}}approx5.794$. On the other hand, the maximizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461-19sqrt{2305})}{6454},frac{3(461+9sqrt{2305})}{3227},frac{4149-17sqrt{2305}}{6454}right)}\&approx(-0.210,0.830,0.516),,end{align}$$
yielding the maximum distance $sqrt{dfrac{283+sqrt{2305}}{7}}approx6.877$.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029090%2ffind-the-point-that-is-at-distance-1-from-0-0-0-and-at-distance-3-from%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You have done great so far. The only thing left is to substitute $x=dfrac{57z-33}{17}$ and $y=dfrac{42-54z}{17}$ into $x^2+y^2+z^2=1$. In other words, you have
$$frac{2(3227z^2-4149z+1282)}{289}=0,.$$
From this horrendous quadratic equation, you solve it using the famous quadratic formula, but not without pain, and obtain
$$z=frac{4149pm17sqrt{2305}}{6454},.$$
That is,
$$x=frac{3(461pm19sqrt{2305})}{6454}$$
and
$$y=frac{3(461mp9sqrt{2305})}{3227},.$$
Therefore, the distances to $(5,-2,4)$ from these optimizing points are $$sqrt{frac{283mpsqrt{2305}}{7}},.$$
Thus, the minimizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461+19sqrt{2305})}{6454},frac{3(461-9sqrt{2305})}{3227},frac{4149+17sqrt{2305}}{6454}right)}\&approx(0.638,0.027,0.769),,end{align}$$
yielding the minimum distance $sqrt{dfrac{283-sqrt{2305}}{7}}approx5.794$. On the other hand, the maximizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461-19sqrt{2305})}{6454},frac{3(461+9sqrt{2305})}{3227},frac{4149-17sqrt{2305}}{6454}right)}\&approx(-0.210,0.830,0.516),,end{align}$$
yielding the maximum distance $sqrt{dfrac{283+sqrt{2305}}{7}}approx6.877$.
$endgroup$
add a comment |
$begingroup$
You have done great so far. The only thing left is to substitute $x=dfrac{57z-33}{17}$ and $y=dfrac{42-54z}{17}$ into $x^2+y^2+z^2=1$. In other words, you have
$$frac{2(3227z^2-4149z+1282)}{289}=0,.$$
From this horrendous quadratic equation, you solve it using the famous quadratic formula, but not without pain, and obtain
$$z=frac{4149pm17sqrt{2305}}{6454},.$$
That is,
$$x=frac{3(461pm19sqrt{2305})}{6454}$$
and
$$y=frac{3(461mp9sqrt{2305})}{3227},.$$
Therefore, the distances to $(5,-2,4)$ from these optimizing points are $$sqrt{frac{283mpsqrt{2305}}{7}},.$$
Thus, the minimizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461+19sqrt{2305})}{6454},frac{3(461-9sqrt{2305})}{3227},frac{4149+17sqrt{2305}}{6454}right)}\&approx(0.638,0.027,0.769),,end{align}$$
yielding the minimum distance $sqrt{dfrac{283-sqrt{2305}}{7}}approx5.794$. On the other hand, the maximizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461-19sqrt{2305})}{6454},frac{3(461+9sqrt{2305})}{3227},frac{4149-17sqrt{2305}}{6454}right)}\&approx(-0.210,0.830,0.516),,end{align}$$
yielding the maximum distance $sqrt{dfrac{283+sqrt{2305}}{7}}approx6.877$.
$endgroup$
add a comment |
$begingroup$
You have done great so far. The only thing left is to substitute $x=dfrac{57z-33}{17}$ and $y=dfrac{42-54z}{17}$ into $x^2+y^2+z^2=1$. In other words, you have
$$frac{2(3227z^2-4149z+1282)}{289}=0,.$$
From this horrendous quadratic equation, you solve it using the famous quadratic formula, but not without pain, and obtain
$$z=frac{4149pm17sqrt{2305}}{6454},.$$
That is,
$$x=frac{3(461pm19sqrt{2305})}{6454}$$
and
$$y=frac{3(461mp9sqrt{2305})}{3227},.$$
Therefore, the distances to $(5,-2,4)$ from these optimizing points are $$sqrt{frac{283mpsqrt{2305}}{7}},.$$
Thus, the minimizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461+19sqrt{2305})}{6454},frac{3(461-9sqrt{2305})}{3227},frac{4149+17sqrt{2305}}{6454}right)}\&approx(0.638,0.027,0.769),,end{align}$$
yielding the minimum distance $sqrt{dfrac{283-sqrt{2305}}{7}}approx5.794$. On the other hand, the maximizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461-19sqrt{2305})}{6454},frac{3(461+9sqrt{2305})}{3227},frac{4149-17sqrt{2305}}{6454}right)}\&approx(-0.210,0.830,0.516),,end{align}$$
yielding the maximum distance $sqrt{dfrac{283+sqrt{2305}}{7}}approx6.877$.
$endgroup$
You have done great so far. The only thing left is to substitute $x=dfrac{57z-33}{17}$ and $y=dfrac{42-54z}{17}$ into $x^2+y^2+z^2=1$. In other words, you have
$$frac{2(3227z^2-4149z+1282)}{289}=0,.$$
From this horrendous quadratic equation, you solve it using the famous quadratic formula, but not without pain, and obtain
$$z=frac{4149pm17sqrt{2305}}{6454},.$$
That is,
$$x=frac{3(461pm19sqrt{2305})}{6454}$$
and
$$y=frac{3(461mp9sqrt{2305})}{3227},.$$
Therefore, the distances to $(5,-2,4)$ from these optimizing points are $$sqrt{frac{283mpsqrt{2305}}{7}},.$$
Thus, the minimizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461+19sqrt{2305})}{6454},frac{3(461-9sqrt{2305})}{3227},frac{4149+17sqrt{2305}}{6454}right)}\&approx(0.638,0.027,0.769),,end{align}$$
yielding the minimum distance $sqrt{dfrac{283-sqrt{2305}}{7}}approx5.794$. On the other hand, the maximizing point is
$$begin{align}(x,y,z)&={smallleft(frac{3(461-19sqrt{2305})}{6454},frac{3(461+9sqrt{2305})}{3227},frac{4149-17sqrt{2305}}{6454}right)}\&approx(-0.210,0.830,0.516),,end{align}$$
yielding the maximum distance $sqrt{dfrac{283+sqrt{2305}}{7}}approx6.877$.
edited Dec 6 '18 at 22:29
answered Dec 6 '18 at 22:23
BatominovskiBatominovski
33k33293
33k33293
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029090%2ffind-the-point-that-is-at-distance-1-from-0-0-0-and-at-distance-3-from%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown