Search Results for ""
7001 - 7010 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
A magic square is said to be p-multimagic if the square formed by replacing each element by its kth power for k=1, 2, ..., p is also magic. A 2-multimagic square is called ...
The Napoleon-Feuerbach cubic is the pivotal isogonal cubic with nine-point center N as the pivot point. It therefore has trilinear equation ...
Beautiful patterns can be created by drawing sets of nested polygons such that the incircle of the nth polygon is the circumcircle of the (n+1)st and successive polygons are ...
A knot which is not alternating. Unlike alternating knots, flype moves are not sufficient to pass between all minimal diagrams of a given nonalternating knot (Hoste et al. ...
A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...
Ono (1914) conjectured that the inequality 27(b^2+c^2-a^2)^2(a^2+c^2-b^2)^2(a^2+b^2-c^2)^2<=(4K)^6 holds true for all triangles, where a, b, and c are the lengths of the ...
Given a set X, a set function mu^*:2^X->[0,infty] is said to be an outer measure provided that mu^*(emptyset)=0 and that mu^* is countably monotone, where emptyset is the ...
The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...
The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...
A primitive right triangle is a right triangle having integer sides a, b, and c such that GCD(a,b,c)=1, where GCD(a,b,c) is the greatest common divisor. The set of values ...
...
View search results from all Wolfram sites (505142 matches)

