Search Results for ""
1521 - 1530 of 13135 for Probability Generating FunctionSearch Results
A geometric series sum_(k)a_k is a series for which the ratio of each two consecutive terms a_(k+1)/a_k is a constant function of the summation index k. The more general case ...
Jackson's theorem is a statement about the error E_n(f) of the best uniform approximation to a real function f(x) on [-1,1] by real polynomials of degree at most n. Let f(x) ...
The circle passing through the isodynamic points S and S^' and the triangle centroid G of a triangle DeltaA_1A_2A_3 (Kimberling 1998, pp. 227-228). The Parry circle has ...
A plot of a function expressed in polar coordinates, with radius r as a function of angle theta. Polar plots can be drawn in the Wolfram Language using PolarPlot[r, {t, tmin, ...
Inscribe two triangles DeltaA_1B_1C_1 and DeltaA_2B_2C_2 in a reference triangle DeltaABC such that A = ∠AB_1C_1=∠AC_2B_2 (1) B = ∠BC_1A_1=∠BA_2C_2 (2) C = ∠CA_1B_1=∠CB_2A_2. ...
The nth root (or "nth radical") of a quantity z is a value r such that z=r^n, and therefore is the inverse function to the taking of a power. The nth root is denoted ...
Debye's asymptotic representation is an asymptotic expansion for a Hankel function of the first kind with nu approx x. For 1-nu/x>epsilon, nu/x=sinalpha, ...
If f(x) is an even function, then b_n=0 and the Fourier series collapses to f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx), (1) where a_0 = 1/piint_(-pi)^pif(x)dx (2) = ...
A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...
Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...
...
View search results from all Wolfram sites (432560 matches)

