Search Results for ""

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

A bounded entire function in the complex plane C is constant. The fundamental theorem of algebra follows as a simple corollary.

In space, the only conformal mappings are inversions, similarity transformations, and congruence transformations. Or, restated, every angle-preserving transformation is a ...

The lengths of the tangents from a point P to a conic C are proportional to the cube roots of the radii of curvature of C at the corresponding points of contact.

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

An initial value problem is a problem that has its conditions specified at some time t=t_0. Usually, the problem is an ordinary differential equation or a partial ...

Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

The operator of fractional integration is defined as _aD_t^(-nu)f(t)=1/(Gamma(nu))int_a^tf(u)(t-u)^(nu-1)du for nu>0 with _aD_t^0f(t)=f(t) (Oldham and Spanier 1974, Miller ...