Search Results for ""

Eternity is a puzzle devised by Christopher Monckton and consisting of 209 pieces, each of which is a 12-polydrafter (i.e., a compound of 30-60-90 triangles). The puzzle was ...

Let X be a set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A in V(X) be a finitary algebra with finitely many fundamental operations. Then ...

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 Gibert point can be defined as follows. Given a reference triangle DeltaABC, reflect the point X_(1157) (which is the inverse point of the Kosnita point in the ...

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

In general, a graph product of two graphs G and H is a new graph whose vertex set is V(G)×V(H) and where, for any two vertices (g,h) and (g^',h^') in the product, the ...

Define the sequence a_0=1, a_1=x, and a_n=(a_(n-2))/(1+a_(n-1)) (1) for n>=0. The first few values are a_2 = 1/(1+x) (2) a_3 = (x(1+x))/(2+x) (3) a_4 = ...

The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...