What is the standard way to refer to shared code in conference papers?
How do you cite a Github repository?
Linear regression with fixed point I have a data set to which I want to add a trend line. For my system, there will always be a fixed point on (2, 0). I have the line representing this system, but currently I do not account for the fixed point. Is there functionality to achieve this?  \begin{figure} \begin{tikzpicture} \begin{axis} [     ylabel={Some Time [ms]},     ]     \addplot[only marks, color=red, error bars/.cd,                        y dir=both, y explicit]         table [x=num_of_nodes, y=MyData, y error=stdev_delay_var] {MyData.dat};     \label{plot_one}     \addplot +[mark=none, dashed]          table[y={create col/linear regression={y=MyData}}]         {MyData.dat}; \end{axis} \end{tikzpicture} \caption{Test Results} \label{fig:test_results} \end{figure} Greatest common divisor of two positive integers I know that Greatest common divisor of two positive integers $a$ and $b$ is the largest positive integer that divides both $a$ and $b$, but how can I use that to prove that $\gcd(a, b) = \gcd(a, b-a)$. Running programs in the background from terminal How the `\alignat` works in ams package I have read the related question(), which had detailed answer but still don't know what the meaning of the \alignat's argument. It is said in  that      This environment takes one argument, the number of “equation   columns”: count the maximum number of &amp;s in any row, add 1 and and   divide by 2.   What is the meaning of adding one in &amp; number and divide by two? I presumed the argument is given by the user, not automatically generated by the system? Do not hide VLQ flag option from users who already flagged and may wish to retract System hides an option to flag Very Low Quality in few cases, namely when post is:        Because of that users who already flagged it when none of above conditions applied miss an option to .  Suggest1 to show this flag option to such users so that they could retract a flag.    1 Frankly I won't mind if this gets  because I doubt that it is important. This is posted mainly to document how system behaves and to provide reference for those who may wonder why they can't retract flag in some cases. WMI object to get current sessions with client name? How to make a button appear as if it is pressed? how to crop image in to pieces programmatically $G$ solvable $\implies$ composition factors of $G$ are of prime order. I'm trying to prove the equivalency of the following definitions for a finite group, $G$:  (i) $G$ is solvable, i.e. there exists a chain of subgroups $1 = G_0  \trianglelefteq G_1 \trianglelefteq \cdots \trianglelefteq G_s = G $ such that $G_{i+1}/ \ G_i$ is abelian for all $0 \leq i \leq s-1$  (ii) $G$ has a chain of subgroups $1 = H_0  \trianglelefteq H_1 \trianglelefteq \cdots \trianglelefteq H_s = G $ such that $H_{i+1} /\  H_i$ is cyclic for all $0 \leq i \leq s-1$.  (iii) All composition factors of $G$ are of prime order.  (iv) G has a chain of subgroups $1 = N_0  \trianglelefteq N_1 \trianglelefteq \cdots \trianglelefteq N_t = G $ such that each $N_i$ is a normal subgroup of $G$, and $N_{i+1}/ \ N_i$ is abelian for all $0 \leq i \leq t-1$.  It was simple to show that (iii) $\implies$ (ii) and (ii) $\implies$ (i). Now, I'm trying to prove that (i) $\implies$ (iii), and I'm getting stuck.   I know that If $G$ is an abelian simple group, then $|G|$ is prime, so all I need to show is that each $G_{i+1}/ \ G_i$ in the definition of solvable is simple.  If I knew that $1 = G_0  \trianglelefteq G_1 \trianglelefteq \cdots \trianglelefteq G_s = G $ were a composition series, then each $G_{i+1}/ \ G_i$ would be simple by definition. But the definition of solvable doesn't assume a composition series. I know every group has a unique composition series, but I'm not sure how to connect that to the subgroups in the definition of solvable.   More generally, I guess I just don't understand how being abelian connects to being of simple or of prime order.  Any pushes in the right direction would be appreciated! Reverse Triangle Inequality in vector space I have already proved Triangle Inequality $\lVert v+w\rVert \le \lVert v \rVert+\lVert w \rVert$ in vector space $\mathbb{R}^n$. However, I'm having difficulties proving the Reverse Triangle Inequality in the vector space.  I have started with   $$\lVert v \rVert^2=v \cdot v-w\cdot w+w\cdot w \le \lVert v-w \rVert+\lVert w \rVert^2$$ $$\lVert w \rVert^2=w \cdot w-v\cdot v+v\cdot v \le \lVert w-v \rVert+\lVert v \rVert^2$$  based on the Triangle Inequality but I don't know if it is correct. If this is right, I think I can go on with proving it the same way I would the normal Reverse Triangle Inequality. I'm looking for mathematics books, courses + exercises for high school level. My daughter was high school certificated but she has stopped her studies for 5 years. She would like to be involved in new educational program but she needs to restore her mathematic capabilities.  Could you help me to identify which mathematics books can help her?  Thanks a lot for your reply,  FR. convergence of $\sum_{n=1}^{\infty }\frac{(-1)^{[\sqrt{n}]}}{n}$ where $[a]$ means floor function of $a$ I have a problem with solving the convergence of $\sum_{n=1}^{\infty }\frac{(-1)^{[\sqrt{n}]}}{n}$ where $[a]$ means floor function of $a$. I've already made the first thep and rewrote it with the $\sum_{n=1}^{\infty }(-1)^{n}\sum_{k=n^2}^{(n+1)^2-1}\frac{1}{k}$, which converges if and only if the previous one converges. Now I want to use Leibniz criterion, but I cannot prove that the second sum in the previous expression is monotonic. Does anyone know how to do it? (I cannot use Riemann integral, we haven't defined it yet) How do I change which audio jacks are used for input and output? I'm using a Realtek HD audio card built-in my motherboard. The Windows driver comes with a control panel that allows me to select which back panel jacks are used for what. So for example I can make both the blue jack and green jack for output and only the red one for mic-in. (Whereas by default, the blue jack is for line in, which I never need.)  How can I do the same under Linux? If possible, please don't suggest something that involves PulseAudio or JACK; I'd like to do it the plain way, e.g. by editing ALSA configuration files, if possible. The way I understand it, my problem should have nothing to do with software servers redirecting streams, just instructing the driver to treat this jack as so and so because it's hardware supported.  Thank you very much! Why do we use "have" with does and not "has"? The rules of Transfiguration: examples of making the inedible edible? Information from the official website of J.K.Rowling is generally considered canon. I remember at least one case when she 'changed her mind' after a particular rule has been  published on her website (what happens with a secret if a Secret Keeper dies). Nevertheless, the information from the website can generally be considered reliable.  A rather obscure piece of information is J.K.Rowling's Wizards' Ordinary Magic and Basic Aptitude Test () published on her website in 2007 and now accessible with a Time Turner.   In particular, we know that only one of the following options is correct (as the software allows you to choose only one option):     Which of the following is CORRECT?            a. Food can be conjured out of thin air.       b. Any object can be Transfigured into food.       c. Foodstuffs can be increased, Transfigured, summoned from a distance and magically cooked.       d. It is impossible to make the inedible, edible.   e. Food-related Charms are some of the simplest forms of magic.      W.O.M.B.A.T. Grade 3, 13 June 2007, question 8   The test appeared on J.K.Rowling's website before the release of Book 7, but we can almost safely assume that there was no time for J.K.Rowling to change her mind after compiling the test (though she must have submitted these questions weeks before they were eventually published).  As Hermione explained in Harry Potter and the Deathly Hallows:      Your mother can’t produce food out of thin air, no one can. Food is the first of the  to . It’s impossible to make good food out of nothing! You can Summon it if you know where it is, you can transform it, you can increase the quantity if you’ve already got some...   It means that the correct option is c, and therefore all other statements are false. So, apparently, you can make food out of something else, though not any object can be transfigured into food. Can you come up with any example of such transformation mentioned in the books? How can I check if a program exists from a Bash script? Creating a .desktop file for a new application Series convergence of $\sum_{n=1}^{\infty}\frac{1}{n^3}$ How to remove the lines which appear on file B from another file A? I have a large external with many subfolders that I want to move all videos, pictures, and music to another hard-drive, what would be the best way to do this?