Search Results for ""
491 - 500 of 1472 for Prime IdealSearch Results
A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...
A binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...
Like the entire harmonic series, the harmonic series sum_(k=1)^infty1/(p_k)=infty (1) taken over all primes p_k also diverges, as first shown by Euler in 1737 (Nagell 1951, ...
Twin primes are pairs of primes of the form (p, p+2). The term "twin prime" was coined by Paul Stäckel (1862-1919; Tietze 1965, p. 19). The first few twin primes are n+/-1 ...
The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...
If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...
A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...
Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...
The Jacobi symbol (a/y)=chi(y) as a number theoretic character can be extended to the Kronecker symbol (f(a)/y)=chi^*(y) so that chi^*(y)=chi(y) whenever chi(y)!=0. When y is ...
An irreducible fraction is a fraction p/q for which GCD(p,q)=1, i.e., p and q are relatively prime. For example, in the complex plane, (4+7i)/(2+i)=3+2i is reducible, while ...
...
View search results from all Wolfram sites (7660 matches)

