Search Results for ""

A more common way to describe a Euclidean ring.

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

Let phi be a map. Then phi is expansive if the statement that the distance d(phi^nx,phi^ny)<delta for all n in Z implies that x=y. Equivalently, phi is expansive if the ...

Given a semicircular hump f(x) = sqrt(L^2-(x-L)^2) (1) = sqrt((2L-x)x), (2) the Fourier coefficients are a_0 = 1/2piL (3) a_n = ((-1)^nLJ_1(npi))/n (4) b_n = 0, (5) where ...

The generalized Riemann hypothesis conjectures that neither the Riemann zeta function nor any Dirichlet L-series has a zero with real part larger than 1/2. Compare with ...

The set of sums sum_(x)a_xx ranging over a multiplicative group and a_i are elements of a field with all but a finite number of a_i=0. Group rings are graded algebras.

Johnson solid J_(25).

A one-dimensional transform which makes use of the Haar functions.

The half-altitude circle is the circumcircle of the half-altitude triangle. The circle function is given by l=(f(a,b,c))/(128a^2b^3c^3cosAcosBcosC), (1) where (2) which is ...

J_n(z) = 1/(2pi)int_(-pi)^pie^(izcost)e^(in(t-pi/2))dt (1) = (i^(-n))/piint_0^pie^(izcost)cos(nt)dt (2) = 1/piint_0^picos(zsint-nt)dt (3) for n=0, 1, 2, ..., where J_n(z) is ...