Search Results for ""
751 - 760 of 2089 for Eulers Polygon Division ProblemSearch Results
An algebraic identity is a mathematical identity involving algebraic functions. Examples include the Euler four-square identity, Fibonacci identity, Lebesgue identity, and ...
The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...
A generalization of Fermat's little theorem. Euler published a proof of the following more general theorem in 1736. Let phi(n) denote the totient function. Then a^(phi(n))=1 ...
Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...
The Machin-like formula 1/4pi=2cot^(-1)(2)-cot^(-1)(7). The other 2-term Machin-like formulas are Euler's Machin-like formula, Hutton's formula, and Machin's formula.
The Machin-like formula 1/4pi=2cot^(-1)(3)+cot^(-1)(7). The other two-term Machin-like formulas are Euler's Machin-like formula, Hermann's formula, and Machin's formula.
Given a geodesic triangle (a triangle formed by the arcs of three geodesics on a smooth surface), int_(ABC)Kda=A+B+C-pi. Given the Euler characteristic chi, intintKda=2pichi, ...
e^(i(ntheta))=(e^(itheta))^n. (1) From the Euler formula it follows that cos(ntheta)+isin(ntheta)=(costheta+isintheta)^n. (2) A similar identity holds for the hyperbolic ...
A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...
In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...
...
View search results from all Wolfram sites (162574 matches)

