Search Results for ""
241 - 250 of 13134 for Order TheorySearch Results
A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...
A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...
Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...
The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...
This theorem states that, for a partial differential equation involving a time derivative of order n, the solution is uniquely determined if time derivatives up to order n-1 ...
A linear ordinary differential equation of order n is said to be homogeneous if it is of the form a_n(x)y^((n))+a_(n-1)(x)y^((n-1))+...+a_1(x)y^'+a_0(x)y=0, (1) where ...
A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...
A multimagic square such that the first, second, third, fourth, and fifth powers of the elements all yield magic squares is known as a pentamagic square. The first known ...
A formula of first-order logic is in prenex normal form if it is of the form Q_1x_1...Q_nx_nM, (1) where each Q_i is a quantifier forall ("for all") or exists ("exists") and ...
The constants lambda_(m,n)=inf_(r in R_(m,n))sup_(x>=0)|e^(-x)-r(x)|, where r(x)=(p(x))/(q(x)), p and q are mth and nth order polynomials, and R_(m,n) is the set of all ...
...
View search results from all Wolfram sites (44093 matches)

