Search Results for ""
1121 - 1130 of 2485 for Dominated Convergence TheoremSearch Results
Let sum_(n=1)^(infty)u_n(x) be a series of functions all defined for a set E of values of x. If there is a convergent series of constants sum_(n=1)^inftyM_n, such that ...
The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...
The 10.1.2 equation A^(10)=B^(10)+C^(10) (1) is a special case of Fermat's last theorem with n=10, and so has no solution. No 10.1.n solutions are known with n<13. A 10.1.13 ...
The 7.1.2 equation A^7+B^7=C^7 (1) is a special case of Fermat's last theorem with n=7, and so has no solution. No solutions to the 7.1.3, 7.1.4, 7.1.5, 7.1.6 equations are ...
Euler's series transformation is a transformation that sometimes accelerates the rate of convergence for an alternating series. Given a convergent alternating series with sum ...
Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...
A vector space with a T2-space topology such that the operations of vector addition and scalar multiplication are continuous. The interesting examples are ...
Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...
...
View search results from all Wolfram sites (7850 matches)

