Search Results for ""
2121 - 2130 of 4429 for Sum of squares functionSearch Results
A number n is said to be refactorable, sometimes also called a tau number (Kennedy and Cooper 1990), if it is divisible by the number of its divisors sigma_0(n), where ...
The Riemann-Siegel integral formula is the following representation of the xi-function xi(s) found in Riemann's Nachlass by Bessel-Hagen in 1926 (Siegel 1932; Edwards 2001, ...
Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...
The Flint Hills series is the series S_1=sum_(n=1)^infty(csc^2n)/(n^3) (Pickover 2002, p. 59). It is not known if this series converges, since csc^2n can have sporadic large ...
Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...
A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...
Samuel Pepys wrote Isaac Newton a long letter asking him to determine the probabilities for a set of dice rolls related to a wager he planned to make. Pepys asked which was ...
For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...
The Zak transform is a signal transform relevant to time-continuous signals sampled at a uniform rate and an arbitrary clock phase (Janssen 1988). The Zak transform of a ...
product_(k=1)^(n)(1+yq^k) = sum_(m=0)^(n)y^mq^(m(m+1)/2)[n; m]_q (1) = sum_(m=0)^(n)y^mq^(m(m+1)/2)((q)_n)/((q)_m(q)_(n-m)), (2) where [n; m]_q is a q-binomial coefficient.
...


