Search Results for ""

If f(x) is a nonconstant integer polynomial and c is an integer such that f(c) is divisible by the prime p, that p is called a prime divisor of the polynomial f(x) (Nagell ...

The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

1 and -1 are the only integers which divide every integer. They are therefore called the prime units.

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...

The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...

A deletable prime is a prime number which has the property that deleting digits one at a time in some order gives a prime at each step. For example, 410256793 is a deletable ...