Search Results for ""
2421 - 2430 of 13134 for complexity theorySearch Results
The identity F_n^4-F_(n-2)F_(n-1)F_(n+1)F_(n+2)=1, where F_n is a Fibonacci number.
The general orthogonal group GO_n(q,F) is the subgroup of all elements of the projective general linear group that fix the particular nonsingular quadratic form F. The ...
The general unitary group GU_n(q) is the subgroup of all elements of the general linear group GL(q^2) that fix a given nonsingular Hermitian form. This is equivalent, in the ...
The generalized Riemann hypothesis conjectures that neither the Riemann zeta function nor any Dirichlet L-series has a zero with real part larger than 1/2. Compare with ...
The Diophantine equation x^2+y^2=p can be solved for p a prime iff p=1 (mod 4) or p=2. The representation is unique except for changes of sign or rearrangements of x and y. ...
A geometric sequence is a sequence {a_k}, k=0, 1, ..., such that each term is given by a multiple r of the previous one. Another equivalent definition is that a sequence is ...
Gieseking's constant is defined by G = int_0^(2pi/3)ln(2cos(1/2x))dx (1) = Cl_2(1/3pi) (2) = (3sqrt(3))/4[1-sum_(k=0)^(infty)1/((3k+2)^2)+sum_(k=1)^(infty)1/((3k+1)^2)] (3) = ...
A finite, increasing sequence of integers {n_1,...,n_m} such that sum_(i=1)^m1/(n_i)-product_(i=1)^m1/(n_i) in N. A sequence is a Giuga sequence iff it satisfies ...
The Goh-Schmutz constant is defined by the integrals C = int_0^infty(ln(1+t))/(e^t-1)dt (1) = int_0^inftyln[1-ln(1-e^(-t))]dt (2) = ...
The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...
...
View search results from all Wolfram sites (28442 matches)

