benchmarks.wiki / Public workspace

MATH / Let ℓ be the line in space through the points (0,0,1) and (1,1,1). Let d be the length of the shortest possible path that begins at the origin, travels to a point on ℓ, then ends a…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let ℓ\ell be the line in space through the points (0,0,1)(0,0,1) and (1,1,1).(1,1,1). Let dd be the length of the shortest possible path that begins at the origin, travels to a point on ℓ,\ell, then ends at the point (1,0,0).(1,0,0). Enter d2.d^2.
Plain-text mathematical notation (without MathML)
Let ℓ be the line in space through the points (0,0,1) and (1,1,1).  Let d be the length of the shortest possible path that begins at the origin, travels to a point on ℓ, then ends at the point (1,0,0).  Enter d².
Original LaTeX notation
Let $\ell$ be the line in space through the points $(0,0,1)$ and $(1,1,1).$  Let $d$ be the length of the shortest possible path that begins at the origin, travels to a point on $\ell,$ then ends at the point $(1,0,0).$  Enter $d^2.$

level

Level 5

type

Precalculus

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import