Search Results for ""
111 - 120 of 1145 for Euler AnglesSearch Results

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.
A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices. The spherical triangle is the ...
Flat polygons embedded in three-space can be transformed into a congruent planar polygon as follows. First, translate the starting vertex to (0, 0, 0) by subtracting it from ...
The intersection Ev of the Gergonne line and the Euler line. It has triangle center function alpha=(b(a-b+c)cosB+c(a+b-c)cosC-2a^2cosA)/(2a) and is Kimberling center X_(1375).
The index of a vector field with finitely many zeros on a compact, oriented manifold is the same as the Euler characteristic of the manifold.
The following three pieces of information completely determine the homeomorphic type of a surface (Massey 1996): 1. Orientability, 2. Number of boundary components, 3. Euler ...
A 3-cusped hypocycloid, also called a tricuspoid. The deltoid was first considered by Euler in 1745 in connection with an optical problem. It was also investigated by Steiner ...
Ein(z) = int_0^z((1-e^(-t))dt)/t (1) = E_1(z)+lnz+gamma, (2) where gamma is the Euler-Mascheroni constant and E_1 is the En-function with n=1.
An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...
A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...

...