TOPICS
Search

Search Results for ""


1431 - 1440 of 1815 for Riemann SumSearch Results
Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...
The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...
Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...
The concept of a space is an extremely general and important mathematical construct. Members of the space obey certain addition properties. Spaces which have been ...
There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...
"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...
In general, there are two important types of curvature: extrinsic curvature and intrinsic curvature. The extrinsic curvature of curves in two- and three-space was the first ...
A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...
The function defined by chi_nu(z)=sum_(k=0)^infty(z^(2k+1))/((2k+1)^nu). (1) It is related to the polylogarithm by chi_nu(z) = 1/2[Li_nu(z)-Li_nu(-z)] (2) = ...
The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...
1 ... 141|142|143|144|145|146|147 ... 182 Previous Next

...