Search Results for ""
1651 - 1660 of 1944 for Hundred Dollar Hundred Digit Challenge P...Search Results
The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...
A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...
If a matrix A has a matrix of eigenvectors P that is not invertible (for example, the matrix [1 1; 0 1] has the noninvertible system of eigenvectors [1 0; 0 0]), then A does ...
The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...
A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...
Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...
The Steiner deltoid is the envelope of the Simson lines of a triangle. Its circumcircle is the Steiner circle, and its incircle is the nine-point circle. The triangle formed ...
A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...
A number n such that sigma^2(n)=sigma(sigma(n))=2n, where sigma(n) is the divisor function is called a superperfect number. Even superperfect numbers are just 2^(p-1), where ...
The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...
...
View search results from all Wolfram sites (27602 matches)

