It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai.
生成讲解博客的中文版本
生成AI智能校验的中文版本