« first day (4711 days earlier)      last day (81 days later) » 

Arctic Char
Arctic Char
02:45
C
@MikeEarnest I saw that you closed and later reopened that post. Is there a problem with the duplicate target you chose? Do you still request to close it as duplicate with that duplicate target?
Joako
Joako
Hi @XanderHenderson, How are you?... I am here to see if you could rescue this question I did: it got migrated to CrossValidated, then got migrated back and deleted by a bot, even when has 4 upvotes. I still working on it and I would like to share it asking for some reviews but deleted as it is now not everybody can see it.
 
2 hours later…
Mike Earnest
Mike Earnest
05:16
@ArcticChar So, another user had flagged it as a duplicate, but he chose the wrong question as a dupe. I dupe-hammered it, but then it bothered me that the close message said that the question was a dupe of two questions, where one of the questions listed was not actually a dupe. So I reopened, hoping to immediately reclose, only to learn that you cannot vote to reclose. It was a dumb decision on my part, because it didn’t really matter, and now it will be hard to close.
 
7 hours later…
Xander Henderson
Xander Henderson
12:00
@Joako as I am not a moderator on stats, I cannot see the question.
 
2 hours later…
SmokeDetector
SmokeDetector
13:40
[ SmokeDetector | MS ] Mostly non-latin body (80): a) Assuming that all matrices are 𝒏 × 𝒏 and invertible, solve for 𝑫 ✏️‭ by Shaza Afana‭ on math.SE
Sine of the Time
Sine of the Time
14:18
delete ?
 
5 hours later…
KReiser
KReiser
18:48
@MikeEarnest I'm not sure if this will be helpful, but as a gold badge holder, you can edit the duplicate list - I've used this in the past where I closed as a duplicate of the wrong question and needed to fix it instead of reopening and reclosing.
Adding the better duplicate and then removing the worse one should do what I think you were trying to do.
Mike Earnest
Mike Earnest
19:09
@KReiser That is helpful. I will keep that in mind, so this does not happen next time.
 
2 hours later…
Feeds
Feeds
20:57
-1
Q: Collatz counterproof using modular arithmetic?

Dr Analiese Mason-Jude MDLet's investigate whether the sequence ( [2^{(2^{23} - 1)}] \mod 17 ) eventually reaches 1. Step 1: Simplify the problem We are looking at the expression ( [2^{(2^{23} - 1)}] \mod 17 ). This involves computing the result of raising 2 to a large exponent, then taking that value modulo 17. First, ...

collatz-conjecture
amWhy
amWhy
21:47
Please consider deleting
 
2 hours later…
Joako
Joako
23:36
@XanderHenderson Hi @XanderHenderson. I have asked in CrossValidated Meta here and the do undelete my question, by there are menaces it will be deleted agaim soon: Do you believe there is any chances to migrated to MSE in order to keep it undeleted? I think the demonstrations done are at least are right.
Xander Henderson
Xander Henderson
23:57
It had turned into a monograph, of a length unsuitable for any SE site. A site moderator has kindly undeleted it for your convenience, but expect it to get deleted again soon. — whuber ♦ 1 hour ago

« first day (4711 days earlier)      last day (81 days later) »