Talk:Hyperperfect number

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Minoli[edit]

Hyperperfect numbers were introduced (invented) by Daniel Minoli and Rober Bear in 1975. The original reference is

  • Daniel Minoli, Robert Bear, Hyperperfect Numbers, PME Journal, Fall 1975, pp. 153-157.

Other early references are as follows:

  • Daniel Minoli, Issue In Non-Linear Hyperperfect Numbers, Mathematics of Computation, Vol. 34, No. 150, April 1980, pp. 639-645.
  • Daniel Minoli, New Results For Hyperperfect Numbers, Abstracts American Math. Soc., October 1980, Issue 6, Vol. 1, pp. 561.
  • Daniel Minoli, Structural Issues For Hyperperfect Numbers, Fibonacci Quarterly, Feb. 1981, Vol. 19, No. 1, pp. 6-14.

Dan Minoli can be reached at minoli@comcast.net (also see google.com with search "daniel minoli"


It is also possible to show that if k > and p = k + 1 is prime, [...]

k is greater than what?

External links modified[edit]

Hello fellow Wikipedians,

I have just modified one external link on Hyperperfect number. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 09:39, 7 April 2017 (UTC)[reply]

External links modified[edit]

Hello fellow Wikipedians,

I have just modified one external link on Hyperperfect number. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 14:38, 9 November 2017 (UTC)[reply]

formula not correct??[edit]

for k=1, S(n)=n, so the equation reads n = 1 + 1 * ( n - n - 1 ) =0. also for k=2, the formula says 21 = 1 + 2 * ( (1+3+7) - 21 - 1) = 1 + 2 * ( 11 - 22 ) which is not 21. 186.139.188.31 (talk) 22:21, 2 March 2022 (UTC)[reply]

Hyperperfect numbers satisfy n = 1 + k(σ(n) − n − 1). In your first line, the first term inside the parentheses is σ(n), not n. Bubba73 You talkin' to me? 00:48, 3 March 2022 (UTC)[reply]