Search Results for ""

A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...

Pre-Algebra

A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...

The Mittag-Leffler function (Mittag-Leffler 1903, 1905) is an entire function defined by the series E_alpha(z)=sum_(k=0)^infty(z^k)/(Gamma(alphak+1)) (1) for alpha>0. It is ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

The term "cylinder" has a number of related meanings. In its most general usage, the word "cylinder" refers to a solid bounded by a closed generalized cylinder (a.k.a. ...

The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...

The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...