Search Results for ""

The power polynomials x^n are an associated Sheffer sequence with f(t)=t, (1) giving generating function sum_(k=0)^inftyx^kt^k=1/(1-tx) (2) and exponential generating ...

If f(x) is a nonconstant integer polynomial and c is an integer such that f(c) is divisible by the prime p, that p is called a prime divisor of the polynomial f(x) (Nagell ...

A polynomial having only real numbers as coefficients. A polynomial with real coefficients is a product of irreducible polynomials of first and second degrees.

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

Let m and m+h be two consecutive critical indices of f and let F be (m+h)-normal. If the polynomials p^~_k^((n)) are defined by p^~_0^((n))(u) = 1 (1) p^~_(k+1)^((n))(u) = ...

The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...

A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...

The constant polynomial P(x)=0 whose coefficients are all equal to 0. The corresponding polynomial function is the constant function with value 0, also called the zero map. ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...