Timeline for Perfect numbers $n$ such that $2^k(n+1)$ is also perfect
Current License: CC BY-SA 3.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 7, 2022 at 2:56 | comment | added | Jose Arnaldo Bebita | @LuisHGallardo: Apologies for bumping this question from May 2011 to the front page, but do you happen to know if the case of even $m$ and odd $n$ has been ruled out? | |
Aug 11, 2013 at 2:34 | answer | added | Jose Arnaldo Bebita | timeline score: 0 | |
May 10, 2011 at 17:51 | vote | accept | Luis H Gallardo | ||
May 9, 2011 at 0:34 | history | edited | Luis H Gallardo | CC BY-SA 3.0 |
added 87 characters in body
|
May 9, 2011 at 0:33 | comment | added | Luis H Gallardo | Thanks, no problem; Probably the question was also not completely clear... I will edit it a little. | |
May 9, 2011 at 0:19 | comment | added | Todd Trimble | Well, I've looked at it a little longer, and I guess I spoke too soon, and I owe you an apology. | |
May 9, 2011 at 0:18 | comment | added | Luis H Gallardo | Do you really have a solution with odd $n$ ???? should be published. | |
May 9, 2011 at 0:16 | comment | added | Luis H Gallardo | Think a little harder Todd Trimble ! | |
May 9, 2011 at 0:03 | comment | added | Luis H Gallardo | add your answer to gerry's in order to have a complete solution then... | |
May 9, 2011 at 0:01 | comment | added | Todd Trimble | Think a little harder, Luis Gallardo. | |
May 8, 2011 at 23:58 | answer | added | Gerry Myerson | timeline score: 3 | |
May 8, 2011 at 23:57 | comment | added | Luis H Gallardo | false: since you take $n$ even, but it may be odd ... | |
May 8, 2011 at 23:53 | comment | added | Todd Trimble | I really think this is too elementary for this site. The short answer to your question is 'no'. It follows very easily from the binary representation of <a href="en.wikipedia.org/wiki/… perfect numbers</a>. Alternatively, you might try your question over at math.stackexchange.com. | |
May 8, 2011 at 23:40 | history | asked | Luis H Gallardo | CC BY-SA 3.0 |