{"schema":"vela.problem-packet.v0.1","problem":903,"statement":"Let $n=p^2+p+1$ for some prime power $p$, and let $A_1,\\ldots,A_t\\subseteq \\{1,\\ldots,n\\}$ be a block design (so that every pair $x,y\\in \\{1,\\ldots,n\\}$ is contained in exactly one $A_i$).Is it true that if $t>n$ then $t\\geq n+p$?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}