Search Results for ""

The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...

The function lambda(n)=(-1)^(Omega(n)), (1) where Omega(n) is the number of not necessarily distinct prime factors of n, with Omega(1)=0. The values of lambda(n) for n=1, 2, ...

A number n which is an integer multiple k of the sum of its unitary divisors sigma^*(n) is called a unitary k-multiperfect number. There are no odd unitary multiperfect ...

Let the multiples m, 2m, ..., [(p-1)/2]m of an integer such that pm be taken. If there are an even number r of least positive residues mod p of these numbers >p/2, then m is ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

A number n such that sigma^2(n)=sigma(sigma(n))=2n, where sigma(n) is the divisor function is called a superperfect number. Even superperfect numbers are just 2^(p-1), where ...

An integer n which is tested to see if it divides a given number.