Search Results for ""

A Woodall number is a number of the form W_n=2^nn-1. Woodall numbers are therefore similar to Mersenne numbers 2^n-1 but with an additional factor of n multiplying the power ...

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...

Iff p is a prime, then (p-1)!+1 is a multiple of p, that is (p-1)!=-1 (mod p). (1) This theorem was proposed by John Wilson and published by Waring (1770), although it was ...

The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...

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

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A divisor d of a positive integer n is biunitary if the greatest common unitary divisor of d and n/d is 1. For a prime power p^y, the biunitary divisors are the powers 1, p, ...

The two functions theta(x) and psi(x) defined below are known as the Chebyshev functions. The function theta(x) is defined by theta(x) = sum_(k=1)^(pi(x))lnp_k (1) = ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...