benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / Let S be the set of points (a,b) in the coordinate plane, where each of a and b may be −1, 0, or 1. How many distinct lines pass through at least two members of S?

Problem

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

problem

Let SS be the set of points (a,b)(a,b) in the coordinate plane, where each of aa and bb may be −1-1, 0, or 1. How many distinct lines pass through at least two members of SS?
Plain-text mathematical notation (without MathML)
Let S be the set of points (a,b) in the coordinate plane, where each of a and b may be −1, 0, or 1. How many distinct lines pass through at least two members of S?
Original LaTeX notation
Let $S$ be the set of points $(a,b)$ in the coordinate plane, where each of $a$ and $b$ may be $-1$, 0, or 1. How many distinct lines pass through at least two members of $S$?

level

Level 5

type

Counting & Probability

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
1fc31e4e-2ab7-52c2-b0bb-37ce1c5df752
task_key
counting~5fand~5fprobability--test--1fc31e4e-2ab7-52c2-b0bb-37ce1c5df752
task_revision_id
1
config / split
counting_and_probability / test

Official source

initial import