Search Results for ""

The equations are x = 2/(sqrt(pi(4+pi)))(lambda-lambda_0)(1+costheta) (1) y = 2sqrt(pi/(4+pi))sintheta, (2) where theta is the solution to ...

The equations are x = ((lambda-lambda_0)(1+costheta))/(sqrt(2+pi)) (1) y = (2theta)/(sqrt(2+pi)), (2) where theta is the solution to theta+sintheta=(1+1/2pi)sinphi. (3) This ...

The Season 1 episode "Sacrifice" (2005) of the television crime drama NUMB3RS mentions econometrics.

A number n is called an economical number if the number of digits in the prime factorization of n (including powers) uses fewer digits than the number of digits in n. The ...

A Padé approximant perturbed with a Chebyshev polynomial of the first kind to reduce the leading coefficient in the error.

136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...