I found a very damaging conversation from years ago in Facebook Messenger. I need the conversation to be deleted from THE OTHER PERSON's inbox. I've read that there's a workaround where if you report your own messages as spam, then deactivate your account for a few hours, it may delete the messages from their inbox. Has anyone tried this recently and know if it works? How fool proof is it? And would Facebook send that person a notification saying that something was reported? Follow up question: Are there any other avenues I can take if the above method doesn't work? I know that deactivating/deleting your account results in it displaying your name as &quot;Facebook User&quot; but that's also not tried and true. Some friends of mine who've deleted their Facebook still have their names displayed in our messaging history. And even still, the chat still remains. I really need the chat to be gone. Please advise!
How can I delete Facebook messages I've sent to other Facebook users from their inbox?  I have had a conversation with my friend but now I want to delete my messages from that conversation. Can I have them deleted from my friend's inbox?
I'm trying to solve hard combinatorics that involve complicated factorials with large values.  In a simple case such as $8Pr = 336$, find the value of $r$, it is easy to say it equals to this: $$\frac{8!}{(8-r)!} = 336.$$  Then $(8-r)! = 336$ and by inspection, clearly $8-r = 5$ and $r = 3$.  Now this is all and good and I know an inverse function to a factorial doesn't exist as there is for functions like sin, cos and tan etc. but how would you possibly solve an equation that involves very large values compared to the above problem without the tedious guess and checking for right values.  Edit: For e.g. if you wanted to calculate a problem like this (it's simple I know but a good starting out problem) Let's say 10 colored marbles are placed in a row, what is the minimum number of colors needed to guarantee at least $10000$ different patterns? WITHOUT GUESS AND CHECKING  Any method or explanation is appreciated! What does the red background on an item mean? With the latest update, you can now use gyms like stops and get items. So far, every time I have done so there has always been one item that has a red background and number.    Is this a bonus item since I am part of red team? Is there any special meaning to it at all? Intuitive explanation of entropy I have bumped many times into entropy, but it has never been clear for me why we use this formula:  If $X$ is random variable then its entropy is:  $$H(X) = -\displaystyle\sum_{x} p(x)\log p(x).$$  Why are we using this formula? Where did this formula come from? I'm looking for the intuition. Is it because this function just happens to have some good analytical and practical properties? Is it just because it works? Where did Shannon get this from? Did he sit under a tree and entropy fell to his head like the apple did for Newton? How do you interpret this quantity in the real physical world? proof detail concerning bijection between a set and its power set Theorem: If $X$ is a set, then $X$ is not equivalent to its power set.  Proof: suppose for a contradiction that $f:X\to P(X)$ is a bijection. Define $B:=\{x \in X, x\not\in f(x)\}$. Because $f$ is surjective (onto), there is a $b$ in $X$ with $B=f(b)$. Now $b$ in $B$ would imply $b$ in $B=f(b)$. By definition of $B$, this would mean that $b$ is not an element of $f(b)=B$. Thus we infer $b$ is not an element of $B$. But then $b$ is not an element of $B=f(b)$, which by definition of $B$ forces $b$ in $B$, a contradiction.  I understood this proof until he reached the part that says "Now $b$ in $B$ would imply $b$ in $B=f(b)$..."  This seems problematic to me because the assumption $b$ in $B$ seems unwarranted. Since $B$ is a subset of $X$ it makes sense if we had $b$ in $B$ and then arrived at $b$ in $X$ but the reverse does not seem like a valid step and I'm left wondering if the resulting contradiction that arised came simply from the assumption $b$ is in $B$ and therefore only means that $b$ is not not an element of $B$, And that this has no bearing on the bijection part of the argument. In fact I dont even see how this connects to the part of the argument that used the onto property of bijectiveness. I have 24 accounts, how can I delete them all in one go? Is there a way to delete all stack exchange accounts at the same time?  I also want to remove all traces of my posts on the site. Is that possible?   Will I have to delete all of my posts manually?  Can I use the stack exchange API for this? Travelling by bus What good are free groups? In , one learns two definitions of free groups associating with sets.        Let $A$ be a set, the free group of $A$, $F(A)$ is the initial object in the category $\mathcal{C}$, where \begin{equation} \operatorname{Obj}(\mathcal{C})=\{A\xrightarrow{g}G\}, \end{equation}where the codomain $G$ are groups, and \begin{equation} \operatorname{Hom}(\mathcal{C})=\{\text{Commutative Diagrams } A\xrightarrow{g_1}G_1\xrightarrow{\phi}G_2\xleftarrow{g_2}A\}  \end{equation} where $\phi$ are group homomorphisms.   Also $F(A)$ has the concrete construction with elements being non-redundant words with alphabet $A$, and the group multiplication being juxtaposition and reduction.      But what good are free groups? Why are they useful?  says they are useful in topology, but does not explain why explicity.   Can someone give some examples that an undergraduate can understand? I am asking about examples that can show the usefulness of this abstract construction. So I guess the identification of $\mathbb{Z}=F({a})$ does not really count. Let's say I have a script that will be executed on various machines with root privileges, but I want to execute certain commands within that script without root.   Is that possible? It appears that in anticipation of D&amp;D Next Wizards of the Coast has removed much of the Dungeons and Dragons, 3rd Edition Web content. I didn't perform a thorough search to determine if all the content is removed (e.g. I know the Three Dragon Ante Web enhancement  and the Mind's Eye column about psionic tattoos  are both gone--better not to ask why those are my go-to articles), but it all might be.  What's the best way--and by best I mean both legal and convenient--to continue to access this content? I was thinking about this issue from time to time but I didn't know whether it really exists or just an speculation on my side until today when I woke up [!], I saw  downvoted (in the meantime I'll leave that answer unedited for the sake of discussion; note that this is just a sample. I'm not asking "how to deal with this specific answer." The question is completely general as it's nearly impossible to keep track of all of your answers to see whether they require updating or not). While the downvoter didn't explain a thing, I suspect the reason is that the answer is no longer applicable (It's one of the new features in iPhone OS 3.0). As we go to celebrate a long sequence of birthdays for Stack Overflow (hopefully!), we're going to see lots of answers become obsolete. How we're going to deal with this issue? How was Loki not crushed by Mjolnir? In the Thor movie, Thor puts Mjolnir  on top of Loki at the end of the movie to stop him from moving.  Why did this not crush Loki?  And if it did not crush him, why could he not just roll out from under it? Is there a way to stop the gmail address field (on the login page) from displaying all the gmail addresses that you have ever typed in it?   When logging in with Google Chrome or trying to set up a new account, anything you type which starts with the same letter as the one that you are trying to use currently will show up in the auto-complete field, I don't want that.    I understand that this is a convenient feature in some cases, but the thing is--I know this shouldn't've happened, but it has actually happened more than once--I sometimes mistyped my password in the Gmail address field right after the address, mistakingly assuming that the prompt had already been moved to the password field, and then hit "Enter" without looking first. The next time I tried to enter my Gmail address, it popped up the address followed by my password as one of the entries on the list of email addresses that shows up, and I couldn't get rid of the entry.   Is there a way to remove these? The autofill feature in Chrome is a time saver, and so I don't really want to turn it off. It would be helpful to be able to edit out some of the typed info, though, so it won't show up again -- is this possible to do? How do I escape a percentage sign in T-SQL? Malus Law in Michelson Morley experiment My book of physics (I don't quote it here, since it is in Catalan) says  that in the 1887 Michelson - Morley experiment, after getting the transversal and longitudinal phase shifts, they claim that the number of fringer observed will belong to the number of times that both phase shifts contains 2 pi because that is the phase two maximums  repeat. My question is: why is here said that waves should form maximums? Because as I understand it, the expected result was to obtain a destructive interference whose phase shift could be jsed to determine Earth's velocity. If they were expecting a destructive interference, shouldn't the book use the phase two minimums repeat? Is it lenses which make your photographs, not camera bodies? In Peter Jackson's film The Fellowship of the Ring, when the Council of Elrond takes place it shows a total of 22 members:    We all know the names of the ones who were part of the Fellowship, but I want to know who are the rest of the people in the council. Who are the elves that came with Legolas? The men next to the dwarves? The three old men sitting next to Boromir? Or the two elves next to Aragorn?  Starting from left to right:   Frodo Gandalf Elf Elf Legolas Elf Old Man Old Man Dwalin Gloin Gimli Nori Old Man Boromir Old Man Old Man Elf Elf Aragorn Elladan Elrond Elrohir Create a .desktop file that opens and execute a command in a terminal Was it just coincidence that Tahir Mahmood went on stage? Let n be an even integer. How many different ways can I choose subsets of the set {1,2...,n} Let n be an even integer. How many different ways can I choose subsets of the set {1,2...,n} if they all have to have odd size, but the intersection of any two of them has to have even size?  Please help me answer this question or lead me in the right direction. Thank you :) Trying to identify pre-1970s short story involving multiple humans absorbed into an alien blob