Practical number

In mathematics, and in particular number theory, a practical number or panarithmic number is a positive integer n such that all smaller positive integers can be represented as sums of distinct divisors of n. For example, 12 is a practical number because all the numbers from 1 to 11 can be expressed as sums of its divisors 1, 2, 3, 4, and 6: as well as these divisors themselves, we have 5=3+2, 7=6+1, 8=6+2, 9=6+3, 10=6+3+1, and 11=6+3+2.

The sequence of practical numbers (sequence A005153 in OEIS) begins

1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 28, 30, 32, 36, 40, 42, 48, 54, ...

Practical numbers were used by Fibonacci in his Liber Abaci (1202) in connection with the problem of representing rational numbers as Egyptian fractions. Fibonacci does not formally define practical numbers, but he gives a table of Egyptian fraction expansions for fractions with practical denominators (Sigler 2002). In the modern mathematical literature, beginning with Srinivasan (1948), practical numbers have been studied for their similarities with prime numbers. A characterization by Stewart makes it possible to determine whether a number is practical by examining its prime factorization. Any even perfect number and any power of two is also a practical number.

[edit] Practical numbers and Egyptian fractions

If n is practical, then any rational number of the form m/n may be represented as a sum ∑d_i/n where each d_i is a distinct divisor of n. Each term in this sum simplifies to a unit fraction, so such a sum provides a representation of m/n as an Egyptian fraction. For instance,

$\frac{13}{20}=\frac{10}{20}+\frac{2}{20}+\frac{1}{20}=\frac12+\frac1{10}+\frac1{20}.$

Fibonacci, in his 1202 book Liber Abaci (Sigler 2002) lists several methods for finding Egyptian fraction representations of a rational number. Of these, the first is to test whether the number is itself already a unit fraction, but the second is to search for a representation of the numerator as a sum of divisors of the denominator, as described above; this method is only guaranteed to succeed for denominators that are practical. Fibonacci provides tables of these representations for fractions having as denominators the practical numbers 6, 8, 12, 20, 24, 60, and 100.

[edit] Characterization of practical numbers

As Stewart (1954) showed, it is straightforward to determine whether a number is practical from its prime factorization. A positive integer $n=p_1^{\alpha_1}...p_k^{\alpha_k}$ with $n > 1$ and $p_1<p_2<\dots<p_k$ primes is practical if and only if $p 1 = 2$ and for $i=2,\dots,k$

$p_i\leq1+\sigma(p_1^{\alpha_1}\dots p_{i-1}^{\alpha_{i-1}})=1+\prod_{j=1}^{i-1}\frac{p_j^{\alpha_j+1}-1}{p_j-1},$

where $σ(x)$ denotes the sum of the divisors of x. For example, 3 ≤ σ(2)+1 = 4, 29 ≤ σ(2 × 3²)+1 = 40, and 823 ≤ σ(2 × 3² × 29)+1=1171, so 2 × 3² × 29 × 823 = 429606 is practical.

In one direction, this condition is clearly necessary in order to be able to represent $p i - 1$ as a sum of divisors of n. In the other direction, the condition is sufficient, as can be shown by induction. More strongly, one can show that, if the factorization of n satisfies the condition above, then any $m \le \sigma(n)$ can be represented as a sum of divisors of n, by the following sequence of steps:

Let $q = \min\{\lfloor m/p_k^{\alpha_k}\rfloor, \sigma(n/p_k^{\alpha_k})\}$ , and let $r = m - qp_k^{\sigma_k}$ .
Since $q\le\sigma(n/p_k^{\alpha_k})$ and $n/p_k^{\alpha_k}$ can be shown by induction to be practical, we can find a representation of q as a sum of divisors of $n/p_k^{\alpha_k}$ .
Since $r\le \sigma(n) - p_k^{\alpha_k}\sigma(n/p_k^{\alpha_k}) = \sigma(n/p_k)$ , and since $n / p k$ can be shown by induction to be practical, we can find a representation of r as a sum of divisors of $n / p k$ .
The divisors representing r, together with $p_k^{\alpha_k}$ times each of the divisors representing q, together form a representation of m as a sum of divisors of n.

Any power of two is a practical number, because it trivially satisfies this characterization: the only prime in its factorization, p₁, equals two as required. Any even perfect number is also a practical number: due to Euler's result that these numbers must have the form 2^n − 1(2ⁿ − 1), every odd prime factor of an even perfect number must be at most the sum of the divisors of the even part of the number, and therefore the number must satisfy Stewart's characterization.

[edit] Analogies with prime numbers

One reason for interest in practical numbers is that many of their properties are similar to properties of the prime numbers. For example, if p(x) is the enumerating function of practical numbers, i.e., the number of practical numbers not exceeding x, Saias (1997) proved that for suitable constants c₁ and c₂:

$c_1\frac x{\log x}<p(x)<c_2\frac x{\log x},$

a formula which resembles the prime number theorem. This result largely resolved a conjecture of Margenstern (1991) that p(x) is asymptotic to cx/log x for some constant c.

Theorems analogous to Goldbach's conjecture and the twin prime conjecture are also known for practical numbers: every positive even integer is the sum of two practical numbers, and there exist infinitely many triples of practical numbers x − 2, x, x + 2 (Melfi 1996). Melfi also showed that there are infinitely many practical Fibonacci numbers (sequence A124105 in OEIS); the analogous question of the existence of infinitely many Fibonacci primes is open. Hausman & Shapiro (1984) showed that there always exists a practical number in the interval [x²,(x + 1)²] for any positive real x, a result analogous to Legendre's conjecture for primes.

[edit] References

Hausman, Miriam; Shapiro, Harold N. (1984), "On practical numbers", Communications on Pure and Applied Mathematics 37 (5): 705–713, doi:10.1002/cpa.3160370507, MR 0752596 .

Margenstern, Maurice (1991), "Les nombres pratiques: théorie, observations et conjectures", Journal of Number Theory 37 (1): 1–36, doi:10.1016/S0022-314X(05)80022-8, MR 1089787 .

Melfi, Giuseppe (1996), "On two conjectures about practical numbers", Journal of Number Theory 56 (1): 205–210, doi:10.1006/jnth.1996.0012, MR 1370203 .

Saias, Eric (1997), "Entiers à diviseurs denses, I", Journal of Number Theory 62 (1): 163–191, doi:10.1006/jnth.1997.2057, MR 1430008 .

Sigler, Laurence E. (trans.) (2002), Fibonacci's Liber Abaci, Springer-Verlag, pp. 119–121, ISBN 0-387-95419-8 .

Srinivasan, A. K. (1948), "Practical numbers", Current Science 17: 179–180, MR 0027799 .

Stewart, B. M. (1954), "Sums of distinct divisors", American Journal of Mathematics 76: 779–785, doi:10.2307/2372651, MR 0064800 .

[edit] External links

Tables of practical numbers compiled by Giuseppe Melfi
Practical Number at PlanetMath.
Weistein, Eric W., "Practical Number" from MathWorld.

Practical number

From Wikipedia, the free encyclopedia

Contents

[edit] Practical numbers and Egyptian fractions

[edit] Characterization of practical numbers

[edit] Analogies with prime numbers

[edit] References

[edit] External links

Views

Personal tools

Navigation

Search

Interaction

Toolbox

Languages