TOPICS
Search

Search Results for ""


891 - 900 of 1833 for Disk covering problemSearch Results
Let L, M, and N be lines through A, B, C, respectively, parallel to the Euler line. Let L^' be the reflection of L in sideline BC, let M^' be the reflection of M in sideline ...
The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...
Triangle centers with triangle center functions of the form alpha=a^n are called nth power points. These points lie along the trilinear curve a^n:b^n:c^n that passes through ...
A prime-distance graph is a distance graph with distance set given by the set of prime numbers.
A prime circle of order 2n is a free circular permutation of the numbers from 1 to 2n with adjacent pairs summing to a prime. The number of prime circles for n=1, 2, ..., are ...
Prince Rupert's cube is the largest cube that can be made to pass through a given cube. In other words, the cube having a side length equal to the side length of the largest ...
The radical circle of three given circles is the circle having center at the radical center of the three circles and is orthogonal to all of them. (A circle with center at ...
The term "real line" has a number of different meanings in mathematics. Most commonly, "real line" is used to mean real axis, i.e., a line with a fixed scale so that every ...
Let R be the class of expressions generated by 1. The rational numbers and the two real numbers pi and ln2, 2. The variable x, 3. The operations of addition, multiplication, ...
A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...
1 ... 87|88|89|90|91|92|93 ... 184 Previous Next

...