Search Results for ""

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

The Neuberg cubic Z(X_(30)) of a triangle DeltaABC is the locus of all points P whose reflections in the sidelines BC, CA, and ABform a triangle perspective to DeltaABC. It ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

Hadjicostas's formula is a generalization of the unit square double integral gamma=int_0^1int_0^1(x-1)/((1-xy)ln(xy))dxdy (1) (Sondow 2003, 2005; Borwein et al. 2004, p. 49), ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

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 ...

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 ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

The secant numbers S_k, also called the zig numbers or the Euler numbers E_n^*=|E_(2n)| numbers than can be defined either in terms of a generating function given as the ...