Search Results for ""
701 - 710 of 1074 for Bour's minimal surfaceSearch Results
The 9.1.2 equation A^9=B^9+C^9 (1) is a special case of Fermat's last theorem with n=9, and so has no solution. No 9.1.3, 9.1.4, 9.1.5, 9.1.6, 9.1.7, 9.1.8, or 9.1.9 ...
Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...
The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...
A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...
A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...
An elliptic curve of the form y^2=x^3+n for n an integer. This equation has a finite number of solutions in integers for all nonzero n. If (x,y) is a solution, it therefore ...
A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...
The Penrose triangle, also called the tribar (Cerf), tri-bar (Ernst 1987), impossible tribar (Pappas 1989, p. 13), or impossible triangle, is an impossible figure published ...
The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...
The plastic constant P, sometimes also called le nombre radiant, the minimal Pisot number, plastic number, plastic ratio, platin number, Siegel's number, or silver number, is ...
...
View search results from all Wolfram sites (9832 matches)

