« first day (3608 days earlier)      last day (60 days later) » 

12:35 AM
[ SmokeDetector | MS ] Repeating characters in body (65): Proving a Supremum of a Set ✏️ by MagneticSphinx on math.SE
1:21 AM
4 hours later…
5:30 AM
Q: Is it possible to improve on these bounds for $\frac{\varphi(n)}{n}$, if $q^k n^2$ is an odd perfect number with special prime $q$?

Jose Arnaldo Bebita DrisLet $N = q^k n^2$ be an odd perfect number with special/Eulerian prime $q$ satisfying $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n)=1$. Denote the Euler-totient function of the positive integer $x$ by $\varphi(x)$, and the classical sum of divisors of $x$ by $\sigma(x)=\sigma_1(x)$. MOTIVATION Fr...

3 hours later…
8:20 AM
I had closed math.stackexchange.com/q/4317706/42969 as a duplicate of math.stackexchange.com/q/1853800/42969 because they look like the identical question to me. Now the question has been reopened by the votes of five people. Was my assessment wrong? Any opinions?
8:58 AM
@MartinR I find it difficult to believe, but I wrote (what I hope is) a more ambivalent comment there asking for some reasons.
1 hour later…
10:22 AM
@MartinR looks to be a clear duplicate to me, and now I’ve flagged it as such.
2 hours later…
12:24 PM
@TeresaLisbon @TheAmplitwist: Thanks for your assistance and feedback. The question is now closed as a duplicate again. I have suggested (in a moderator flag) to merge it into the older thread.
2 hours later…
2:14 PM
Hello, @Paramanand!
2:40 PM
@Peter One more close vote needed; I'll check back in a little while to see when it's open for deletion (upon its closure). Later yesterday, I posted this delete request, which needs one more delete vote. If you haven't yet looked at it, consider voting to delete.
@amWhy gone
@Peter Thanks! :-)
My CD is gone as well.
3:00 PM
@Peter I was the first close vote, in review, later yesterday. But it needs to go!
1 hour later…
4:07 PM
D1, D2, D3, D4
D5, D6, D7, D8
Only after deleting D1 can we delete this D11
4:43 PM
2 hours later…
6:25 PM
I don't know what to say to this question. Not sure if it's truly off-topic since it is still related.
2 hours later…
8:35 PM
Q: My attempt at proving the undecidability of the Collatz Conjecture

FraxThis is my attempt at the Collatz Conjecture! Not so bold to say it's correct, I just would like to know where the error is, thanks! The Collatz Conjecture states that whatever $n \in \mathbb{N}$ follows this algorithm: ${\displaystyle f(n)={\begin{cases}{\frac {n}{2}},&{\text{if }}n{\text{ even}...

8:54 PM
D1, D2, D3.
D4, D5, D6.
D7, D8, D9.
2 hours later…
11:08 PM
^^^I understand that three frequent users here cannot vote to delete again, after having deleted the post I just linked, which was undeleted by two answerers and the asker. The question also now has three reopen votes. I am not wanting to tell anyone how to respond. I'm just hoping users will see the questions and answers for what they are.
@MathematicsStudent1122 Hello! Welcome.
11:30 PM
1 message moved to ­Trash
1 message moved to ­Trash
11:43 PM

« first day (3608 days earlier)      last day (60 days later) »