TOPICS
Search

Search Results for ""


3891 - 3900 of 4217 for Strong Lawof Small NumbersSearch Results
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 ...
An ellipse is a curve that is the locus of all points in the plane the sum of whose distances r_1 and r_2 from two fixed points F_1 and F_2 (the foci) separated by a distance ...
Let n be a positive nonsquare integer. Then Artin conjectured that the set S(n) of all primes for which n is a primitive root is infinite. Under the assumption of the ...
There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...
A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...
1 ... 387|388|389|390|391|392|393 ... 422 Previous Next

...