Search Results for ""

A hypergeometric identity discovered by Ramanujan around 1910. From Hardy (1999, pp. 13 and 102-103), (1) where a^((n))=a(a+1)...(a+n-1) (2) is the rising factorial (a.k.a. ...

A second-order partial differential equation, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called elliptic if the matrix Z=[A B; B C] (2) is positive ...

Euler conjectured that there do not exist Euler squares of order n=4k+2 for k=1, 2, .... In fact, MacNeish (1921-1922) published a purported proof of this conjecture (Bruck ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

A plane curve proposed by Descartes to challenge Fermat's extremum-finding techniques. In parametric form, x = (3at)/(1+t^3) (1) y = (3at^2)/(1+t^3). (2) The curve has a ...

A Gaussian sum is a sum of the form S(p,q)=sum_(r=0)^(q-1)e^(-piir^2p/q), (1) where p and q are relatively prime integers. The symbol phi is sometimes used instead of S. ...

A geometric series sum_(k)a_k is a series for which the ratio of each two consecutive terms a_(k+1)/a_k is a constant function of the summation index k. The more general case ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

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 ...