Search Results for ""

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...

A prize of 100000 German marks offered for the first valid proof of Fermat's last theorem (Ball and Coxeter 1987, p. 72; Barner 1997; Hoffman 1998, pp. 193-194 and 199). The ...

Linear Algebra

The de Longchamps circle is defined as the radical circle of the power circles of a given reference triangle. It is defined only for obtuse triangles. It is the complement of ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

An arithmetic progression of primes is a set of primes of the form p_1+kd for fixed p_1 and d and consecutive k, i.e., {p_1,p_1+d,p_1+2d,...}. For example, 199, 409, 619, ...