Search Results for ""
551 - 560 of 2089 for Eulers Polygon Division ProblemSearch Results
The study of figures on the surface of a sphere (such as the spherical triangle and spherical polygon), as opposed to the type of geometry studied in plane geometry or solid ...
Trigonometric functions of npi/11 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 11 is not a ...
Trigonometric functions of npi/13 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 13 is not a ...
Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...
A number that is "close" to (but not equal to) zero may be called an almost zero. In contrast, a number or expression that is equal to zero is said to be identically zero. ...
The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...
Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...
Informally, a function f is a one-way function if 1. The description of f is publicly known and does not require any secret information for its operation. 2. Given x, it is ...
The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...
A curve of constant width constructed by drawing arcs from each polygon vertex of an equilateral triangle between the other two vertices. The Reuleaux triangle has the ...
...
View search results from all Wolfram sites (162574 matches)

