TOPICS
Search

Search Results for ""


701 - 710 of 4277 for Graphing FunctionsSearch Results
The rising factorial x^((n)), sometimes also denoted <x>_n (Comtet 1974, p. 6) or x^(n^_) (Graham et al. 1994, p. 48), is defined by x^((n))=x(x+1)...(x+n-1). (1) This ...
A class of formal series expansions in derivatives of a distribution Psi(t) which may (but need not) be the normal distribution function Phi(t)=1/(sqrt(2pi))e^(-t^2/2) (1) ...
A formal extension of the hypergeometric function to two variables, resulting in four kinds of functions (Appell 1925; Picard 1880ab, 1881; Goursat 1882; Whittaker and Watson ...
A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...
Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...
A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...
The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...
A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...
For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...
A function f(x) is said to have bounded variation if, over the closed interval x in [a,b], there exists an M such that |f(x_1)-f(a)|+|f(x_2)-f(x_1)|+... +|f(b)-f(x_(n-1))|<=M ...
1 ... 68|69|70|71|72|73|74 ... 428 Previous Next

...