TOPICS
Search

Search Results for ""


9621 - 9630 of 13135 for Use of graphing calculatorsSearch Results
|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...
The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...
A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...
The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...
Let E be a Euclidean space, (beta,alpha) be the dot product, and denote the reflection in the hyperplane P_alpha={beta in E|(beta,alpha)=0} by ...
Let sum_(k=1)^(infty)u_k be a series with positive terms, and let rho=lim_(k->infty)u_k^(1/k). 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series ...
The nth roots of unity are roots e^(2piik/n) of the cyclotomic equation x^n=1, which are known as the de Moivre numbers. The notations zeta_k, epsilon_k, and epsilon_k, where ...
Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...
A rotation group is a group in which the elements are orthogonal matrices with determinant 1. In the case of three-dimensional space, the rotation group is known as the ...
For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.
1 ... 960|961|962|963|964|965|966 ... 1314 Previous Next

...