TOPICS
Search

Search Results for ""


1091 - 1100 of 2487 for Prime SumsSearch Results
Define the "information function" to be I=-sum_(i=1)^NP_i(epsilon)ln[P_i(epsilon)], (1) where P_i(epsilon) is the natural measure, or probability that element i is populated, ...
The inverse tangent integral Ti_2(x) is defined in terms of the dilogarithm Li_2(x) by Li_2(ix)=1/4Li_2(-x^2)+iTi_2(x) (1) (Lewin 1958, p. 33). It has the series ...
Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...
Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...
A sufficient condition on the Lindeberg-Feller central limit theorem. Given random variates X_1, X_2, ..., let <X_i>=0, the variance sigma_i^2 of X_i be finite, and variance ...
The power series that defines the exponential map e^x also defines a map between matrices. In particular, exp(A) = e^(A) (1) = sum_(n=0)^(infty)(A^n)/(n!) (2) = ...
(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...
A set n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). If the sum of ...
For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...
If a function has a Fourier series given by f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx)+sum_(n=1)^inftyb_nsin(nx), (1) then Bessel's inequality becomes an equality known as ...
1 ... 107|108|109|110|111|112|113 ... 249 Previous Next

...