One of the important features of Mathematica is its ability to give you exact, symbolic, results for computations. There are, however, computations where it is just ...

BitOr[n_1, n_2, ...] gives the bitwise OR of the integers n_i.

The first argument given to DSolve is the differential equation, the second argument is the unknown function, and the last argument identifies the independent variable. Here ...

BitXor[n_1, n_2, ...] gives the bitwise XOR of the integers n_i.

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

RowReduce[m] gives the row-reduced form of the matrix m.

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.

FromContinuedFraction[list] reconstructs a number from the list of its continued fraction terms.

Since many functions in Mathematica give solutions in the form of rules, you need to be able to use these rules to explore and interpret your results. Although many of the ...

MultiplicativeOrder[k, n] gives the multiplicative order of k modulo n, defined as the smallest integer m such that k^m \[Congruent] 1 mod n. MultiplicativeOrder[k, n, {r_1, ...