Search Results for ""
341 - 350 of 2617 for Prime Generating PolynomialSearch Results
Eisenstein's irreducibility criterion is a sufficient condition assuring that an integer polynomial p(x) is irreducible in the polynomial ring Q[x]. The polynomial ...
Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...
Solomon's seal knot is the prime (5,2)-torus knot 5_1 with braid word sigma_1^5. It is also known as the cinquefoil knot (a name derived from certain herbs and shrubs of the ...
If a prime number divides a norm but not the bases of the norm, it is itself a norm.
A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.
The Miller Institute knot is the 6-crossing prime knot 6_2. It is alternating, chiral, and invertible. A knot diagram of its laevo form is illustrated above, which is ...
The stevedore's knot is the 6-crossing prime knot 6_1. It is implemented in the Wolfram Language as KnotData["Stevedore"]. It has braid word ...
The arf invariant is a link invariant that always has the value 0 or 1. A knot has Arf invariant 0 if the knot is "pass equivalent" to the unknot and 1 if it is pass ...
Erdős proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n>6.
A subfield which is strictly smaller than the field in which it is contained. The field of rationals Q is a proper subfield of the field of real numbers R which, in turn, is ...
...
View search results from all Wolfram sites (24574 matches)

