Search Results for ""
1701 - 1710 of 5719 for Numbered Equation 6Search Results
The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...
The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...
A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...
Let f(x,y) be a homogeneous function of order n so that f(tx,ty)=t^nf(x,y). (1) Then define x^'=xt and y^'=yt. Then nt^(n-1)f(x,y) = ...
The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...
Let X_1 and X_2 be the number of successes in variates taken from two populations. Define p^^_1 = (x_1)/(n_1) (1) p^^_2 = (x_2)/(n_2). (2) The estimator of the difference is ...
Partial derivatives are defined as derivatives of a function of multiple variables when all but the variable of interest are held fixed during the differentiation. (1) The ...
Let N samples be taken from a population with central moments mu_n. The sample variance m_2 is then given by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ is the sample mean. ...
A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...
A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...
...
View search results from all Wolfram sites (314326 matches)

