Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • 1
    $\begingroup$ Yes exactly, I want the shortest distance between their graphs. Thank you for the answer! Also, is there a way to solve this without using Minimize? $\endgroup$ Commented May 3, 2022 at 17:05
  • $\begingroup$ @Lentato: I don't think so: "shortest distance" needs minimization. $\endgroup$ Commented May 3, 2022 at 17:16
  • 2
    $\begingroup$ @Lentato: In principle you could use a combination of Grad and Solve/NSolve to tell Mathematica to solve the equations $\partial f/\partial x_1 = 0$ and $\partial f/\partial x_2 = 0$, where $f$ is the distance between the points $(x_1, f_1(x_1))$ and $(x_2, f(x_2))$. But that's one of the algorithms that Mathematica tries when you invoke Minimize/NMinimize anyhow. $\endgroup$ Commented May 3, 2022 at 17:37
  • $\begingroup$ The constraint x2 > 0 is not needed. $\endgroup$ Commented May 3, 2022 at 21:42