Search Results for ""

Mills' theorem states that there exists a real constant A such that |_A^(3^n)_| is prime for all positive integers n (Mills 1947). While for each value of c>=2.106, there are ...

Martin Gardner (1975) played an April Fool's joke by asserting that the map of 110 regions illustrated above (left figure) required five colors and constitutes a ...

A q-analog of Gauss's theorem due to Jacobi and Heine, _2phi_1(a,b;c;q,c/(ab))=((c/a;q)_infty(c/b;q)_infty)/((c;q)_infty(c/(ab);q)_infty) (1) for |c/(ab)|<1 (Gordon and ...

A requirement necessary for a given statement or theorem to hold. Also called a criterion.

The first Debye function is defined by D_n^((1))(x) = int_0^x(t^ndt)/(e^t-1) (1) = x^n[1/n-x/(2(n+1))+sum_(k=1)^(infty)(B_(2k)x^(2k))/((2k+n)(2k!))], (2) for |x|<2pi, n>=1, ...

By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...

The Weyl tensor is the tensor C_(abcd) defined by R_(abcd)=C_(abcd)+2/(n-2)(g_(a[c)R_d]b-g_(b[c)R_(d]a)) -2/((n-1)(n-2))Rg_(a[c)g_(d]b), (1) where R_(abcd) is the Riemann ...

Arrow's paradox, also called Arrow's impossibility theorem or the general possibility theorem, states that perfect democratic voting is impossible, not just in practice but ...

The rule (F,F=>G)/G, where => means "implies," which is the sole rule of inference in propositional calculus. This rule states that if each of F and F=>G is either an axiom ...

A rigorous mathematical argument which unequivocally demonstrates the truth of a given proposition. A mathematical statement that has been proven is called a theorem. ...