TOPICS
Search

Search Results for ""


1181 - 1190 of 2377 for Goedels Incompleteness TheoremSearch Results
The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...
The conjecture that there are only finitely many triples of relatively prime integer powers x^p, y^q, z^r for which x^p+y^q=z^r (1) with 1/p+1/q+1/r<1. (2) Darmon and Merel ...
The Markov numbers m are the union of the solutions (x,y,z) to the Markov equation x^2+y^2+z^2=3xyz, (1) and are related to Lagrange numbers L_n by L_n=sqrt(9-4/(m^2)). (2) ...
The point on a line segment dividing it into two segments of equal length. The midpoint of a line segment is easy to locate by first constructing a lens using circular arcs, ...
If F is an algebraic Galois extension field of K such that the Galois group of the extension is Abelian, then F is said to be an Abelian extension of K. For example, ...
If f(z) is meromorphic in a region R enclosed by a contour gamma, let N be the number of complex roots of f(z) in gamma, and P be the number of poles in gamma, with each zero ...
A function f(x) is said to have bounded variation if, over the closed interval x in [a,b], there exists an M such that |f(x_1)-f(a)|+|f(x_2)-f(x_1)|+... +|f(b)-f(x_(n-1))|<=M ...
According to Pólya, the Cartesian pattern is the resolution method for arithmetical or geometrical problems based on equations. The first step is to translate the question ...
A circle is the set of points in a plane that are equidistant from a given point O. The distance r from the center is called the radius, and the point O is called the center. ...
A constructive proof is a proof that directly provides a specific example, or which gives an algorithm for producing an example. Constructive proofs are also called ...
1 ... 116|117|118|119|120|121|122 ... 238 Previous Next

...