Search Results for ""
8001 - 8010 of 13135 for BASIC ALGEBRASearch Results
Various handshaking problems are in circulation, the most common one being the following. In a room of n people, how many different handshakes are possible? The answer is (n; ...
There are two types of functions known as Hankel functions. The more common one is a complex function (also called a Bessel function of the third kind, or Weber Function) ...
The Hankel functions of the first kind are defined as H_n^((1))(z)=J_n(z)+iY_n(z), (1) where J_n(z) is a Bessel function of the first kind and Y_n(z) is a Bessel function of ...
H_n^((2))(z)=J_n(z)-iY_n(z), (1) where J_n(z) is a Bessel function of the first kind and Y_n(z) is a Bessel function of the second kind. Hankel functions of the second kind ...
An apodization function, also called the Hann function, frequently used to reduce leakage in discrete Fourier transforms. The illustrations above show the Hanning function, ...
The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...
A tiling consisting of a rhombus such that 17 rhombuses fit around a point and a second tile in the shape of six rhombuses stuck together. These two tiles can fill the plane ...
Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...
If 0<p<infty, then the Hardy space H^p(D) is the class of functions holomorphic on the disk D and satisfying the growth condition ...
Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n=sum_(k=1)^na_k (1) and F(x)=int_0^xf(t)dt (2) and take p>1. For sums, ...
...
View search results from all Wolfram sites (38651 matches)

