Search Results for ""
331 - 340 of 1924 for sum over paths FeynmanSearch Results
(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...
Murata's constant is defined as C_(Murata) = product_(p)[1+1/((p-1)^2)] (1) = 2.82641999... (2) (OEIS A065485), where the product is over the primes p. It can also be written ...
Let x be a positive number, and define lambda(d) = mu(d)[ln(x/d)]^2 (1) f(n) = sum_(d)lambda(d), (2) where the sum extends over the divisors d of n, and mu(n) is the Möbius ...
Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...
Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...
Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...
Knuth's series is given by S = sum_(k=1)^(infty)((k^k)/(k!e^k)-1/(sqrt(2pik))) (1) = -2/3-1/(sqrt(2pi))zeta(1/2) (2) = -0.08406950872765599646... (3) (OEIS A096616), where ...
The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...
Let a convex cyclic polygon be triangulated in any manner, and draw the incircle to each triangle so constructed. Then the sum of the inradii is a constant independent of the ...
A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...
...
View search results from all Wolfram sites (33496 matches)

