Search Results for ""

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...

The word quantile has no fewer than two distinct meanings in probability. Specific elements x in the range of a variate X are called quantiles, and denoted x (Evans et al. ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

A real polynomial P is said to be stable if all its roots lie in the left half-plane. The term "stable" is used to describe such a polynomial because, in the theory of linear ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

Given a property P, if P(x)∼x as x->infty (so, using asymptotic notation, the number of numbers less than x not satisfying the property P is o(x), where o(x) is one of the ...

A number which can be represented both in the form x_0^2-Dy_0^2 and in the form Dx_1^2-y_1^2. This is only possible when the Pell equation x^2-Dy^2=-1 (1) is solvable. Then ...

In common usage, a cardinal number is a number used in counting (a counting number), such as 1, 2, 3, .... In formal set theory, a cardinal number (also called "the ...