Search Results for ""

A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The logarithm of the reciprocal of a number, equal to the negative of the logarithm of the number itself, cologx=log(1/x)=-logx.

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

Complex analysis is the study of complex numbers together with their derivatives, manipulation, and other properties. Complex analysis is an extremely powerful tool with an ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...

The area of a rational right triangle cannot be a square number. This statement is equivalent to "a congruum cannot be a square number."

The number sign # sometimes used in mathematics to indicate the number of a quantity satisfying some condition, e.g., #{n:n>1}. The symbol is also used to denote a primorial.

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).