TOPICS
Search

Search Results for ""


12571 - 12580 of 13135 for Simple probabilitySearch Results
Let Xi be the xi-function defined by Xi(iz)=1/2(z^2-1/4)pi^(-z/2-1/4)Gamma(1/2z+1/4)zeta(z+1/2). (1) Xi(z/2)/8 can be viewed as the Fourier transform of the signal ...
An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...
The constant e with decimal expansion e=2.718281828459045235360287471352662497757... (OEIS A001113) can be computed to 10^9 digits of precision in 10 CPU-minutes on modern ...
A graph G on more than two vertices is said to be k-connected (or k-vertex connected, or k-point connected) if there does not exist a vertex cut of size k-1 whose removal ...
A q-analog, also called a q-extension or q-generalization, is a mathematical expression parameterized by a quantity q that generalizes a known expression and reduces to the ...
The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...
There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...
One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...
The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

...