Search Results for ""

A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...

Sample size is the number of observations in a sample (Evans et al. 2000, p. 16). It is commonly denoted n or N.

Let h be the number of sides of certain skew polygons (Coxeter 1973, p. 15). Then h=(2(p+q+2))/(10-p-q).

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...

A random number which lies within a specified range (which can, without loss of generality, be taken as [0, 1]), with a uniform distribution.

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...

A repunit prime is a repunit (i.e., a number consisting of copies of the single digit 1) that is also a prime number. The base-10 repunit (possibly probable) primes ...

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).