Search Results for ""

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...

Let a!=b, A, and B denote positive integers satisfying (a,b)=1 (A,B)=1, (i.e., both pairs are relatively prime), and suppose every prime p=B (mod A) with (p,2ab)=1 is ...

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

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

The nth Ramanujan prime is the smallest number R_n such that pi(x)-pi(x/2)>=n for all x>=R_n, where pi(x) is the prime counting function. In other words, there are at least n ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

A knot is called prime if, for any decomposition as a connected sum, one of the factors is unknotted (Livingston 1993, pp. 5 and 78). A knot which is not prime is called a ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...