Search Results for ""

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

The solution u(x,y)=int_0^xdxiint_1^yR(xi,eta;x,y)f(xi,eta)deta, where R(x,y;xieta) is the Riemann function of the linear Goursat problem with characteristics phi=psi=0 ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...

A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

A convex figure constructed by iteratively halving the base of an equilateral triangle and then sliding adjacent triangles so that they slightly overlap. Combining several ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...