Search Results for ""

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

The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...

The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

An aperiodic monotile, also somewhat humorously known as an einstein (where "einstein" means "one stone", perhaps generalizable to "one tile," in German), is a single tile ...