Turn off shift right click to change workspaces
How do I disable the alt-right click keyboard binding?
Often when I edit one of my answers, it's because I want to better address the original question. The only problem is that I can't see the original question while I'm editing my answer!  I'd love to see the original question text beneath the "answer edit" form. This way I could scroll down slightly to read it if I wanted to, or just ignore it if not.  Current workaround is to click the 'return to answer' link and hope that you remember to launch it in a new tab/window, then tab back and forth.    Imported from this uservoice item: Best method for short time-series Is the tag info page not available on mobile theme? I was surfing SO on my iPhone, and wanted to see the info (tag-wiki) page for a tag, but didn't find it. Clicking on the tag always leads to the list of question, and there is no other link to the tag wiki. Is it not available on the mobile site? every planar graph can be expressed as a union of five edge-disjoint forests How can I prove that every planar graph can be expressed as a union of (maximum) five edge-disjoint forests?  Only thing I can think about is going somehow like the $5$ color theorem but I get stuck in the middle. Or with induction, but still something doesn't fit. Can you help? Data recovery from an accidental format on ext4 partition When I was installing Mint Debian edition unlike the classic edition, the installation automatically formated my home partition when I did not specify to format.  So the formatting previously was ext4 as is now. I believe the data is still there as it was a quick format.   I have now booted the computer up on a live USB to prevent writing on it.  Ran testDisk. Is there anyway to recover to a previous superblock so i can recover my data? Prove $\mathbb{Z}_2 \times \mathbb{Z}_2$ is not isomorphic to $\mathbb{Z}_4$ In trying to understand why there are two sets of groups of order 4.  I know that there exists the Vierergruppe of $\mathbb{Z}_2 \times \mathbb{Z}_2$ and the group $\mathbb{Z}_4$ but I do not understand why they are not isomorphic 'Good' review audits can be misleading How many integer solutions does $xy+9(x+y)=2006$ have? Here $x$ and $y$ are both integers.  My trying:        I have tried to solve this problem. But I have no idea to solve this. Please help Prove that $\mathcal{P}(A)⊆ \mathcal{P}(B)$ if and only if $A⊆B$. Here is my proof, I would appreciate it if someone could critique it for me:  To prove this statement true, we must proof that the two conditional statements ("If $\mathcal{P}(A)⊆ \mathcal{P}(B)$, then $A⊆B$," and, If $A⊆B$, then $\mathcal{P}(A)⊆ \mathcal{P}(B)$) are true.    Contrapositive of the first statement: If $A \nsubseteq B$, then $\mathcal{P}(A) \nsubseteq \mathcal{P}(B)$  If $A \nsubseteq B$, then there must be some element in $A$, call it $x$, that is not in $B$: $x \in A$, and $x \notin B$. Since $x \in A$, then $\{x\} \in \mathcal{P}(A)$; moreover, since $x \notin B$, then $\{x\} \notin \mathcal{P}(B)$, which proves that, if $A \nsubseteq B$, then $\mathcal{P}(A) \nsubseteq \mathcal{P}(B)$. By proving the contrapositive true, the original proposition must be true.    To prove the second statement true, I would implement nearly the same argument, so that isn't necessary to write. So, does this proof seem correct? Also, was the contrapositive necessary? Or is there another way to prove the initial statement? How to use AT commands in Android by 'root' the phone We have various Android devices from Spike, Samsung, Micromax, etc. How can we issue AT commands from Android to the modem? We searched in Google Play but did not find any app related to this.   suggests:     [F]irst you have to root the phone...`    How can we do this? Numerical integration of divergent function I am having trouble with the numerical integration of a divergent function. For example, \begin{equation} n= \int f(x)\,dx = \displaystyle\int \dfrac{\Theta(x-\varepsilon)\,dx}{\sqrt{x-\varepsilon}} \end{equation} is not behaving good when calculated numerically: \begin{equation} n_\text{numerical} \approx f(x_j)(x_j-\varepsilon) + \sum_{k=j+1}^N f(x_k)\Delta x \end{equation} with \begin{equation} x_i = x_\text{min} + i\Delta x \end{equation} and $x_j$ being the smallest point larger than $\varepsilon$. Due to the divergent behavior of $f(x)$ near $\varepsilon$, the numerical result has discontinuities and jumps at every $\varepsilon=x_i$ when I sweep $\varepsilon$. The smoothness of this integration is crucial in the convergence of my simulations. Can anybody suggest a simple trick to solve the problem? All I need is to have a continuous numerical result by continuously changing $\varepsilon$. Why is Leia okay with being tracked to Yavin? In A New Hope, after Han and Luke fight off the TIE Fighters while escaping from the Death Star, these exchanges happen:             INT. DEATH STAR - CONTROL ROOM             Darth Vader strides into the control room, where Tarkin is             watching the huge view screen. A sea of stars is before him.                                   TARKIN                      Are they away?                                   VADER                      They have just made the jump into                       hyperspace.                                   TARKIN                      You're sure the homing beacon is                       secure aboard their ship? I'm taking                       an awful risk, Vader. This had better                       work.             INT. MILLENNIUM FALCON - COCKPIT             Han, removes his gloves and smiling, is at the controls of             the ship. Chewie moves into the aft section to check the             damage. Leia is seated near Han.                                   HAN                      Not a bad bit of rescuing, huh? You                       know, sometimes I even amaze myself.                                   LEIA                      That doesn't sound too hard. Besides,                       they let us go. It's the only                       explanation for the ease of our                       escape.                                   HAN                      Easy... you call that easy?                                   LEIA                      They're tracking us!                                   HAN                      Not this ship, sister.             Frustrated, Leia shakes her head.                                   LEIA                      At least the information in Artoo is                       still intact.                                   HAN                      What's so important? What's he                       carrying?                                   LEIA                      The technical readouts of that battle                       station. I only hope that when the                       data is analyzed, a weakness can be                       found. It's not over yet!   Leia doesn't even know if there is a weakness, let alone whether they'll find one. If she (correctly) realizes that they're being tracked, why doesn't she suggest that the Millennium Falcon go somewhere besides Yavin 4 instead of just frustratedly shaking her head? I know the plans , but it seems unlikely that continuing to fly to the secret Rebel base in the ship she's certain is being tracked is the only option. They are already in hyperspace when this conversation happens, but they apparently have time to talk for a little while after, so presumably they'd have time to stop and reroute. Prove that $\sum_{k=0}^{m}\frac{\binom{m}{k}}{\binom{n}{k}}=\frac{n+1}{n+1-m}$ Prove that $\sum_{k=0}^{m}\dfrac{\binom{m}{k}}{\binom{n}{k}}=\dfrac{n+1}{n+1-m}$.  We know, n > m. From the right side. we have $\dfrac{n+1}{n+1-m}=\dfrac{1}{1-\dfrac{m}{n+1}}$. since n > m. $0&lt;\dfrac{m}{n+1}&lt;1$. Then $\dfrac{1}{1-\dfrac{m}{n+1}}=1+\dfrac{m}{n+1}+(\dfrac{m}{n+1})^2+...$ I don't know what to do next? Did I choose the right path? I have a random sample of Bernoulli random variables $X_1 ... X_N$, where $X_i$ are i.i.d. r.v. and $P(X_i = 1) = p$, and $p$ is an unknown parameter.  Obviously, one can find an estimate for $p$: $\hat{p}:=(X_1+\dots+X_N)/N$.  My question is how can I build a confidence interval for $p$? I have a box that I have extruded to the shape I want. Then I placed a cylinder so that it intersects the box. After that I deleted the bottom faces of both the cylinder and box.  Now what I want to do is delete the portion of the cylinder that is inside the box and join the nodes so that it is one object. I have already joined the meshes so I can select points/edges/faces from either shape. It seems like the easiest way would be to just put nodes where the edges of the cylinder and box intersect and then delete the parts I don't care about. I can't find a good way to do that though.  What's the best way to accomplish what I'm trying to do? if 2 random variables have exactly same mean and variance If two continuous random variables have exactly the same expected value and variance, do they always have the same distribution? English (other than American English) has a clear differentiation between the two words. Both are about translocating something. In "bring" the something of somebody is moved to where the speaker is currently situated. "Take" is used to translocate something or somebody to a place that the speaker is not currently at.   You cannot “bring” your books to school if you are currently at home. You can only take them to school. Most of the time one can get the meaning from the context of the sentence but it can get very confusing when the other party is on the telephone and you do not know their location.   Why does American English not differentiate and when did it lose the differentiation? The essential gist of my question relates to what the real, unvarnished realities are of graduate, post-graduate, research, fellowship, and professorship attainment - when you aren't a single person with no pressing demands other than feeding yourself.   [EDIT: I am humbled by the incredibly helpful and thoughtful responses so far, all of which are +1 from me. I'll leave the question open a few more days before clicking 'accept' on any one, but you all have my gratitude and I hope others will benefit anywhere near as much as I have. ]  What I don't know is what succeeding in this path truly requires in time committment and family support.   Right now I can handle a 12-14 credit course schedule with 3.7-4.0 GPA (in the top 5-10% for college and program, dean's list, etc), work part-time, and still have time to be home and not have a burn-out/breakdown - and the academics are the easy part by far! I could do more, but I need to work more too.   What I really need to know is how sharply different is the time/dedication curve of graduate work and above. I realize each step is a filter that removes most of the entrants (most people don't get a degree, most who do don't attend/finish graduate school, most who do don't seek a PhD,  most who do don't seek/gain professorship...and on and on). But I don't know how severe the stepping is - I'm not talking "tenured professor at MIT or bust" - I realize that bar is many orders of magnitude higher.  Background Details: As an "adult, returning" undergraduate student with a (disabled) wife and kids, I'm halfway through a bachelor degree now. I've located a field of study (in a focus of Industrial Engineering) that has made me very interested in altering my life path to include seeking a Masters and maybe even a PhD/professorship (my father was a professor, so its not a purely novel concept to me). I've met and spoken with my advisor and 2 other professors with experience in related fields, and all is encouraging; I have a graduate school in mind, I've received lots of great advice on preparing for school (on this forum and in person), I test well (no GRE fears remain), good grades/class rank, good prospects for future strong referal letters, etc - a comparitively charmed existence for which I am very grateful! I just have to investigate whether I can make it through with an intact, cared for family!  Any guidance you could provide me, and other aspiring "non-traditional" students alike, would be appreciated immensely - thank you! Best way to run scheduled tasks Today we have built a console application for running the scheduled tasks for our ASP.NET website. But I think this approach is a bit error prone and difficult to maintain. How do you execute your scheduled task (in an windows/IIS/ASP.NET environment)  Update:   Examples of tasks:   Sending email from an email-queue in the database Removing outdated objects from the database Retrieving stats from Google AdWords and fill a table in the database. Gave up waiting for root device on Ubuntu