FiniteAbelianGroupCount[n] gives the number of finite Abelian groups of order n.
Although Diophantine equations provide classic examples of undecidability, Mathematica in practice succeeds in solving a remarkably wide range of such equations—automatically ...
$MaxPiecewiseCases gives the maximum number of cases to allow in explicit Piecewise objects generated by expanding any single piecewise function.
DigitBlock is an option for NumberForm and related functions that specifies the maximum length of blocks of digits between breaks.
StirlingS2[n, m] gives the Stirling number of the second kind \[ScriptCapitalS]_n^(m).
A Frobenius equation is an equation of the form where a_1, …, a_n are positive integers, m is an integer, and the coordinates x_1, …, x_n of solutions are required to be ...
$KernelID is a unique ID number assigned to each running parallel kernel.
BaseForm[expr, n] prints with the numbers in expr given in base n.
$MachinePrecision gives the number of decimal digits of precision used for machine-precision numbers.
Mathematica works with both exact quantities and approximate numbers. Using N , you can obtain a numerical approximation to an exact quantity with any desired precision or ...