Search Results for ""
401 - 410 of 1585 for Optimization ProblemSearch Results
A system for specifying points using coordinates measured in some specified way. The simplest coordinate system consists of coordinate axes oriented perpendicularly to each ...
The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...
The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...
A pair of prime numbers (p,q) such that p^(q-1)=1 (mod q^2) and q^(p-1)=1 (mod p^2). The only known examples are (2, 1093), (3, 1006003), (5 , 1645333507), (83, 4871), (911, ...
Erdős and Heilbronn (Erdős and Graham 1980) posed the problem of estimating from below the number of sums a+b where a in A and b in B range over given sets A,B subset= Z/pZ ...
A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...
Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...
A relation expressing a sum potentially involving binomial coefficients, factorials, rational functions, and power functions in terms of a simple result. Thanks to results by ...
The German mathematician Kronecker proved that all the Galois extensions of the rationals Q with Abelian Galois groups are subfields of cyclotomic fields Q(mu_n), where mu_n ...
Consider a convex pentagon and extend the sides to a pentagram. Externally to the pentagon, there are five triangles. Construct the five circumcircles. Each pair of adjacent ...
...
View search results from all Wolfram sites (161130 matches)

