Search Results for ""

A power floor prime sequence is a sequence of prime numbers {|_theta^n_|}_n, where |_x_| is the floor function and theta>1 is real number. It is unknown if, though extremely ...

A number n is practical if for all k<=n, k is the sum of distinct proper divisors of n. Defined in 1948 by A. K. Srinivasen. All even perfect numbers are practical. The ...

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

An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...

A triangle with rows containing the numbers {1,2,...,n} that begins with 1, ends with n, and such that the sum of each two consecutive entries being a prime. Rows 2 to 6 are ...

An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...

A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...

A primitive Pythagorean triple is a Pythagorean triple (a,b,c) such that GCD(a,b,c)=1, where GCD is the greatest common divisor. A right triangle whose side lengths give a ...

A primitive right triangle is a right triangle having integer sides a, b, and c such that GCD(a,b,c)=1, where GCD(a,b,c) is the greatest common divisor. The set of values ...

A principal nth root omega of unity is a root satisfying the equations omega^n=1 and sum_(i=0)^(n-1)omega^(ij)=0 for j=1, 2, ..., n. Therefore, every primitive root of unity ...