×

Multiperfect numbers on lines of the Pascal triangle. (English) Zbl 1171.11002

A positive integer \(n\) is said to be \(k\)-fold perfect (or multiperfect or multiply perfect) if \(\sigma(n) = kn\). The 3-fold perfect numbers are also called triperfect, and only six of them are known: 120, 672, 523776, 459818240, 1476304896, 51001180160. Several multiperfect numbers are also known for every \(k\leq 11\). Their number varies from thousands for \(k = 8, 9, 10\), to only one for \(k = 11\), which has more than a thousand decimal digits and was discovered in 2001. Descartes discovered the first 4-fold number, and Fermat the first 5-fold number. Except for the well-known Euclid-Euler rule for \(k = 2\), no formula to generate multiperfect numbers is known. Lehmer proved that if \(n\) is odd, then \(n\) is perfect just if \(2n\) is 3-fold perfect. No odd multiperfect number is known.
There are various extensions of perfect and multiperfect numbers in the literature. For example, a positive integer \(n\) is called \((m, k)\)-perfect if \(\sigma^{(m)}(n) =kn\), where \(\sigma^{(m)}\) denotes the \(m\)th fold iterate of the sum of divisors function \(\sigma\).
The present authors study the multiperfect and \((2, k)\)-perfect numbers on straight lines through the Pascal triangle. They show that except for the lines parallel to the edges, all other lines through the Pascal triangle contain at most finitely many multiperfect and \((2, k)\)-perfect numbers. The authors also show, among others, that the only \(n\) such that \(B_n\) is multiperfect is \(n = 2\) and the only \(n\) such that \(C_n\) is multiperfect is \(n = 1\), where \(B_n={2n\choose n}\) is the \(n\)th middle binomial coefficient and \(C_n={1\over n+1} B_n\) is the \(n\)th Catalan number. For \((2, k)\)-perfect numbers these values are \(n = 1\) and \(n = 1, 2, 5\). Further, the authors study the distribution of the numbers \(\sigma(n)/n\) whenever the positive integer \(n\) ranges through the binomial coefficients on a fixed line through the Pascal triangle.
For a general account of perfect and related numbers, see [J. Sándor and B. Crstici, Handbook of number theory. II. Dordrecht: Kluwer Academic Publishers (2004; Zbl 1079.11001)].

MSC:

11A25 Arithmetic functions; related numbers; inversion formulas
11B65 Binomial coefficients; factorials; \(q\)-identities

Citations:

Zbl 1079.11001
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dickson, L. E., History of the Theory of Numbers, vol. 1 (1971), Carnegie Institute of Washington: Chelsea, Reprinted by
[2] Everling, U., Solution to “Problem 10331”, Amer. Math. Monthly, 103, 701-702 (1996)
[3] Graham, R. L.; Knuth, D. E.; Patashnik, O., Concrete Mathematics: A Foundation for Computer Science (1989), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0668.00003
[4] Granville, A.; Ramaré, O., Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients, Mathematika, 43, 73-107 (1996) · Zbl 0868.11009
[5] Guy, R. K., Unsolved Problems in Number Theory (2004), Springer · Zbl 1058.11001
[6] Lehmer, D. N., Multiply perfect numbers, Ann. of Math. (2), 2, 103-104 (1900/1901) · JFM 32.0190.03
[7] Luca, F., Perfect Fibonacci and Lucas numbers, Rend. Circ. Mat. Palermo (2), 49, 313-318 (2000) · Zbl 0972.11007
[8] Luca, F., The anti-social Fermat number, Amer. Math. Monthly, 107, 171-173 (2000) · Zbl 1002.11007
[9] Luca, F., Multiply perfect numbers in Lucas sequences with odd parameters, Publ. Math. Debrecen, 58, 121-155 (2001) · Zbl 0973.11009
[10] Luca, F., Problem H-599, Fibonacci Quart., 41, 380 (2003)
[11] Luca, F., On the sum of divisors of the Mersenne numbers, Math. Slovaca, 53, 457-466 (2003) · Zbl 1061.11005
[12] Luca, F., Sums of divisors of binomial coefficients, Int. Math. Res. Not. IMRN (2007), Article ID rnm101
[13] Luca, F., Problem 73, Gac. R. Soc. Mat. Esp., 10, 145 (2007), (in Spanish)
[14] Luca, F., Solution to “Problem 73”, Gac. R. Soc. Mat. Esp., 11, 98-99 (2008), (in Spanish)
[15] Luca, F.; Pappalardi, F., Members of binary recurrences on lines of the Pascal triangle, Publ. Math. Debrecen, 67, 103-113 (2005) · Zbl 1090.11013
[16] Luca, F.; Pomerance, C., On some problems of Ma̧kowski-Schinzel and Erdős concerning the arithmetical functions \(φ\) and \(σ\), Colloq. Math., 92, 111-130 (2002) · Zbl 1027.11007
[17] Luca, F.; Shparlinski, I. E., Arithmetic functions with linear recurrence sequences, J. Number Theory, 125, 459-472 (2007) · Zbl 1222.11117
[18] Pomerance, C., Problem 10331, Amer. Math. Monthly, 100, 796 (1993)
[19] Rosser, J. B.; Schoenfeld, L., Approximate formulas for some functions of prime numbers, Illinois J. Math., 6, 64-94 (1962) · Zbl 0122.05001
[20] Saradha, N.; Shorey, T. N., Almost squares and factorisations in consecutive integers, Compos. Math., 138, 113-124 (2003) · Zbl 1038.11020
[21] Schinzel, A., On primitive prime factors of \(a^n - b^n\), Proc. Cambridge Philos. Soc., 58, 555-562 (1962) · Zbl 0114.02605
[22] Shparlinski, I. E., Some arithmetic properties of recurrence sequences, Mat. Zametki, 47, 612-617 (1990), (in Russian) · Zbl 0714.11009
[23] Sloane, N. J.A., Multiply-perfect numbers, The On-Line Encyclopedia of Integer Sequences · Zbl 0379.94012
[24] Zsigmondy, K., Zür Theorie der Potenzreste, Monatsh. Math., 3, 265-284 (1892) · JFM 24.0176.02
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.