TOPICS
Search

Search Results for ""


4061 - 4070 of 4827 for Eight Point Circle TheoremSearch Results
Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...
A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...
In hexagonal close packing, layers of spheres are packed so that spheres in alternating layers overlie one another. As in cubic close packing, each sphere is surrounded by 12 ...
If f(z) is analytic throughout the annular region between and on the concentric circles K_1 and K_2 centered at z=a and of radii r_1 and r_2<r_1 respectively, then there ...
There are two sets of constants that are commonly known as Lebesgue constants. The first is related to approximation of function via Fourier series, which the other arises in ...
A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...
In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...
A group whose group operation is identified with multiplication. As with normal multiplication, the multiplication operation on group elements is either denoted by a raised ...
The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...
The Nevanlinna Prize is awarded by the International Mathematical Union to outstanding contributors to the mathematical aspects of information science. The International ...
1 ... 404|405|406|407|408|409|410 ... 483 Previous Next

...