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 ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

A pair of consecutive primes whose digits are rearrangements of each other, first considered by A. Edwards in Aug. 2001. The first few are (1913, 1931), (18379, 18397), ...

A proof or demonstration is said to be rigorous if the validity of each step and the connections between the steps is explicitly made clear in such a way that the result ...

The logical axiom R(x,y)=!(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes OR, that, when taken together with associativity and commutativity, is equivalent ...

Rubik's group is the group corresponding to possible rotations of a Rubik's Cube. There are six possible rotations, each corresponding to a generator of the group, and the ...

An analytic function f on the unit disk is called schlicht if 1. f is one-to-one, 2. f(0)=0, and 3. f^'(0)=1, in which case it is written f in S. Schlicht functions have ...

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.

One of the disjoint subsets making up a set partition. A block containing n elements is called an n-block. The partitioning of sets into blocks can be denoted using a ...

The geometry of the Lie group R semidirect product with R^2, where R acts on R^2 by (t,(x,y))->(e^tx,e^(-t)y).