TOPICS
Search

Search Results for ""


671 - 680 of 2098 for Prime FormulasSearch Results
An N-cluster is a point lattice configuration in which the distance between every pair of points is an integer, no three points are collinear, and no four points are ...
nu(x) = int_0^infty(x^tdt)/(Gamma(t+1)) (1) nu(x,alpha) = int_0^infty(x^(alpha+t)dt)/(Gamma(alpha+t+1)), (2) where Gamma(z) is the gamma function (Erdélyi et al. 1981, p. ...
A regular ring in the sense of commutative algebra is a commutative unit ring such that all its localizations at prime ideals are regular local rings. In contrast, a von ...
The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...
Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...
Given the left factorial function Sigma(n)=sum_(k=1)^nk!, SK(p) for p prime is the smallest integer n such that p|1+Sigma(n-1). The first few known values of SK(p) are 2, 4, ...
Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...
A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...
1 ... 65|66|67|68|69|70|71 ... 210 Previous Next

...