Search Results for ""

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

A binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...

If x is a regular patch on a regular surface in R^3 with normal N^^, then x_(uu) = Gamma_(11)^1x_u+Gamma_(11)^2x_v+eN^^ (1) x_(uv) = Gamma_(12)^1x_u+Gamma_(12)^2x_v+fN^^ (2) ...

The identity PVint_(-infty)^inftyF(phi(x))dx=PVint_(-infty)^inftyF(x)dx (1) holds for any integrable function F(x) and phi(x) of the form ...

Consider a one-dimensional Hamiltonian map of the form H(p,q)=1/2p^2+V(q), (1) which satisfies Hamilton's equations q^. = (partialH)/(partialp) (2) p^. = ...

A partial differential equation of second-order, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called hyperbolic if the matrix Z=[A B; B C] (2) ...

A hyperelliptic curve is an algebraic curve given by an equation of the form y^2=f(x), where f(x) is a polynomial of degree n>4 with n distinct roots. If f(x) is a cubic or ...

A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...

The polynomials M_k(x;delta,eta) which form the Sheffer sequence for g(t) = {[1+deltaf(t)]^2+[f(t)]^2}^(eta/2) (1) f(t) = tan(t/(1+deltat)) (2) which have generating function ...

A mixed fraction is an improper fraction p/q>1 written in the form n+r/s. In common usage such as cooking recipes, n+r/s is often written as n r/s (e.g., 1 1/2), much to the ...