Search Results for ""
471 - 480 of 1636 for Bin Packing ProblemSearch Results
Keller conjectured that tiling an n-dimensional space with n-dimensional hypercubes of equal size yields an arrangement in which at least two hypercubes have an entire ...
The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...
Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...
Given n circles and a perimeter p, the total area of the convex hull is A_(Convex Hull)=2sqrt(3)(n-1)+p(1-1/2sqrt(3))+pi(sqrt(3)-1). Furthermore, the actual area equals this ...
Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...
A the (first, or internal) Kenmotu point, also called the congruent squares point, is the triangle center constructed by inscribing three equal squares such that each square ...
Two circles with centers at (x_i,y_i) with radii r_i for i=1,2 are mutually tangent if (x_1-x_2)^2+(y_1-y_2)^2=(r_1+/-r_2)^2. (1) If the center of the second circle is inside ...
An a×b rectangle can be packed with 1×n strips iff n|a or n|b.
...
View search results from all Wolfram sites (160700 matches)

