Search Results for ""
571 - 580 of 947 for Operations on polynomialsSearch Results
A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...
Classical algebraic geometry is the study of algebraic varieties, both affine varieties in C^n and projective algebraic varieties in CP^n. The original motivation was to ...
An entire Cremona transformation is a birational transformation of the plane. Cremona transformations are maps of the form x_(i+1) = f(x_i,y_i) (1) y_(i+1) = g(x_i,y_i), (2) ...
Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...
Given two circles, draw the tangents from the center of each circle to the sides of the other. Then the line segments AB and CD are of equal length. The theorem can be proved ...
Let f(theta) be Lebesgue integrable and let f(r,theta)=1/(2pi)int_(-pi)^pif(t)(1-r^2)/(1-2rcos(t-theta)+r^2)dt (1) be the corresponding Poisson integral. Then almost ...
The integral 1/(2pi(n+1))int_(-pi)^pif(x){(sin[1/2(n+1)x])/(sin(1/2x))}^2dx which gives the nth Cesàro mean of the Fourier series of f(x).
For any real alpha and beta such that beta>alpha, let p(alpha)!=0 and p(beta)!=0 be real polynomials of degree n, and v(x) denote the number of sign changes in the sequence ...
A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...
If x_1<x_2<...<x_n denote the zeros of p_n(x), there exist real numbers lambda_1,lambda_2,...,lambda_n such that ...
...
View search results from all Wolfram sites (210281 matches)

