Abstract
It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under the usual identification by binary expansion. This answers a question posed by G. Kalai.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
