TOPICS
Search

Search Results for ""


6681 - 6690 of 13135 for TopologySearch Results
Let a be the angle between v and x, b the angle between v and y, and c the angle between v and z. Then the direction cosines are equivalent to the (x,y,z) coordinates of a ...
The directional derivative del _(u)f(x_0,y_0,z_0) is the rate at which the function f(x,y,z) changes at a point (x_0,y_0,z_0) in the direction u. It is a vector form of the ...
Two figures are said to be similar when all corresponding angles are equal, and are directly similar when all corresponding angles are equal and described in the same ...
The Dirichlet lambda function lambda(x) is the Dirichlet L-series defined by lambda(x) = sum_(n=0)^(infty)1/((2n+1)^x) (1) = (1-2^(-x))zeta(x), (2) where zeta(x) is the ...
A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...
kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...
A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...
Dirichlet's principle, also known as Thomson's principle, states that there exists a function u that minimizes the functional D[u]=int_Omega|del u|^2dV (called the Dirichlet ...
A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...
A statistical distribution whose variables can take on only discrete values. Abramowitz and Stegun (1972, p. 929) give a table of the parameters of most common discrete ...
1 ... 666|667|668|669|670|671|672 ... 1314 Previous Next

...