TOPICS
Search

Search Results for ""


911 - 920 of 2617 for Prime Generating PolynomialSearch Results
Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...
Let K be a field of arbitrary characteristic. Let v:K->R union {infty} be defined by the following properties: 1. v(x)=infty<=>x=0, 2. v(xy)=v(x)+v(y) forall x,y in K, and 3. ...
If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...
A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...
Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...
The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...
A one-sided (singly infinite) Z-Transform, Z[{a_n}_(n=0)^infty](z)=sum_(n=0)^infty(a_n)/(z^n). This is the most common variety of Z-transform since it is essentially ...
An integer n which is tested to see if it divides a given number.
The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.
A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...
1 ... 89|90|91|92|93|94|95 ... 262 Previous Next

...