Search Results for ""

A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...

An even number of the form 4n+2 (i.e., an integer which is divisible by 2 but not by 4). The first few for n=0, 1, 2, ... are 2, 6, 10, 14, 18, ... (OEIS A016825)

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The associated Stirling numbers of the first kind d_2(n,k)=d(n,k) are defined as the number of permutations of a given number n having exactly k permutation cycles, all of ...

A binomial number is a number of the form a^n+/-b^n, where a,b, and n are integers. Binomial numbers can be factored algebraically as ...

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

A simple way to describe a knot projection. The advantage of this notation is that it enables a knot diagram to be drawn quickly. For an oriented alternating knot with n ...

The limiting rabbit sequence written as a binary fraction 0.1011010110110..._2 (OEIS A005614), where b_2 denotes a binary number (a number in base-2). The decimal value is ...

The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...