TOPICS
Search

Search Results for ""


61 - 70 of 1924 for sum over paths FeynmanSearch Results
Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...
One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...
where _8phi_7 is a q-hypergeometric function.
_2phi_1(a,q^(-n);c;q,q)=(a^n(c/a,q)_n)/((a;q)_n), where _2phi_1(a,b;c;q,z) is a q-hypergeometric function.
A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).
The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...
The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...
Related to or being the mathematically most simple case. More generally, the word "trivial" is used to describe any result which requires little or no effort to derive or ...
cos(20 degrees)cos(40 degrees)cos(80 degrees)=1/8. An identity communicated to Feynman as a child by a boy named Morrie Jacobs (Gleick 1992, p. 47). Feynman remembered this ...
The Cartesian product of a finite or infinite set of modules over a ring with only finitely many nonzero entries in each sequence.
1 ... 4|5|6|7|8|9|10 ... 193 Previous Next

...