Search Results for ""
1081 - 1090 of 2464 for Graph powerSearch Results
A non-zero module which is not the direct sum of two of its proper submodules. The negation of indecomposable is, of course, decomposable. An abstract vector space is ...
Let [a_0;a_1,a_2,...] be the simple continued fraction of a "generic" real number, where the numbers a_i are the partial quotients. Then the Khinchin (or Khintchine) harmonic ...
The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...
A magic square is said to be p-multimagic if the square formed by replacing each element by its kth power for k=1, 2, ..., p is also magic. A 2-multimagic square is called ...
The word multiplicity is a general term meaning "the number of values for which a given condition holds." For example, the term is used to refer to the value of the totient ...
Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...
The symmetric statistic k_(r,s,...) defined such that <k_(r,s,...)>=kappa_rkappa_s..., (1) where kappa_r is a cumulant. These statistics generalize k-statistic and were ...
The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...
The rth sample central moment m_r of a sample with sample size n is defined as m_r=1/nsum_(k=1)^n(x_k-m)^r, (1) where m=m_1^' is the sample mean. The first few sample central ...
SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...
...
View search results from all Wolfram sites (331480 matches)

