TOPICS
Search

Search Results for ""


1501 - 1510 of 2487 for Prime SumsSearch Results
The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...
Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...
There are least two Bang's theorems, one concerning tetrahedra (Bang 1897), and the other with widths of convex domains (Bang 1951). The theorem of Bang (1897) states that ...
A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...
Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...
Another "beta function" defined in terms of an integral is the "exponential" beta function, given by beta_n(z) = int_(-1)^1t^ne^(-zt)dt (1) = ...
A two-sided (doubly infinite) Z-Transform, Z^((2))[{a_n}_(n=-infty)^infty](z)=sum_(n=-infty)^infty(a_n)/(z^n) (Zwillinger 1996; Krantz 1999, p. 214). The bilateral transform ...
How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...
Polynomials s_k(x;lambda) which form a Sheffer sequence with g(t) = 1+e^(lambdat) (1) f(t) = e^t-1 (2) and have generating function ...
There are three types of boundary conditions commonly encountered in the solution of partial differential equations: 1. Dirichlet boundary conditions specify the value of the ...
1 ... 148|149|150|151|152|153|154 ... 249 Previous Next

...