TOPICS
Search

Search Results for ""


4571 - 4580 of 7215 for Cube 3 Compound C 3_ 500Search Results
An endomorphism is called ergodic if it is true that T^(-1)A=A implies m(A)=0 or 1, where T^(-1)A={x in X:T(x) in A}. Examples of ergodic endomorphisms include the map X->2x ...
The series sumf(n) for a monotonic nonincreasing f(x) is convergent if lim_(x->infty)^_(e^xf(e^x))/(f(x))<1 and divergent if lim_(x->infty)__(e^xf(e^x))/(f(x))>1.
A bounded operator U on a Hilbert space H is called essentially unitary if U^*U-I and UU^*-I are compact operators.
The paradox "This statement is false," stated in the fourth century BC. It is a sharper version of the Epimenides paradox, "All Cretans are liars...One of their own poets has ...
A more common way to describe a Euclidean ring.
A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...
For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...
A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...
The derivative (deltaL)/(deltaq)=(partialL)/(partialq)-d/(dt)((partialL)/(partialq^.)) appearing in the Euler-Lagrange differential equation.
The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...
1 ... 455|456|457|458|459|460|461 ... 722 Previous Next

...