Search Results for ""

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).

The prime link 02-0201 which has Jones polynomial V(t)=-t-t^(-1) and HOMFLY polynomial P(z,alpha)=z^(-1)(alpha^(-1)-alpha^(-3))+zalpha^(-1). It has braid word sigma_1^2.

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 ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

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 ...

Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...