TOPICS
Search

Search Results for ""


401 - 410 of 1309 for Caracter TableSearch Results
The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...
A surface which a monkey can straddle with both legs and his tail. A simple Cartesian equation for such a surface is z=x(x^2-3y^2), (1) which can also be given by the ...
Symbols used to identify irreducible representations of groups: A= singly degenerate state which is symmetric with respect to rotation about the principal C_n axis, B= singly ...
Two integers n and m<n are (alpha,beta)-multiamicable if sigma(m)-m=alphan and sigma(n)-n=betam, where sigma(n) is the divisor function and alpha,beta are positive integers. ...
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 ...
A generalization of the factorial and double factorial, n! = n(n-1)(n-2)...2·1 (1) n!! = n(n-2)(n-4)... (2) n!!! = n(n-3)(n-6)..., (3) etc., where the products run through ...
In a monoid or multiplicative group where the operation is a product ·, the multiplicative inverse of any element g is the element g^(-1) such that g·g^(-1)=g^(-1)·g=1, with ...
A nialpdrome is a number whose hexadecimal digits are in nonincreasing order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 32, 33, 34, 48, 49, ...
The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...
A square matrix that is not singular, i.e., one that has a matrix inverse. Nonsingular matrices are sometimes also called regular matrices. A square matrix is nonsingular iff ...
1 ... 38|39|40|41|42|43|44 ... 131 Previous Next

...