TOPICS
Search

Search Results for ""


451 - 460 of 865 for Goedels Incompleteness TheoremsSearch Results
Let A=a_(ij) be a matrix with positive coefficients and lambda_0 be the positive eigenvalue in the Frobenius theorem, then the n-1 eigenvalues lambda_j!=lambda_0 satisfy the ...
Given any straight line and a point not on it, there "exists one and only one straight line which passes" through that point and never intersects the first line, no matter ...
Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...
The perpendicular bisector of a line segment is the locus of all points that are equidistant from its endpoints. This theorem can be applied to determine the center of a ...
Let G be a Lie group and let rho be a group representation of G on C^n (for some natural number n), which is continuous in the sense that the function G×C^n->C^n defined by ...
If a circular pizza is divided into 8, 12, 16, ... slices by making cuts at equal angles from an arbitrary point, then the sums of the areas of alternate slices are equal. ...
Let p be an odd prime, k be an integer such that pk and 1<=k<=2(p+1), and N=2kp+1. Then the following are equivalent 1. N is prime. 2. There exists an a such that ...
Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...
The principal theorem of axonometry, first published without proof by Pohlke in 1860. It states that three segments of arbitrary length a^'x^', a^'y^', and a^'z^' which are ...
An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...
1 ... 43|44|45|46|47|48|49 ... 87 Previous Next

...