benchmarks.wiki / Public workspace

Omni-MATH / If 5 points are placed in the plane at lattice points (i.e. points (x,y) where x and y are both integers) such that no three are collinear, then there are 10 triangles whose vertic…

Problem

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

problem

If 5 points are placed in the plane at lattice points (i.e. points (x,y)(x, y) where xx and yy are both integers) such that no three are collinear, then there are 10 triangles whose vertices are among these points. What is the minimum possible number of these triangles that have area greater than 1/21 / 2 ?
Plain-text mathematical notation (without MathML)
If 5 points are placed in the plane at lattice points (i.e. points (x,y) where x and y are both integers) such that no three are collinear, then there are 10 triangles whose vertices are among these points. What is the minimum possible number of these triangles that have area greater than 1/2 ?
Original LaTeX notation
If 5 points are placed in the plane at lattice points (i.e. points $(x, y)$ where $x$ and $y$ are both integers) such that no three are collinear, then there are 10 triangles whose vertices are among these points. What is the minimum possible number of these triangles that have area greater than $1 / 2$ ?

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