TOPICS
Search

Search Results for ""


981 - 990 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
If a minimal surface is given by the equation z=f(x,y) and f has continuous first and second partial derivatives for all real x and y, then f is a plane.
Let ABCD be a quadrilateral with perpendicular polygon diagonals. The midpoints of the sides (a, b, c, and d) determine a parallelogram (the Varignon parallelogram) with ...
Let K be a finite complex, let h:|K|->|K| be a continuous map. If Lambda(h)!=0, then h has a fixed point.
A series which is not convergent. Series may diverge by marching off to infinity or by oscillating. Divergent series have some curious properties. For example, rearranging ...
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^n+B^n=sum_(j=0)^(|_n/2_|)(-1)^jn/(n-j)(n-j; j)(AB)^j(A+B)^(n-2j), where |_x_| is the floor function and (n; k) is a binomial coefficient.
A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...
The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...
The isogonal conjugate X^(-1) of a point X in the plane of the triangle DeltaABC is constructed by reflecting the lines AX, BX, and CX about the angle bisectors at A, B, and ...
Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...
1 ... 96|97|98|99|100|101|102 ... 937 Previous Next

...