Search Results for ""
191 - 200 of 865 for Goedels Incompleteness TheoremsSearch Results
A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...
A specific type of ultraproduct that can be used to construct nonstandard universes and obtain the transfer principle as a corollary of Łoś' theorem for ultraproducts.
Wagner's theorem states that a graph is planar iff it does not contain K_5 or K_(3,3) as a graph minor.
Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.
Iff p is a prime, then (p-1)!+1 is a multiple of p, that is (p-1)!=-1 (mod p). (1) This theorem was proposed by John Wilson and published by Waring (1770), although it was ...
A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).
Logic is the formal mathematical study of the methods, structure, and validity of mathematical deduction and proof. According to Wolfram (2002, p. 860), logic is the most ...
A theorem which asserts that if a sequence or function behaves regularly, then some average of it behaves regularly. For example, A(x)∼x implies A_1(x)=int_0^xA(t)dt∼1/2x^2 ...
If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...
Every bounded infinite set in R^n has an accumulation point. For n=1, an infinite subset of a closed bounded set S has an accumulation point in S. For instance, given a ...
...
View search results from all Wolfram sites (3664 matches)

