Ignore math symbols (want underscore in regular text) I want to include the following expression without any changes in my LaTeX document:   RES_0.5_SE_5   If I just type like that, LaTeX wants it to be math mode because of the underscores. If I use   \verb|RES_0.5_SE_5|   the text has a different font.  Is there a command to just use ignore math symbols?  Thanks!
Underscores in words (text) How can I produce the text Word_one_two in LaTeX?  I tried:  Samp\_Dist\_Corr   But, it doesn't quite look right. Also, I want it in the typewriter font, so actually, I'm doing:  \texttt{Samp\_Dist\_Corr}   I find it looks a bit like the underscore is merging in to the bottom of the "D", but maybe it's just because of the typewriter D?
Covariance of a variable and a linear combination of other variables Let $X,A,B,C,D$ be time-series variables and the covariance between any two pairs of these are known.  Suppose we want to find $\textrm{cov}(X,aA + bB + cC + dD)$, where $a,b,c,d$ are constants.  Is there any way of doing this without expanding out $E[(X-E[X])(aA+......)]$? How can I make it so that each space has its own isolated dock?  Basically what I'm looking for is:   The dock in one space should not show the icon of an app that was open in another space. If I have the same program open in two different spaces, clicking on the icon in one space should not go to the app in the other space.   Is this possible natively, or with a third party program? Showing group with $p^2$ elements is Abelian I have a group $G$ with $p^2$ elements, where $p$ is a prime number. Some (potentially) useful preliminary information I have is that there are exactly $p+1$ subgroups with $p$ elements, and with that I was able to show $G$ has a normal subgroup $N$ with $p$ elements.   My problem is showing that $G$ is abelian, and I would be glad if someone could show me how.   I had two potential approaches in mind and I would prefer if one of these were used (especially the second one).   First: The center $Z(G)$ is a normal subgroup of $G$ so by Langrange's theorem, if $Z(G)$ has anything other than the identity, it's size is either $p$ or $p^2$. If $p^2$ then $Z(G)=G$ and we are done. If $Z(G)=p$ then the quotient group of $G$ factored out by $Z(G)$ has $p$ elements, so it is cylic and I can prove from there that this implies $G$ is abelian. So can we show theres something other than the identity in the center of $G$?  Second: I list out the elements of some other subgroup $H$ with $p$ elements such that the intersection of $H$ and $N$ is only the identity (if any more, due to prime order the intersected elements would generate the entire subgroups). Let $N$ be generated by $a$ and $H$ be generated by $b$. We can show $NK= G$, i.e every element in G can be wrriten like $a^k b^l $. So for this method, we just need to show $ab=ba$ (remember, these are not general elements in the set, but the generators of $N$ and $H$).   Do any of these methods seem viable? I understand one can give very strong theorems using Sylow theorems and related facts, but I am looking for an elementary solution (no Sylow theorems, facts about p-groups, centrailzers) but definitions of centres and normalizers is fine. Customize feed on stack exchange android app robots meta not blocking indexing We have a staging version of our website to test changes on at trailheadpaddleshack.ca/staging1. This never appeared in search before. Recently the staging site has appeared on Google and is affecting our search results.  I'm trying to figure out how the pages got there and how to remove them. The pages have always had &lt;meta name="robots" content="noindex, nofollow"&gt; in the head.  I am kinda new at this but was under the impression this should prevent Google from showing my site in results. I am pretty sure the results appeared in google after I accidently copy pasted some codes from the staging site to the live site that contained links to pages on the staging site. If anyone can point me in the right direction to figure out what happened and prevent it from happening again would be much appreciated.  robots.txt looks like this:  User-agent: * Disallow: /calendar-2/action~posterboard/ Disallow: /calendar-2/action~agenda/ Disallow: /calendar-2/action~oneday/ Disallow: /calendar-2/action~month/ Disallow: /calendar-2/action~week/ Disallow: /calendar-2/action~stream/ #Begin Attracta SEO Tools Sitemap. Do not remove sitemap: http://cdn.attracta.com/sitemap/4035112.xml.gz #End Attracta SEO Tools Sitemap. Do not remove   I also tried adding an X-Robots-Tag header and submited the site to be re-crawled. Did that a few days ago and I still see no changes. Here are the HTTP headers according to "Fetch as Google":  HTTP/1.1 200 OK X-Robots-Tag: noindex,nofollow Vary: Accept-Encoding Transfer-Encoding: chunked Date: Sun, 24 May 2015 16:26:49 GMT Server: LiteSpeed Connection: close X-Pingback: http://trailheadpaddleshack.ca/staging1/xmlrpc.php Content-Type: text/html; charset=UTF-8 Link: &lt;http://trailheadpaddleshack.ca/staging1/?p=170&gt;; rel=shortlink   I am now faced with a bunch of results I need to remove from Google asap as they contain out of date information and are affecting our search results. Webmaster Tools has something for removal of a single URL but I am looking to remove the entire /staging1/ subfolder. Any tips? What is a suitable word to describe a place where two rivers meet? I've googled for a while and on some sites I've found the word "watershed" as the proposed word. Is it the word that best suits it? Best methods to fix broken tracks I've made a couple of PCBs which need the odd few 10 mil tracks, but are mostly 20/30 mil. Unfortunately the etching process isn't fantastic and there are numerous breaks in the traces, most of them small.  I've managed to convince solder lumps to go over the top of the smaller gaps, and have used components legs to bridge some of the larger ones. The solder lumps don't feel particularly reliable though, and there are some gaps which are too small and awkward to get a piece of wire across but too big to be bridged with just the iron.  Are there any standard ways to reliably fix up broken traces?  Update: Thanks for the suggestions everyone!  I found and tried out a silver conductive pen. As a first time user I found it difficult to dispense, and obviously I didn't use enough of it or mix it properly because it didn't even end up being conductive.  It seems like the main problem was that I was trying to use pieces of wire which are too short. I found some small gauge tinned wire and used longer lengths, running it over significant lengths of good track on either side of the fault. That makes it much easier to position, and you can tack them down one end at a time. Can virtual particles be thought of as off-shell Fourier components of a field? I just found  blog post, which gives an interpretation of virtual particles I haven't seen before.  Consider a 1D system of springs and masses, where the springs are slightly nonlinear. A "real particle" is a regular $\cos(kx-\omega t)$ wavepacket moving through the line, where $\omega$ satisfies the dispersion relation $\omega = \omega(k)$. When two real particles collide, the region where they collide temporarily looks really weird, as they interact nonlinearly, pulling and pushing on each other.  Formally, we can write this weird region as the sum of a bunch of $\cos(kx-\omega t)$ waves, but there's no guarantee they'll have the right dispersion relation. Thus, each term in the resulting expansion is a off-shell "virtual particle". If you add up all the virtual particles, you get the actual intermediate field state, which is just a weird ripple in the field where the two particles are interacting.  As another example, consider the statement "a static EM field is made of virtual particles". Under this interpretation, what that really means is, "a static field (e.g. $1/r^2$) is not equal to $\cos(kx-\omega t)$, but may be expanded in terms of such sinusoids", which is much less mysterious sounding. In fact, this is exactly what we do when we consider scattering off a potential in normal QM, e.g. in the Born approximation.  The above gives some intuition for what a 'virtual particle' means in classical field theory. They are the Fourier components of the field with $(\omega, k)$ not satisfying the dispersion relation, and they are useful in classical perturbation theory. However, they are not propagating degrees of freedom, so they only appear during interactions.   The picture above is entirely classical. Does this picture generalize to quantum field theory, giving a physical intuition for virtual particles there? What are the ways to position things absolutely on the page? I know that there is tikz, but also eso-pic and textpos.  I'd like to see a list of possible ways (not necessarily packages) for absolute positioning of things (which I believe amounts to "boxes") on the page, together with their advantages and disadvantages (for instance: tikz's current page node is very easy to use, but usually requires two LaTeX runs, and overhead from loading tikz if you don't need it for any other things is considerable).  Both LaTeX and ConTeXt solutions are welcome How to use a file in a jar as javax.net.ssl.keystore? I'm trying to do something like   URL clientks = com.messaging.SubscriptionManager.class.getResource( "client.ks" ); String path = clientks.toURI().getPath(); System.setProperty( "javax.net.ssl.keyStore", path);   Where client.ks is a file stored in com/messaging in the jar file that I'm running.  The thing that reads the javax.net.ssl.keyStore is expecting a path to the client.ks file which is in the jar. I'd rather not extract the file and put in on the client's machine if possible. So is it possible to reference a file in a jar?  This doesn't work as getPath() returns null. Is there another way to do this? How do I append an object (such as a string or number) to an array in JavaScript? "Reflexive only" verbs English can use a lot of verbs in a reflexive context. Even ones that usually are used intransitively.     I laugh myself silly.   However, it seems like there are very few – perhaps no – verbs that ONLY work in a reflexive context.  Are there any? Every time I try to create a table using MySQL Workbench 6.3 CE it adds "broken" comments at the end of the script.  Example:  I am trying to create a table called "user". This is what the table should look like:   However when I click the apply button, the script generates incorrectly:  CREATE TABLE `user` (   `userid` INT NOT NULL AUTO_INCREMENT COMMENT '',   `record_status` INT NOT NULL DEFAULT 1 COMMENT '',   `createdby` VARCHAR(75) NOT NULL COMMENT '',   `createddate` DATETIME NOT NULL COMMENT '',   `updatedby` VARCHAR(75) NULL COMMENT '',   `updateddate` DATETIME NULL COMMENT '',   `username` INT NOT NULL COMMENT '',   `password` VARCHAR(75) NULL COMMENT '',   `firstname` VARCHAR(75) NULL COMMENT '',   `lastname` VARCHAR(75) NULL COMMENT '',   `email` VARCHAR(75) NULL COMMENT '',   `facebook_userid` VARCHAR(75) NULL COMMENT '',   `email_verified` VARCHAR(75) NULL COMMENT '',   PRIMARY KEY (`userid`, `username`)  COMMENT '');   The comment in this line should not be there, so the code should be:   PRIMARY KEY (`userid`, `username`));   and the code executes when I paste it into an editor and remove this comment. However I create massive databases daily. (Each with +- 15 tables). I can't keep doing this for each table as it is time consuming.  How can I disable this feature that adds the comments to the script? I don't need them in my databases I would like to see the icons in the 'Hot Network Questions' right panel clickable, leading to the homepage of the site where the question comes from.  It would make it more comfortable to switch to the site when you want rather to visit it than to see that specific "hot" question. Is "The empty set is a subset of any set" a convention? Recently I learned that for any set A, we have $\varnothing\subset A$.  I found some explanation of why it holds.     $\varnothing\subset A$ means "for every object $x$, if $x$ belongs to the empty set, then $x$ also belongs to the set A". This is a vacuous truth, because the antecedent ($x$ belongs to the empty set) could never be true, so the conclusion always holds ($x$ also belongs to the set A). So $\varnothing\subset A$ holds.   What confused me was that, the following expression was also a vacuous truth.     For every object  $x$, if $x$ belongs to the empty set, then $x$ doesn't belong to the set A.   According to the definition of the vacuous truth, the conclusion ($x$ doesn't belong to the set A) holds, so $\varnothing\not\subset A$ would be true, too.  Which one is correct? Or is it just a convention to let $\varnothing\subset A$? I recently updated my profile bio (from Arqade) and clicked 'Save and copy changes to all public communities'. This appears to have broken/reset my profile picture on all but Arqade. Note that I did not update my profile picture as part of my changes. Arqade:  Meta SE for comparison:  I haven't touched my profile picture in years. Is this a bug?  Update: It appears my profile pic across all communities has been set back to 'Identicon'. I went on to Stack Overflow and changed my profile picture back to 'Gravitar' and clicked 'Save and copy to all communities' again, but this did not update my profile picture anywhere but SO. (I did the same on Sustainability to be doubly sure). Update 2: This is a persistent bug - I had changed most of my SE communities back to my 'Robotnik' display pic over the past little while. Today I edited my profile again on Arqade, Clicked 'Save and copy' - and the display pic reverted back to identicon again across all sites. Update 3: I have re-uploaded my profile picture and the 'Save and copy' function worked. It appears that this is actually a bug to do with the old images from Gravatar. Prove by induction that for all $n \geq 3$: $n^{n+1} > (n+1)^n$ I am currently helping a friend of mine with his preperations for his next exam. A big topic of the exam will be induction, thus I told him he should practice this a lot. As at the beginning he had no idea how induction worked, I showed him some typical examples.  Now he showed me an exercise he was having trouble with, which states that one should prove $$n^{n+1} &gt; (n+1)^n$$  for all $n \geq 3$. I have to admit that I too have trouble showing this inequality, as in all of my attempts, my lower bound is too low. Also, I have not yet figured out, how one gets the $(n+2)^{n+1}$, primarely the number $2$ is a problem. I think this might be solved using the binomial theorem, however, I don't think they have already seen the binomial theorem in school.  Is there an easy method to show this inequality by induction not using the binomial theorem? If no: How can one show it using the binomial theorem?  Thanks for answers in advance. Get the generated SQL statement from a SqlCommand object? I have the following code:  Using cmd As SqlCommand = Connection.CreateCommand     cmd.CommandText = "UPDATE someTable SET Value = @Value"     cmd.CommandText &amp;= " WHERE Id = @Id"     cmd.Parameters.AddWithValue("@Id", 1234)     cmd.Parameters.AddWithValue("@Value", "myValue")     cmd.ExecuteNonQuery End Using   I wonder if there is any way to get the final SQL statment as a String, which should look like this:  UPDATE someTable SET Value = "myValue" WHERE Id = 1234   If anyone wonders why I would do this:   for logging (failed) statements for having the possibility to copy &amp; paste it to the Enterprise Manager for testing purposes Securely erasing all data from a hard drive How do I remove extra Skype icon or ghost icons for removed apps from GNOME shell?