Search Results for ""

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The series with sum sum_(n=0)^infty1/(F_(2^n))=1/2(7-sqrt(5)), where F_k is a Fibonacci number (Honsberger 1985).

The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...

If r experiments are performed with n_i possible outcomes for each experiment i=1,2,...,r, then there are a total of product_(i=1)^(r)n_i possible outcomes.

A fractal process for which H>1/2, so r>0.

A smooth manifold with a Poisson bracket defined on its function space.

Possessing a three equivalent modes.