TOPICS
Search

Search Results for ""


501 - 510 of 13135 for Computational GeometrySearch Results
Given a Jacobi theta function, the nome is defined as q(k) = e^(piitau) (1) = e^(-piK^'(k)/K(k)) (2) = e^(-piK(sqrt(1-k^2))/K(k)) (3) (Borwein and Borwein 1987, pp. 41, 109 ...
Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...
An n×n complex matrix A is called positive definite if R[x^*Ax]>0 (1) for all nonzero complex vectors x in C^n, where x^* denotes the conjugate transpose of the vector x. In ...
Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...
The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
secz is the trigonometric function defined by secz = 1/(cosz) (1) = 2/(e^(iz)+e^(-iz)), (2) where cosz is the cosine. The secant is implemented in the Wolfram Language as ...
The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...
The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...
A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...
1 ... 48|49|50|51|52|53|54 ... 1314 Previous Next

...