Search Results for ""

The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...

In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...

The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...

The abundancy of a number n is defined as the ratio sigma(n)/n, where sigma(n) is the divisor function. For n=1, 2, ..., the first few values are 1, 3/2, 4/3, 7/4, 6/5, 2, ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

The essential supremum is the proper generalization to measurable functions of the maximum. The technical difference is that the values of a function on a set of measure zero ...

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...

The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...

An ordinal number is called an initial ordinal if every smaller ordinal has a smaller cardinal number (Moore 1982, p. 248; Rubin 1967, p. 271). The omega_alphas ordinal ...

The representation, beloved of engineers and physicists, of a complex number in terms of a complex exponential x+iy=|z|e^(iphi), (1) where i (called j by engineers) is the ...