TOPICS
Search

Search Results for ""


431 - 440 of 1530 for Gordans ProblemSearch Results
Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...
Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...
A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...
The outer Soddy circle is the solution to the four coins problem. It has circle function l=((-a+b+c)^2[f(a,b,c)+16g(a,b,c)rs])/(4bc[(a^2+b^2+c^2)-2(ab+bc+ca)+8rs]^4), (1) ...
Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...
Pick three points P=(x_1,y_1), Q=(x_2,y_2), and R=(x_3,y_3) distributed independently and uniformly in a unit disk K (i.e., in the interior of the unit circle). Then the ...
Smale's problems are a list of 18 challenging problems for the twenty-first century proposed by Field medalist Steven Smale. These problems were inspired in part by Hilbert's ...
An equichordal point is a point p for which all the chords of a curve C passing through p are of the same length. In other words, p is an equichordal point if, for every ...
Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...
Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...
1 ... 41|42|43|44|45|46|47 ... 153 Previous Next

...