TOPICS
Search

Search Results for ""


1971 - 1980 of 2001 for Dominating Unique GraphsSearch Results
The Jacobi elliptic functions are standard forms of elliptic functions. The three basic functions are denoted cn(u,k), dn(u,k), and sn(u,k), where k is known as the elliptic ...
The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...
The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...
The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...
Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...
The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...
A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...
A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...
Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...
A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...

...