erdős #669 · orchard problems
Let be minimal such that for any points in there exist at most many distinct lines passing through at least of the points, and similarly but with lines passing through exactly points.Estimate and - in particular, determine and .
Worked, still open.
geometry · open · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let (P\subset \mathbb R^2) with (|P|=n). Write [ t_j(P):=|\\{\text{lines }\ell:\ |\ell\cap P|=j\\}|,\qquad T_k(P):=|\\{\text{lines }\ell:\ |\ell\cap P|\ge k\\}|=\sum_{j\ge k} t_j(P). ] Then your extremal functions are [ f_k(n)=\max_{|P|=n} t_k(P),\qquad F_k(n)=\max_{|P|=n} T_k(P)=\max_{|P|=n}\sum_{j\ge k} t_j(P). ]
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗oeis
links
Create a formalisation here · link
#101Given points in , no five of which are on a line, the number of lines containing four points is .A006065#588Let be minimal such that if points in have no points on a line then there must be at most many lines containing at least points. Is it true thatfor ?A006065status
open