Granville number

From testwiki
Revision as of 18:59, 11 May 2024 by imported>Usermaths (โ†’S-perfect numbers)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)
Jump to navigation Jump to search

In mathematics, specifically number theory, Granville numbers, also known as ๐’ฎ-perfect numbers, are an extension of the perfect numbers.

The Granville set

In 1996, Andrew Granville proposed the following construction of a set ๐’ฎ:[1]

Let 1๐’ฎ, and for any integer n larger than 1, let n๐’ฎ if
dn,d<n,d๐’ฎdn.

A Granville number is an element of ๐’ฎ for which equality holds, that is, n is a Granville number if it is equal to the sum of its proper divisors that are also in ๐’ฎ. Granville numbers are also called ๐’ฎ-perfect numbers.[2]

General properties

The elements of ๐’ฎ can be Template:Math-deficient, Template:Math-perfect, or Template:Math-abundant. In particular, 2-perfect numbers are a proper subset of ๐’ฎ.[1]

S-deficient numbers

Numbers that fulfill the strict form of the inequality in the above definition are known as ๐’ฎ-deficient numbers. That is, the ๐’ฎ-deficient numbers are the natural numbers for which the sum of their divisors in ๐’ฎ is strictly less than themselves:

dn,d<n,d๐’ฎd<n

S-perfect numbers

Numbers that fulfill equality in the above definition are known as ๐’ฎ-perfect numbers.[1] That is, the ๐’ฎ-perfect numbers are the natural numbers that are equal the sum of their divisors in ๐’ฎ. The first few ๐’ฎ-perfect numbers are:

6, 24, 28, 96, 126, 224, 384, 496, 1536, 1792, 6144, 8128, 14336, ... Template:OEIS

Every perfect number is also ๐’ฎ-perfect.[1] However, there are numbers such as 24 which are ๐’ฎ-perfect but not perfect. The only known ๐’ฎ-perfect number with three distinct prime factors is 126 = 2 ยท 32 ยท 7.[2]

Every number of form 2^(n - 1) * (2^n - 1) * (2^n)^m where m >= 0, where 2^n - 1 is Prime, are Granville Numbers. So, there are infinitely many Granville Numbers and the infinite family has 2 prime factors- 2 and a Mersenne Prime. Others include 126, 5540590, 9078520, 22528935, 56918394 and 246650552 having 3, 5, 5, 5, 5 and 5 prime factors.

S-abundant numbers

Numbers that violate the inequality in the above definition are known as ๐’ฎ-abundant numbers. That is, the ๐’ฎ-abundant numbers are the natural numbers for which the sum of their divisors in ๐’ฎ is strictly greater than themselves:

dn,d<n,d๐’ฎd>n

They belong to the complement of ๐’ฎ. The first few ๐’ฎ-abundant numbers are:

12, 18, 20, 30, 42, 48, 56, 66, 70, 72, 78, 80, 84, 88, 90, 102, 104, ... Template:OEIS

Examples

Every deficient number and every perfect number is in ๐’ฎ because the restriction of the divisors sum to members of ๐’ฎ either decreases the divisors sum or leaves it unchanged. The first natural number that is not in ๐’ฎ is the smallest abundant number, which is 12. The next two abundant numbers, 18 and 20, are also not in ๐’ฎ. However, the fourth abundant number, 24, is in ๐’ฎ because the sum of its proper divisors in ๐’ฎ is:

1 + 2 + 3 + 4 + 6 + 8 = 24

In other words, 24 is abundant but not ๐’ฎ-abundant because 12 is not in ๐’ฎ. In fact, 24 is ๐’ฎ-perfect - it is the smallest number that is ๐’ฎ-perfect but not perfect.

The smallest odd abundant number that is in ๐’ฎ is 2835, and the smallest pair of consecutive numbers that are not in ๐’ฎ are 5984 and 5985.[1]

References

Template:Reflist