Search Results for ""
2651 - 2660 of 3276 for Special Unitary GroupSearch Results

The natural logarithm of 2 is a transcendental quantity that arises often in decay problems, especially when half-lives are being converted to decay constants. ln2 has ...
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 ...
Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...
The parabolic cylinder functions are a class of functions sometimes called Weber functions. There are a number of slightly different definitions in use by various authors. ...
An integer m such that if p|m, then p^2|m, is called a powerful number. There are an infinite number of powerful numbers, and the first few are 1, 4, 8, 9, 16, 25, 27, 32, ...
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) = ...
A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...
The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...
The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

...