Search Results for ""
9851 - 9860 of 13135 for Babylonian Number SystemSearch Results
The Euler-Gergonne-Soddy triangle is the right triangle DeltaZFlEv created by the pairwise intersections of the Euler line L_E, Soddy line L_S, and Gergonne line L_G. (The ...
Define I_n=(-1)^nint_0^infty(lnz)^ne^(-z)dz, (1) then I_n=(-1)^nGamma^((n))(1), (2) where Gamma^((n))(z) is the nth derivative of the gamma function. Particular values ...
The general nonhomogeneous differential equation is given by x^2(d^2y)/(dx^2)+alphax(dy)/(dx)+betay=S(x), (1) and the homogeneous equation is x^2y^('')+alphaxy^'+betay=0 (2) ...
A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...
The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...
The Euler points are the midpoints E_A, E_B, E_C of the segments which join the vertices A, B, and C of a triangle DeltaABC and the orthocenter H. They are three of the nine ...
A square array made by combining n objects of two types such that the first and second elements form Latin squares. Euler squares are also known as Graeco-Latin squares, ...
Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...
An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...
The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...
...
View search results from all Wolfram sites (185317 matches)

