Search Results for ""

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

A condition which, if true, guarantees that a result is also true. (However, the result may also be true if the condition is not met.) If a condition is both necessary and ...

If P(n) is a sentential formula depending on a variable n ranging in a set of real numbers, the sentence P(n) for every sufficiently large n (1) means exists N such that P(n) ...

A sultan has granted a commoner a chance to marry one of his n daughters. The commoner will be presented with the daughters one at a time and, when each daughter is ...

A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...

A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...

A sum is the result of an addition. For example, adding 1, 2, 3, and 4 gives the sum 10, written 1+2+3+4=10. (1) The numbers being summed are called addends, or sometimes ...

The sum rule for differentiation states d/(dx)[f(x)+g(x)]=f^'(x)+g^'(x), (1) where d/dx denotes a derivative and f^'(x) and g^'(x) are the derivatives of f(x) and g(x), ...

Summation by parts for discrete variables is the equivalent of integration by parts for continuous variables Delta^(-1)[v(x)Deltau(x)]=u(x)v(x)-Delta^(-1)[Eu(x)Deltav(x)], ...

For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.