Mathematica represents Boolean expressions in symbolic form, so they can not only be evaluated, but also be symbolically manipulated and transformed. Incorporating ...

ChineseRemainder[{r_1, r_2, ...}, {m_1, m_2, ...}] gives the smallest non-negative x that satisfies all the integer congruences x mod m_i = r_i mod m_i.

Mathematica has a flexible system for specifying arbitrary symbolic assumptions about variables. It uses a wide range of sophisticated algorithms to infer the consequences of ...

Built into Mathematica is the world's largest collection of both numerical and symbolic equation solving capabilities—with many original algorithms, all automatically ...

Mathematica's handling of polynomial systems is a tour de force of algebraic computation. Building on mathematical results spanning more than a century, Mathematica for the ...

The primes have been a focal point for investigations of numbers for more than two millennia. Mathematica implements state-of-the-art algorithms for handling both primes and ...

Packing a large number of sophisticated algorithms—many recent and original—into a powerful collection of functions, Mathematica draws on almost every major result in number ...

Primes represents the domain of prime numbers, as in x \[Element] Primes.

BooleanVariables[expr] gives a list of the Boolean variables in the Boolean expression expr.BooleanVariables[bf] gives the number of Boolean variables in the BooleanFunction ...

FrobeniusNumber[{a_1, ..., a_n}] gives the Frobenius number of a_1, ..., a_n.