Search Results for ""

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...

The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...

A number of the form +/-sqrt(a), where a is a positive rational number which is not the square of another rational number is called a pure quadratic surd. A number of the ...

The sign of a real number, also called sgn or signum, is -1 for a negative number (i.e., one with a minus sign "-"), 0 for the number zero, or +1 for a positive number (i.e., ...

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

The maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...