Search Results for ""

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

An iterated map is a map that is applied repeatedly to an object. The Wolfram Language function NestList[f, expr, n] gives a list of the results of iterating the function f n ...

The Jackson-Slater identity is the q-series identity of Rogers-Ramanujan-type given by sum_(k=0)^(infty)(q^(2k^2))/((q)_(2k)) = ...

The Jacobsthal polynomials are the W-polynomial obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal polynomials are J_1(x) = 1 ...

Jenny's constant is the name given (Munroe 2012) to the positive real constant defined by J = (7^(e-1/e)-9)pi^2 (1) = 867.53090198... (2) (OEIS A182369), the first few digits ...

The composition quotient groups belonging to two composition series of a finite group G are, apart from their sequence, isomorphic in pairs. In other words, if I subset H_s ...

The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...

For positive integer n, the K-function is defined by K(n) = 1^12^23^3...(n-1)^(n-1) (1) = H(n-1), (2) where the numbers H(n)=K(n+1) are called hyperfactorials by Sloane and ...

The expected number of real zeros E_n of a random polynomial of degree n if the coefficients are independent and distributed normally is given by E_n = ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...