TOPICS
Search

Search Results for ""


491 - 500 of 2617 for Prime Generating PolynomialSearch Results
Andrica's conjecture states that, for p_n the nth prime number, the inequality A_n=sqrt(p_(n+1))-sqrt(p_n)<1 holds, where the discrete function A_n is plotted above. The ...
A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...
A generalization by Kronecker of Kummer's theory of prime ideal factors. A divisor on a full subcategory C of mod(A) is an additive mapping chi on C with values in a ...
Two numbers are heterogeneous if their prime factors are distinct. For example, 6=2·3 and 24=2^3·3 are not heterogeneous since their factors are each (2, 3).
If a subset S of the elements of a field F satisfies the field axioms with the same operations of F, then S is called a subfield of F. In a finite field of field order p^n, ...
A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...
Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...
A regular ring in the sense of commutative algebra is a commutative unit ring such that all its localizations at prime ideals are regular local rings. In contrast, a von ...
The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...
In Note M, Burnside (1955) states, "The contrast that these results shew between groups of odd and of even order suggests inevitably that simple groups of odd order do not ...
1 ... 47|48|49|50|51|52|53 ... 262 Previous Next

...