Search Results for ""
81 - 90 of 136 for exponentSearch Results
The supersphere is the algebraic surface that is the special case of the superellipse with a=b=c. It has equation |x/a|^n+|y/a|^n+|z/a|^n=1 (1) or |x|^n+|y|^n+|z|^n=a^n (2) ...
The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...
Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...
The most general form of "an" exponential function is a power-law function of the form f(x)=ab^(cx+d), (1) where a, c, and d are real numbers, b is a positive real number, ...
The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
The Mathieu functions are the solutions to the Mathieu differential equation (d^2V)/(dv^2)+[a-2qcos(2v)]V=0. (1) Even solutions are denoted C(a,q,v) and odd solutions by ...
The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...
The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...
Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...
...
View search results from all Wolfram sites (1778 matches)

