Timeline for If $N = qn^2$ is an odd perfect number with $\gcd(q,n)=1$, is it possible to have $q + 1 = \sigma(n)$?
Current License: CC BY-SA 4.0
62 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11 at 5:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 12 at 4:07 | history | edited | Jose Arnaldo Bebita | CC BY-SA 4.0 |
edited body
|
| Jul 31 at 6:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| S Jul 1 at 4:38 | history | suggested | no upstairs |
Tag revision
|
|
| Jun 30 at 18:52 | review | Suggested edits | |||
| S Jul 1 at 4:38 | |||||
| Jun 30 at 18:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 2 at 17:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 3, 2023 at 16:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 6, 2023 at 15:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 8, 2023 at 15:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 8, 2022 at 14:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 11, 2022 at 14:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 11, 2022 at 13:51 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question was bumped anyway)
|
| Jun 11, 2022 at 6:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 11, 2022 at 5:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 9, 2018 at 10:10 | history | edited | Jose Arnaldo Bebita | CC BY-SA 4.0 |
added GCD constraint
|
| May 16, 2018 at 8:14 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 16, 2018 at 8:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 17, 2018 at 7:14 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 15, 2018 at 6:18 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 16, 2018 at 5:27 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 17, 2017 at 4:29 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 17, 2017 at 4:17 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 18, 2017 at 3:56 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 18, 2017 at 2:58 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 5, 2017 at 22:43 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 6, 2017 at 22:36 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 6, 2017 at 22:32 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 7, 2017 at 22:14 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 7, 2017 at 22:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 8, 2017 at 21:52 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 6, 2017 at 21:32 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 7, 2017 at 21:12 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 8, 2016 at 20:52 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 8, 2016 at 19:56 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 9, 2016 at 19:26 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 9, 2016 at 16:27 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 10, 2016 at 15:37 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 11, 2016 at 14:46 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 11, 2016 at 14:13 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 12, 2016 at 14:13 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 12, 2016 at 11:59 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
added parentheses
|
| Feb 7, 2016 at 21:53 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
inserted a brief remark about an error with elementary logic
|
| Feb 7, 2016 at 12:19 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
added further details
|
| Feb 7, 2016 at 12:11 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
added further details
|
| Feb 6, 2016 at 8:38 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
corrected upper bound for $\sigma(q)/n$
|
| Feb 6, 2016 at 7:10 | comment | added | Jose Arnaldo Bebita | @SylvainJULIEN, the same results have already been communicated to myself by Patrick starting December 2015. He e-mailed me a partial proof for $q^k < n$ last January 28, and did advise me that he will be posting the same to the arXiv "in the next couple of days". | |
| Feb 6, 2016 at 6:57 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
corrected the incorrect upper bound for $1/n$ from ${10}^{-500}$ to ${10}^{-375}$
|
| Feb 5, 2016 at 20:46 | answer | added | wythagoras | timeline score: 0 | |
| Feb 5, 2016 at 14:33 | comment | added | Sylvain JULIEN | Arnie, have you read this: arxiv.org/abs/1602.01591 ? | |
| Feb 4, 2016 at 21:00 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
added hyperlink to Ochem and Rao's paper in Math. Comp.
|
| Feb 4, 2016 at 20:24 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
removed reference to arXiv preprint of OP
|
| Feb 4, 2016 at 20:16 | history | edited | Jose Arnaldo Bebita |
added "divisors-multiples" tag
|
|
| Feb 4, 2016 at 20:14 | comment | added | Jose Arnaldo Bebita | The abundancy index of $n$, denoted by $I(n)$, is defined as the ratio $$I(n) = \frac{\sigma(n)}{n}.$$ | |
| Feb 4, 2016 at 20:13 | comment | added | Jose Arnaldo Bebita | The quasi-Euler prime of the lone spoof odd perfect number that we know of (i.e., $D = 198585576189$), is the factor $q_1 = 22021$ that has odd exponent and that makes $D$ "perfect", if we pretend that $q_1 = {{19}^2}\cdot{61}$ is "prime". | |
| Feb 4, 2016 at 20:09 | comment | added | Jose Arnaldo Bebita | @Seva, the Euler prime of an odd perfect number is the unique prime that occurs to an odd exponent (conjectured to be $1$ by Descartes, Frenicle, and most recently by Sorli). | |
| Feb 4, 2016 at 20:06 | comment | added | Seva | What is an "Euler prime"? What is a "quasi-Euler prime"? What is $I(n)$? | |
| Feb 4, 2016 at 18:00 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
added the detail: "with Euler prime $q$" in the **Question**
|
| Feb 4, 2016 at 17:40 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
fixed missing parentheses
|
| Feb 4, 2016 at 17:32 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
added further details
|
| Feb 4, 2016 at 17:13 | history | edited | Jose Arnaldo Bebita | CC BY-SA 3.0 |
improved the upper bound for $\sigma(q)/q = 1 + (1/q) < 1 + (1/n)$ from $6/5$ to $1 + {10}^{-500}$
|
| Feb 4, 2016 at 14:02 | history | asked | Jose Arnaldo Bebita | CC BY-SA 3.0 |