Search Results for ""
421 - 430 of 2617 for Prime Generating PolynomialSearch Results
Given a number field K, a Galois extension field L, and prime ideals p of K and P of L unramified over p, there exists a unique element sigma=((L/K),P) of the Galois group ...
The notion of height is defined for proper ideals in a commutative Noetherian unit ring R. The height of a proper prime ideal P of R is the maximum of the lengths n of the ...
The radical of an ideal a in a ring R is the ideal which is the intersection of all prime ideals containing a. Note that any ideal is contained in a maximal ideal, which is ...
A maximal ideal of a ring R is an ideal I, not equal to R, such that there are no ideals "in between" I and R. In other words, if J is an ideal which contains I as a subset, ...
A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...
Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...
A Gaussian sum is a sum of the form S(p,q)=sum_(r=0)^(q-1)e^(-piir^2p/q), (1) where p and q are relatively prime integers. The symbol phi is sometimes used instead of S. ...
The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...
A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...
Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...
...
View search results from all Wolfram sites (24574 matches)

