Search Results for ""
7361 - 7370 of 13135 for Principal Component AnalysisSearch Results
A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...
Consider the excircles J_A, J_B, and J_C of a triangle, and the external Apollonius circle Gamma tangent externally to all three. Denote the contact point of Gamma and J_A by ...
Given a ship with a known constant direction and speed v, what course should be taken by a chase ship in pursuit (traveling at speed V) in order to intercept the other ship ...
A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...
An Appell sequence is a Sheffer sequence for (g(t),t). Roman (1984, pp. 86-106) summarizes properties of Appell sequences and gives a number of specific examples. The ...
A surface of revolution defined by Kepler. It consists of more than half of a circular arc rotated about an axis passing through the endpoints of the arc. The equations of ...
The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...
"Arabic numerals" are the numerical symbols 1, 2, 3, 4, 5, 6, 7, 8, 9, and 0. Historically, Indian numerals evolved in Arab usage roughly 1000 A.D., and there was rare ...
Also known as araneidan, this curve owes its name to its spider-like shape. It is given by the polar equation r=a(sin(ntheta))/(sin[(n-1)theta]), where a>0 and n>2 is an ...
Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...
...
View search results from all Wolfram sites (196889 matches)

