TOPICS
Search

Search Results for ""


1641 - 1650 of 2910 for Integer complexitySearch Results
Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...
_2F_1(a,b;c;1)=((c-b)_(-a))/((c)_(-a))=(Gamma(c)Gamma(c-a-b))/(Gamma(c-a)Gamma(c-b)) for R[c-a-b]>0, where _2F_1(a,b;c;x) is a (Gauss) hypergeometric function. If a is a ...
Let the multiples m, 2m, ..., [(p-1)/2]m of an integer such that pm be taken. If there are an even number r of least positive residues mod p of these numbers >p/2, then m is ...
The second-order ordinary differential equation (1-x^2)y^('')-2(mu+1)xy^'+(nu-mu)(nu+mu+1)y=0 (1) sometimes called the hyperspherical differential equation (Iyanaga and ...
The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...
A generalized eigenvector for an n×n matrix A is a vector v for which (A-lambdaI)^kv=0 for some positive integer k in Z^+. Here, I denotes the n×n identity matrix. The ...
A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...
A gigantic prime is a prime with 10000 or more decimal digits. The first few gigantic primes are given by 10^(9999)+n for n=33603, 55377, 70999, 78571, 97779, 131673, 139579, ...
A 4×4 magic square in which the elements in each 2×2 corner have the same sum. Dürer's magic square, illustrated above, is an example of a gnomon magic square since the sums ...
A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...
1 ... 162|163|164|165|166|167|168 ... 291 Previous Next

...