Search Results for ""

Complex analysis is the study of complex numbers together with their derivatives, manipulation, and other properties. Complex analysis is an extremely powerful tool with an ...

The confluent hypergeometric function of the first kind _1F_1(a;b;z) is a degenerate form of the hypergeometric function _2F_1(a,b;c;z) which arises as a solution the ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...

The Kiepert hyperbola is a hyperbola and triangle conic that is related to the solution of Lemoine's problem and its generalization to isosceles triangles constructed on the ...

A special function mostly commonly denoted psi_n(z), psi^((n))(z), or F_n(z-1) which is given by the (n+1)st derivative of the logarithm of the gamma function Gamma(z) (or, ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

A superellipse is a curve with Cartesian equation |x/a|^r+|y/b|^r=1, (1) first discussed in 1818 by Lamé. A superellipse may be described parametrically by x = acos^(2/r)t ...

Adams' method is a numerical method for solving linear first-order ordinary differential equations of the form (dy)/(dx)=f(x,y). (1) Let h=x_(n+1)-x_n (2) be the step ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...