2 problems

Packing conjecture. If $p\neq 2$, then

Let $k$ be a positive integer, and apply the simple random greedy algorithm to find a maximal collection of $k$-tuples with pairwise intersections of size at most $k-2$. The uncove…