Append subscript to variable name
How to replace subscript symbols
Parse and Extract Attributes from JSON How to put Json inside asynctask - Android Dynamically reformatting man pages on terminal dimension changes One common workflow of mine is to open a manual page in a terminal, then another terminal in which to test things. The man page is formatted to the initial dimensions of the first terminal. When I now resize my windows (or have my WM do that for me automatically), there is either a gap to the right of the preformatted page, or lines wrap. At this point I usually q(uit) and !! (run again), which loses my position in the page.  I assume the formatting process is quite CPU intensive, or maybe it stems from ancient times of fixed terminal sizes. The less pager dynamically reacts to terminal resize events, so it should be possible in theory.  I tried perusing man pages, searching the Web, asking on IRC -- the whole lot -- but couldn't come up with anything.   Can I trigger reformatting from within or outside of the man utility? Is there a version of the man utility that resizes the page dynamically?  Is there way to customize some part of the formatting/display process to make it update on SIGWINCH? I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}? Usually I don't mind about LaTeX's compilation speed, because a paper of less than 20 pages is compiled rather fast.  However, I am working on a large document - A report with more than 80 pages.  Compilation times are starting to slow me down.  I saw the couple of answers here on this topic, but most of my graphics are external and I don't use Tikz.  As a matter of fact, I'm not sure what's slowing the compilation down, other than the amount of text and required layout.   What's your best speeding-tex-up trick, other than externalizing graphics and pre-compiling the preamble? How can I know what's slowing TeX down? Should a "thank you" comment, for instance Thanks for your answer, be flagged as non-constructive?  If a "thank you" comment is flagged as non-constructive what would the moderator reaction to this flag be? Would it be marked as helpful, or not? Is there a way to opt out of Alexa rankings or prevent them from gathering data about my site? My competitor is using Alexa to see what I am doing. I need to get stop Alexa from including my sites in their rankings. How can I do so?   Is it possible to deny access to any visitor with the Alexa toolbar and deny access to Alexa bot requests? Meaning of $\int\mathop{}\!\mathrm{d}^4x$ What the following formula mean?  $$\int\mathop{}\!\mathrm{d}^4x$$  I know that this $\int f(x)\mathop{}\!\mathrm{d}x$ is the integral of the function $f$ over the $x$ variable, but the following $\int\mathop{}\!\mathrm{d}^4x$ leave empty the argument and also have the $\mathrm{d}$ elevated to the fourth power. What that mean?  Update.  In the Einstein-Hilbert action we have (note that I have understand that the other parts of the integral are relevant only after your answers, thus sorry.):  $$S=\frac{c^4}{16\pi G}\int\mathop{}\!\mathrm{d}^4x \, \ R \sqrt{-g}$$ I'm trying to find the longest consecutive set of composite numbers Hello and I'm quite new to Math SE.  I am trying to find the largest consecutive sequence of composite numbers. The largest I know is:  $$90, 91, 92, 93, 94, 95, 96$$  I can't make this series any longer because $97$ is prime unfortunately.  I can however, see a certain relation, if suppose we take the numbers like (let $a_1, a_2, a_3,...,a_n$denote digits and not multiplication):  $$a_1a_2a_3...a_n1,\ a_1a_2a_3...a_n2,\ a_1a_2a_3...a_n3,\ a_1a_2a_3...a_n4,\ a_1a_2a_3...a_n5,\ a_1a_2a_3...a_n6,\ a_1a_2a_3...a_n7,\ a_1a_2a_3...a_n8,\ a_1a_2a_3...a_n9,\ a_1a_2a_3...(a_n+1)0$$  The entire list of consecutive natural numbers I showed above can be made composite if:   The number formed by digits $a_1a_2a_3...a_n$ should be a multiple of 3 The numbers $a_1a_2a_3...a_n1$ and $a_1a_2a_3...a_n7$ should be composite numbers   If I didn't clearly convey what I'm trying to say, I mean like, say I want the two numbers (eg: ($121$, $127$) or ($151$, $157$) or ($181$, $187$)) to be both composite.  I'm still quite not equipped with enough knowledge to identify if a random large number is prime or not, so I believe you guys at Math SE can help me out. Why $9$ & $11$ are special in divisibility tests using decimal digit sums? (casting out nines & elevens) I don't know if this is a well-known fact, but I have observed that every number, no matter how large, that is equally divided by $9$, will equal $9$ if you add all the numbers it is made from until there is $1$ digit. A quick example of what I mean:  $9*99 = 891$ $8+9+1 = 18$ $1+8 = 9$  This works even with really long numbers like $4376331$ Why is that? This doesn't work with any other number. Similarly for $11$ and alternating digits sums. How can I add a bookmark in my nautilus folder explorer Is this a capacitor start motor and can I start it with a microwave capacitor I salvaged an old motor out of a air conditioner and I want to know if it's a capacitor start motor if I can start it with the capacitor I have and how to start it.  I included pictures of the motor and capacitor btw i have never worked with capacitive start motors so i need details on exactly how to wire it up with out ruining it Polygamma function series: $\sum_{k=1}^{\infty }\left(\Psi^{(1)}(k)\right)^2$ Applying the , I found: $$S=\displaystyle\sum_{k=1}^{\infty }\left(\Psi^{(1)}(k)\right)^2\lt\dfrac{2}{3}\pi^2$$ where $\Psi^{(1)}(k)$ is the polygamma function. Is it known any sharper bound for the sum $S$? Thanks. Regex for parsing directory and filename I'm trying to write a regex that will parse out the directory and filename of a fully qualified path using matching groups.  so...  /var/log/xyz/10032008.log   would recognize group 1 to be "/var/log/xyz" and group 2 to be "10032008.log"  Seems simple but I can't get the matching groups to work for the life of me.  NOTE:  As pointed out by some of the respondents this is probably not a good use of regular expressions.  Generally I'd prefer to use the file API of the language I was using.  What I'm actually trying to do is a little more complicated than this but would have been much more difficult to explain, so I chose a domain that everyone would be familiar with in order to most succinctly describe the root problem. I have a Dell N5110 laptop with integrated Nvidia GeForce GT 525M and an Intel HD Graphics 3000 card; My problem is the default card is the Intel one, and it provides a very bad performance with Windows 8. So can I force to use the Nvidia one all the time including "Desktop Windows Manager" ? How to prove that for all natural numbers, $4^n > n^3$? This is a problem set I have, it's not a homework but it's very important practice...  Send me some hints please, I don't want an answer I need to get it by myself but I'm failing miserably...   The problem is:     Prove that for all natural numbers $n$,  $4^n &gt; n^3$ Who is the Lord, as referred to in the title? Frodo? Sauron? Someone else? Or is it more of an abstract title, not referring to a single person, like "He who wields the One Ring"? If $f$ is continuous and $\,f\big(\frac{1}2(x+y)\big) \le \frac{1}{2}\big(\,f(x)+f(y)\big)$, then $f$ is convex Let $\,\,f :\mathbb R \to \mathbb R$ be a continuous function such that $$ f\Big(\dfrac{x+y}2\Big) \le \dfrac{1}{2}\big(\,f(x)+f(y)\big) ,\,\, \text{for all}\,\, x,y \in \mathbb R, $$ then  how do we prove that $f$ is convex that is $$ f\big(tx+(1-t)y\big)\le tf(x)+(1-t)f(y) , \forall x,y \in \mathbb R , t\in (0,1)? $$ I can prove it for dyadic rational's $t=\dfrac k {2^n}$ and then argue by continuity ; but I would like a more direct proof . Thanks in Advance URLs are linked despite being inside a code span Markdown source:  `http://google.com`  - `http://google.com`     - `http://google.com`   Rendered result:  http://google.com   http://google.com   http://google.com    Note that the third code span is a link. Adding a newline before the list item makes the link disappear. How long can I store a food in the pantry, refrigerator, or freezer? How do I know if a given food or ingredient I have is still good, or if I should discard it?  How can I best preserve a food or ingredient?     This broad question is intended as a "general reference" question to quickly answer many how long will food keep for? questions. Please feel free to edit this question to expand and clarify as needed.