A plane curve of degree is called \emph{blocking} if every -line in the plane meets at some -point. We prove that the proportion of blocking curves among those of degree is when and . We also show that the same conclusion holds for smooth curves under the somewhat weaker condition and . Moreover, the two events in which a random plane curve is smooth and respectively blocking are shown to be asymptotically independent. Extending a classical result on the number of -roots of random polynomials, we find that the limiting distribution of the number of -points in the intersection of a random plane curve and a fixed -line is Poisson with mean . We also present an explicit formula for the proportion of blocking curves involving statistics on the number of -points contained in a union of lines for .

生成讲解博客的中文版本

生成AI智能校验的中文版本