TOPICS
Search

Search Results for ""


781 - 790 of 1541 for Eulers Polyhedron FormulaSearch Results
The roulette traced by a point P attached to a circle of radius b rolling around the outside of a fixed circle of radius a. These curves were studied by Dürer (1525), ...
A beautiful approximation to the Euler-Mascheroni constant gamma is given by pi/(2e)=0.57786367... (1) (OEIS A086056; E. W. Weisstein, Apr. 18, 2006), which is good to three ...
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 line on which the orthocenter H, triangle centroid G, circumcenter O, de Longchamps point L, nine-point center N, and a number of other important triangle centers lie. ...
Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...
The extangents circle is the circumcircle of the extangents triangle. Its center function is a complicated 9th-order polynomial and its circle function is a complicated ...
Euler (1738, 1753) considered the series s_a(x)=sum_(n=1)^infty[1/(1-a^n)product_(k=0)^(n-1)(1-xa^(-k))]. He showed that just like log_a(a^n)=n, s_a(a^n)=n for nonnegative ...
Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...
If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...
A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...
1 ... 76|77|78|79|80|81|82 ... 155 Previous Next

...