Search Results for ""

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

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary perfect number is a number n such that sigma_infty(n)=2n. The first few are 6, 60, 90, ...

An operator U satisfying U^|U = 1 (1) UU^| = 1, (2) where U^| is the adjoint.

A number n for which the product of divisors is equal to n^2. The first few are 1, 6, 8, 10, 14, 15, 21, 22, ... (OEIS A007422).

The word "number" is a general term which refers to a member of a given (possibly ordered) set. The meaning of "number" is often clear from context (i.e., does it refer to a ...

A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...

The term perfect square is used to refer to a square number, a perfect square dissection, or a factorable quadratic polynomial of the form a^2+/-2ab+b^2=(a+/-b)^2.

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...