Under the auspices of the Computational Complexity Foundation (CCF)
We show that the ''majority is least stable'' conjecture is true for n=1 and 3 and false for all odd n\geq 5.
