TOPICS
Search

Search Results for ""


5071 - 5080 of 13134 for complexity theorySearch Results
The function f(beta,z)|->z^((1+cosbeta+isinbeta)/2), illustrated above for beta=0.4.
Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...
The two-dimensional Euclidean space denoted R^2.
For s>1, the Riemann zeta function is given by zeta(s) = sum_(n=1)^(infty)1/(n^s) (1) = product_(k=1)^(infty)1/(1-1/(p_k^s)), (2) where p_k is the kth prime. This is Euler's ...
Let g(x)=(1-x^2)(1-k^2x^2). Then int_0^a(dx)/(sqrt(g(x)))+int_0^b(dx)/(sqrt(g(x)))=int_0^c(dx)/(sqrt(g(x))), where c=(bsqrt(g(a))+asqrt(g(b)))/(sqrt(1-k^2a^2b^2)).
An arbitrary rotation may be described by only three parameters.
An orthogonal projection of a cross onto a three-dimensional subspace. It is said to be normalized if the cross vectors are all of unit length.
One of the Eilenberg-Steenrod axioms which states that, if X is a space with subspaces A and U such that the set closure of A is contained in the interior of U, then the ...
The exists quantifier exists .
For c<1, x^c<1+c(x-1). For c>1, x^c>1+c(x-1).
1 ... 505|506|507|508|509|510|511 ... 1314 Previous Next

...