TOPICS
Search

Search Results for ""


2601 - 2610 of 3632 for Diophantine Equation 2nd PowersSearch Results
The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...
tau is the ratio tau=omega_2/omega_1 of the two half-periods omega_1 and omega_2 of an elliptic function (Whittaker and Watson 1990, pp. 463 and 473) defined such that the ...
Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...
A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3+uv^2+2(u^2-v^2). (3) The handkerchief surface has stationary points summarized in ...
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; ...
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 ...
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, ...
A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...
1 ... 258|259|260|261|262|263|264 ... 364 Previous Next

...