benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Consider a 2×n grid of points and a path consisting of 2n−1 straight line segments connecting all these 2n points, starting from the bottom left corner and ending at the upper righ…

Problem

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

problem

Consider a 2×n2 \times n grid of points and a path consisting of 2n−12 n-1 straight line segments connecting all these 2n2 n points, starting from the bottom left corner and ending at the upper right corner. Such a path is called efficient if each point is only passed through once and no two line segments intersect. How many efficient paths are there when n=2016n=2016 ?
Plain-text mathematical notation (without MathML)
Consider a 2×n grid of points and a path consisting of 2n−1 straight line segments connecting all these 2n points, starting from the bottom left corner and ending at the upper right corner. Such a path is called efficient if each point is only passed through once and no two line segments intersect. How many efficient paths are there when n=2016 ?
Original LaTeX notation
Consider a $2 \times n$ grid of points and a path consisting of $2 n-1$ straight line segments connecting all these $2 n$ points, starting from the bottom left corner and ending at the upper right corner. Such a path is called efficient if each point is only passed through once and no two line segments intersect. How many efficient paths are there when $n=2016$ ?

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

task_id
bb696d72-ad21-52eb-884c-dad9b4e25e71
task_key
test--bb696d72-ad21-52eb-884c-dad9b4e25e71
task_revision_id
1
config / split
/ test

Official source

initial import