TOPICS
Search

Search Results for ""


281 - 290 of 2617 for Prime Generating PolynomialSearch Results
A distribution with probability function P(x)=(x^(alpha-1)(1+x)^(-alpha-beta))/(B(alpha,beta)), where B is a beta function. The mode of a variate distributed as ...
Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...
The minimal polynomial of a matrix A is the monic polynomial in A of smallest degree n such that p(A)=sum_(i=0)^nc_iA^i=0. (1) The minimal polynomial divides any polynomial q ...
A polynomial that represents integers for all integer values of the variables. An integer polynomial is a special case of such a polynomial. In general, every integer ...
An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...
Let f be an integer polynomial. The f can be factored into a product of two polynomials of lower degree with rational coefficients iff it can be factored into a product of ...
A sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...
If a polynomial P(x) is divided by (x-r), then the remainder is a constant given by P(r).
A 1-variable unoriented knot polynomial Q(x). It satisfies Q_(unknot)=1 (1) and the skein relationship Q_(L_+)+Q_(L_-)=x(Q_(L_0)+Q_(L_infty)). (2) It also satisfies ...
The w-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. Setting f_n(1)=f_n (1) give a Fermat-Lucas number. The first few Fermat-Lucas ...
1 ... 26|27|28|29|30|31|32 ... 262 Previous Next

...