Search Results for ""

Let a circle C_1 lie inside another circle C_2. From any point on C_2, draw a tangent to C_1 and extend it to C_2. From the point, draw another tangent, etc. For n tangents, ...

A general set of methods for integrating ordinary differential equations. Predictor-corrector methods proceed by extrapolating a polynomial fit to the derivative from the ...

k+2 is prime iff the 14 Diophantine equations in 26 variables wz+h+j-q=0 (1) (gk+2g+k+1)(h+j)+h-z=0 (2) 16(k+1)^3(k+2)(n+1)^2+1-f^2=0 (3) 2n+p+q+z-e=0 (4) ...

A principal ideal domain is an integral domain in which every proper ideal can be generated by a single element. The term "principal ideal domain" is often abbreviated P.I.D. ...

An encoding which provides a bijection between the n^(n-2) labeled trees on n nodes and strings of n-2 integers chosen from an alphabet of the numbers 1 to n. A labeled tree ...

R(p,tau)=int_(-infty)^inftyint_(-infty)^inftyf(x,y)delta[y-(tau+px)]dydx, (1) where f(x,y)={1 for x,y in [-a,a]; 0 otherwise (2) and ...

Let ad=bc, then (1) This can also be expressed by defining (2) (3) Then F_(2m)(a,b,c,d)=a^(2m)f_(2m)(x,y), (4) and identity (1) can then be written ...

Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...