How can I make tabu break lines at any character?
Wrap text at any point if normal hyphenation not possible
How to display citations in text grouped as [1-3] in stead of [1,2,3] I've got a few macros that perform floating point lookups and calculations for me and I'm interesting in plotting their results. They're the kind of calculation which requires if/else, so they can't be easily written as a simple math formula for \addplot.  Thanks to a previous question (), I now know to use \pgfmathdeclarefunction, but after trying it I've found that addplot seems to prepend a "0Y" or "1Y" to values before passing them as function arguments. My external macros aren't prepared to handle this extra text, and I'm not sure why it's there.   In the course of testing things out, I've also found that calling a function defined with pgfmathdeclarefunction can also change the positioning of the graph...  \documentclass{article}  \usepackage{xparse}  \usepackage{pgfplots} \pgfplotsset{compat=1.10}  \begin{document}  % Example of a macro which does math outside of pgf     \ExplSyntaxOn     \DeclareExpandableDocumentCommand \doubleMacro { m }%      {%       \fp_eval:n { #1*2 }%Math performed by a package other than pgfplots      }%     \ExplSyntaxOff    %Demo: macro does work in regular text \doubleMacro{1.1}.  % Defining custom pgf functions for plotting      \pgfmathdeclarefunction{mathDoubleMacro}{1}{%         \pgfmathparse{\doubleMacro{#1}} %Calls macro which performs math done by another package     }      \pgfmathdeclarefunction{mathDoublePgf}{1}{%         \pgfmathparse{#1*2} %Uses pgf to do the same thing as an external macro could     }  %Generic plot with function given directly to \addplot \begin{center} \begin{tikzpicture}     \begin{axis}         \addplot[domain=0:1] {2*x};     \end{axis} \end{tikzpicture} \end{center}  %Plot using first macro: complains about 'Unknown fp word Y.' \begin{center} \begin{tikzpicture}     \begin{axis}         %\addplot[domain=0:1] {mathDoubleMacro(x)};%Commented out because it gives problems     \end{axis} \end{tikzpicture} \end{center}  %Plot using second macro: works, but graph is displaced to the right of the expected position \begin{center} \begin{tikzpicture}     \begin{axis}         \addplot[domain=0:1] {mathDoublePgf(x)};     \end{axis} \end{tikzpicture} \end{center}  \end{document}   If I define mathDoubleMacro as calling a non-existent macro, then the errors show which x-values which the addplot is trying to evaluate y at:    0Y0.0e0  1Y4.1666e-2 1Y8.3332e-2 ...  1Y9.9998401e-1   What are these nY's all about, and why does \addplot[domain=0:1] {mathDoublePgf(x)} give a graph with different positioning? Low Quality review queue erroneously showing "Close" instead of "Recommended Close"? I was in the Low Quality Review queue, and the following review confused me:    It's showing eight "Close votes", which should be more than enough to close a question.  I checked the question's , and it wasn't somehow closed, then re-opened in the middle of the review.  So I then checked on each of the users, and noticed that the majority of them are under 3000 reputation, meaning they can only "Recommend Close".    However, all reviews are simply showing as "Close", which is extremely confusing.  Is this a bug, or possibly an undocumented change related to ?    Another recent example: I've seen many posts regarding a combinatorial proof of the following question. But for a non-combinatorial proof would the following method work? Also... is this the easiest way to arrive at a proof? It seems to be rather verbose.  Show the formula $k {n\choose k} = n {n-1 \choose k-1}$ is true for all integers $n,k$ with $0\le k \le n$.  My answer:  Observe that  $$\begin{align*} {n\choose k}&amp;= \frac {n}{k} {n-1 \choose k-1}\\ &amp;= \frac {n}{k}\left[ {n-2 \choose k-2} + {n-2 \choose k-1}\right]\\ &amp;= \frac {n}{k}\left[ \frac{(n-2)!}{(k-2)!(n-2-(k-2))!} + \frac {(n-2)!}{(k-1)!(n-2-(k-1))!}\right]\\ &amp;= \frac {n}{k}\left[ \frac{(n-2)!}{(k-2)!(n-k)!} + \frac {(n-2)!}{(k-1)!(n-k-1)!}\right]\\ &amp;= \frac{(n-1)!}{(k-1)!(n-k)!} + \frac {(n-1)!}{(k)!(n-k-1)!}\\ &amp;= \frac{(n-1)!}{(k-1)!(n-1-(k-1))!} + \frac {(n-1)!}{(k)!(n-1-k)!}\\ &amp;={n-1 \choose k-1} + {n-1 \choose k}={n \choose k}. \end{align*}$$ This is a  about DNS glue records.   What exactly (but briefly) is a DNS glue record?  Why are they needed and how do they work? I have a Python script which I would like to execute at every startup. I can run it by adding this to the startup applications:  python3 /path/to/script.py   That works, but it doesn't open a terminal window, so I can't see the program's output. How could I make it open a terminal window and execute the script in there?  Note: I get the window to stay open with input(' ') at the end of the Python script. Thanks! I often find that I can zoom in to a point, but then cannot zoom any more, even when there is a lot of room to zoom to the meshes on the scene.   This is particularly annoying in the following scenario:  I often land up left clicking on the scene and the 3D cursor shifts there. I use Shift+C to shift the 3D cursor back to the origin. However, this also centers the view on the cursor and shifts the view to show all objects, and sometimes this zooms things way out &ndash; at this point, if I try to zoom in, I can zoom in to a point (using the pinch/zoom on trackpad), but then it stops zooming in.   How do I zoom in after that? Is there anything else I am doing wrong in this case? Here's Prob. 3, Chap. 3 in the book Principles of Mathematical Analysis by Walter Rudin, 3rd edition:      If $s_1 = \sqrt{2}$, and $$s_{n+1} = \sqrt{2 + \sqrt{s_n}} \ \ (n = 1, 2, 3, \ldots),$$ prove that $\left\{ s_n \right\}$ converges, and that $s_n &lt; 2$ for $n = 1, 2, 3, \ldots$.    My effort:   We can show that $\sqrt{2} \leq s_n \leq 2$ for all $n = 1, 2, 3, \ldots$. [Am I right?]  Then we can also show that $s_n &lt; s_{n+1}$ for all $n = 1, 2, 3, \ldots$. [Am I right?]  But how to calculate the exact value of the limit? Where does this sequence occur in applications? What is the fastest car in Saints Row 4, and where can I find it? I found an Attrazione in Salander, which has traditionally been fastest in previous games, but I don't like sinking upgrades money into a car unless it's for keeps. What car is fastest in Saints Row IV (before and after upgrades), and how can I get it? Is there any way to get stats on the car in-game? I'm a trainee teacher and I need to pass a skills test in maths, but I'm having trouble in this particular area of algebra in finding the nth term of any sequence. I've been given a series of questions to answer one of them is:  Find the nth term of the sequence 3, 8, 15, 24.  I not only need to know the answer but more importantly the technique. This is GCSE level. When does $\lim_{n\rightarrow \infty} a_n = 0$ imply $\sum_{n = 0}^{\infty} a_n$ converges? This is just a general question. I know the opposite statement is always true. I'm just asking when the converse holds. I know that the converse is not true in some cases, such as for harmonic series. What additional restrictions are needed to make this statement true? In the 10 k tools,  is described as if I had approved it:    However, the review item itself (correctly) displays that I rejected this edit:    Going by   , this should be fixed, but it isn’t.  This could be solved by replacing approved by to reviewed by in the list or making an explicit list, who approved and rejected an edit (which is probably more complicated). I want to know where I can find updated information about all the stable and in-development versions of Ubuntu, where I can find this information?     This question is meant to be a canonical question. It expects to answer the following questions:         Is X version stable yet?   Is X version in beta?   Is X version still supported?   What versions are still supported?   What are the versions in Beta/Alpha?   Until where X version will be supported?   Have X version ceased support?   When will be X version released?   Where I can download any release?   When will the next LTS version of Ubuntu be released?         The list is not exhaustive. How did Rita know she lost the power? Heisenberg Uncertainty Principle scientific proof states that:    $$\sigma(x)\sigma(  p_x )\ge \frac {\hbar}{2}.$$  What is the scientific proof of this principle? Function to determine if two numbers are nearly equal when rounded to n significant decimal digits I have been asked to test a library provided by a 3rd party. The library is known to be accurate to n significant figures. Any less-significant errors can safely be ignored. I want to write a function to help me compare the results:  def nearlyequal( a, b, sigfig=5 ):   The purpose of this function is to determine if two floating-point numbers (a and b) are approximately equal. The function will return True if a==b (exact match) or if a and b have the same value when rounded to sigfig significant-figures when written in decimal.   Can anybody suggest a good implementation? I've written a mini unit-test. Unless you can see a bug in my tests then a good implementation should pass the following:  assert nearlyequal(1, 1, 5)  assert nearlyequal(1.0, 1.0, 5)  assert nearlyequal(1.0, 1.0, 5)  assert nearlyequal(-1e-9, 1e-9, 5)  assert nearlyequal(1e9, 1e9 + 1 , 5)  assert not nearlyequal( 1e4, 1e4 + 1, 5)  assert nearlyequal( 0.0, 1e-15, 5 )  assert not nearlyequal( 0.0, 1e-4, 6 )    Additional notes:   Values a and b might be of type int, float or numpy.float64. Values a and b will always be of the same type. It's vital that conversion does not introduce additional error into the function. Lets keep this numerical, so functions that convert to strings or use non-mathematical tricks are not ideal. This program will be audited by somebody who is a mathematician who will want to be able to prove that the function does what it is supposed to do. Speed... I've got to compare a lot of numbers so the faster the better. I've got numpy, scipy and the standard-library. Anything else will be hard for me to get, especially for such a small part of the project. Attaching event handlers in Visual Basic .NET JQuery Selector for dynamic id How can I replace end line with fixed text when the next line begins with a defined set of characters? I have several big files with some measurements.   It looks this way:  N 12344;PE 9.9999999;... #S 0 0 31 44 75 130 165 196... #S_+ "2 5 2 3 3 1 1 2 3 1 2 2...  N 12345;PE 9.9999999;... #S 0 0 34 57 84 133 152... #S_+ "1 0 1 1 2 3 0 0 0...  N 12346;PE 9.9999999;... #S 0 0 31 44 73 140 169... #S_+ "3 3 4 0 0 2 1 2 4...  N 25104;PE 9.9999999;... #S 0 0 36 52 102 108 145... #S_+ "1 1 0 1 0 0 3 0 1...  N 25105;PE 9.9999999;... #S 0 0 32 58 88 130 143...   Sample is here:   The file is much bigger but I replaced part of the data with "..." to make it shorter.  I need to somehow replace the line ends before "#S" - in fact simply merge the "N" line with the following two ones into one line (or with the following three ones so I can get rid of the blank lines). Expect output like this:  N 12344;PE 9.9999999; #S 0 0 31 44 75 130 165 196 #S_+ "2 5 2 3 3 1 1 2 3 1 2 2... N 12345;PE 9.9999999; #S 0 0 34 57 84 133 152 #S_+ "1 0 1 1 2 3 0 0 0... N 12346;PE 9.9999999; #S 0 0 31 44 73 140 169 #S_+ "3 3 4 0 0 2 1 2 4... N 25104;PE 9.9999999; #S 0 0 36 52 102 108 145 #S_+ "1 1 0 1 0 0 3 0 1... N 25105;PE 9.9999999; #S 0 0 32 58 88 130 143...   Is this possible to achieve using some command-line utility in linux?   My knowledge is quite limited in this area so I would appreciate any help.  thanks Solving binomial theorem via induction