Search Results for ""
151 - 160 of 1924 for sum over paths FeynmanSearch Results

A method for verifying the correctness of an arithmetical operation on natural numbers, based on the same principle as casting out nines. The methods of sevens takes ...
Suppose the harmonic series converges to h: sum_(k=1)^infty1/k=h. Then rearranging the terms in the sum gives h-1=h, which is a contradiction.
The series with sum sum_(n=0)^infty1/(F_(2^n))=1/2(7-sqrt(5)), where F_k is a Fibonacci number (Honsberger 1985).
Two representations of a group chi_i and chi_j are said to be orthogonal if sum_(R)chi_i(R)chi_j(R)=0 for i!=j, where the sum is over all elements R of the representation.
A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...
The limit of a lower sum, when it exists, as the mesh size approaches 0.
The limit of an upper sum, when it exists, as the mesh size approaches 0.
A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
On an algebraic curve, the sum of the number of coincidences at a noncuspidal point C is the sum of the orders of the infinitesimal distances from a nearby point P to the ...

...