At most two conditions are true:

Convert to a disjunctive normal form:

Specify that f is true when at most 2 arguments are true:

Exactly 2 arguments are true:

Between 2 and 3 arguments are true:

1, 3, or 5 arguments are true:

Specify that f is true when exactly 1, 4, or 5 arguments are true:

BooleanCountingFunction is by default preserved in function form:

Use BooleanConvert to convert to other forms:

BooleanCountingFunction is automatically converted when given an explicit list of variables:

The expanded forms can be large when the number of variables grows:

The performance gain in evaluating the function form can be substantial:

Constant arguments are reduced:

Extreme cases are automatically converted to formulas:

Create new primitives that are true when at most, at least, or exactly k arguments are true:

Create a number of disk regions along the unit circle:

Show the newly combined regions:

Integrate over these regions:

Define a Boolean function that is true when the number of true arguments is k modulo m:

When k=0 and m=2, you get Xnor:

When k=1 and m=2, you get Xor:

For other values of k and m, you get new functionality:

The 2D truth table:

Define a Boolean function that sorts a list of truth values:

The resulting list is always in sorted order:

Find the mean time to failure for a system that needs two out of three components to work:

BooleanCountingFunction is symmetric in its arguments:

Logical combinations of BooleanCountingFunction correspond to set operations on indices:

The basic specification can equivalently be specified using Range:

Many primitives can be expressed in terms of BooleanCountingFunction:

And:

Or:

Nand:

Nor:

Xor:

Xnor:

Equivalent:

Majority:

The size of the truth set for BooleanCountingFunction is the length of Subsets:

The size of the truth set for BooleanCountingFunction can be given by a combinatorial sum:

BooleanCountingFunction for when exactly i variables are true has disjoint truth sets: