Search Results for ""

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...

The continued fraction ((x+1)^n-(x-1)^n)/((x+1)^n+(x-1)^n)=n/(x+)(n^2-1)/(3x+)(n^2-2^2)/(5x+...).

The second-order ordinary differential equation y^('')-[(m(m+1)+1/4-(m+1/2)cosx)/(sin^2x)+(lambda+1/2)]y=0.

The vector field N_f(z)=-(f(z))/(f^'(z)) arising in the definition of the Newtonian graph of a complex univariate polynomial f (Smale 1985, Shub et al. 1988, Kozen and ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

The partial differential equation u_t+45u^2u_x+15u_xu_(xx)+15uu_(xxx)+u_(xxxxx)=0.

Given a matrix A, let |A| denote its determinant. Then |A||A_(rs,pq)|=|A_(r,p)||A_(s,q)|-|A_(r,q)||A_(s,p)|, (1) where A_(u,w) is the submatrix of A formed by the ...

The second-order ordinary differential equation y^('')-[(M^2-1/4+K^2-2MKcosx)/(sin^2x)+(sigma+K^2+1/4)]y=0.

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

A Lyapunov function is a scalar function V(y) defined on a region D that is continuous, positive definite, V(y)>0 for all y!=0), and has continuous first-order partial ...