I am somewhat new to git any advice would be appreciated. Even a link to learn a more in depth free video/course practice could be useful to me here.
What are the differences between git pull and git fetch?
I am using XeLaTeX and memoir to write a longer text with several parts, chapters and sections. When printing the \tableofcontents I get a spacing problem with 2-figure numbers almost overlapping the relevant section name, as per enclosed picture.  I am aware that the memoir manual has a section dedicated to this theme, but the most part of it is doubledutch to me. Is there any easy way to avoid this problem? Nautilus not opening up, showing GLib error I have a point $(X,Y)$ on an elliptical curve $E(a,b)$ where $a=-3$ and $B$ is a large number that is in hexadecimal from -51BD. To compress this point oficially in a program, we know that every $X$ on the curve has two $Y$'s, one even and one odd. Therefore, we only need to store whether the corresponding $Y$ point we are storing is even or odd. So to store the point $(X,Y)$ now, we shift $X$ ridding of its most significant bit and add $1$ if the $Y$ point is odd. Therefore, one can think of the compressed point being $2 \cdot X+B$ ($B$ is the bit we added to tell if $Y$ was odd or even) since the multiplication by $2$ is implied because of the shift. I understand this completely. It's recovering the original point that has me confused.  Since a point on the curve is given by the equation $y^2=x^3+ax+b$, we can find square roots officially in $\mathrm{GF}(p)$. The following from my spec is what confuses me.  If $p$ is prime and congruent to $3$ mod $4$, one of its square roots is $z^{(p+1)/4} \bmod p$ and the other is $p-z^{(p+1)/4} \bmod p$. How would I solve this? What is $z$?  For example, I know how to extract the $x$ point so let's say I simplify the right side of the equation to be $7$ and $p$ is $11$. Would I be trying to solve for the square root that's equal to $7$ mod $11$? How to type "ç" when using USA intl as the keyboard layout? I asked  but I can't make that solutions work on Unity. I want to use the keys ´ followed by c and the output should be "ç". It works that way in Windows out of the box, and it did work in Ubuntu 10.10 following the solutions given in the question above. But in 11.04 it outputs "ć". How to change that? Let: $P(x) = a_nx^n + a_{n-1}x^{n-1} + ..... + a_1x + a_0$ where $a_0a_n &lt; 0$ I have to prove that the Polynomial $P(x)$ has at least one positive root how can I prove it? Any ideas? What defines the maximum size for a command single argument? What is needed for a game's stats to be saved? Last night I played a few games with my friend. While in the last game, I suddenly remembered something I had to do and was about to leave but my friend told me that I would lose my progress if I did so. I stayed until the end, through the scoreboard screen and quit while the next map was loading. Taking a look  now, I can't see any of yesterday's games. I don't remember how much XP I had yesterday so there is no sure way for me to check that. I had gotten a dozen ribbon and I don't see them in the feed, but there could be specific conditions to be showing them.  My questions then.   If you quit a game early, do you lose progress / XP? What if you quit on the scoreboard? Do you need to wait for the next map to load to save your progress? Any idea why the games aren't showing up? Some of them I definitely waited for the next map to load. Is there a delay for them to be shown on Battlelog?   Thanks. What is a reasonable depth and diameter for postholes dug in clay soil to support an 8' fence? What is a reasonable depth and diameter for postholes dug in clay soil where the frost line is no more than 12” and that will support an 8 foot tall solid wood fence that uses PostMaster metal posts?  I hope to have someone else install an 8 foot high PT wood fence.  There will be no light or air passing through or under the fence and it will be heavier than average, given the additional height and board weight.  One side will run for 135’.  The attached diagram provides more detail.  The PostMaster Installation Instructions describe a 30” deep, sloped, 10” diameter hole, filled with 6” of gravel plus 24” of concrete for a 6 foot high fence.  They caveat that the “exact diameter and depth will be determined by local weather and soil conditions.”  Got it.  Huntsville, AL; very clay soil.  Maximum wind gusts of 65 mph.  (This is not in the normal tornado path and is not intended to withstand a tornado.)  In reviewing the StackExchange posts on fencing and post holes I came across the concept that the diameter of the pier may be increased to compensate for a shallower post hole.  I would like to know the recommended depth and diameter without relying on the 2 buttress posts, which are my small overbuild idea.  We will be able to walk under them.  26 APR 18 update: I just found a Master Halco youtube video specifying 6-8" diameter holes dug 36" deep for an 8' board-on-board fence, such as I would like to have.   - I also spoke to a fence builder experienced using PostMaster posts who opined that the 10" diameter and 30 deep holes were more than adequate, but that the gravel was of no value in our climate.  So, 30" x 10" dia inches of concrete vs. 36" x 8" dia of concrete. Converting transparent gif / png to jpeg using java Updating VS Code in ubuntu 18.04 Is $\langle1-i\rangle$ a maximal ideal in $\mathbb{Z}[i]$? I'm trying to show that $\langle1-i\rangle$ is a maximal ideal of $\mathbb{Z}[i]$.  I started by assuming there is some ideal $A$ that properly contains $\langle1-i\rangle$, and then I want to show that $1 \in A$, and then I will have that $A= \mathbb{Z}[i] $, so $\langle1-i\rangle$ is maximal.  Is this the right approach?  Thanks  Second Attempt: Because $\forall a+bi \in \mathbb{Z}[i]$, we have $a+bi = (a+b) -b(1-i)$, then we have $a+bi - (a+b) = -b(1-i) \in \langle1-i\rangle$, which implies $a+bi +\langle1-i\rangle = a+b +\langle1-i\rangle$.  So every coset is of the form $c +\langle1-i\rangle$, where $c\in \mathbb{R}$.  Furthermore, $-i(1-i)^2=2 \in \langle1-i\rangle$. Write $c = 2q + r$, where $q,r\in \mathbb{R}$ and $r=0,1$.  Then because $2 \in \langle1-i\rangle$, we have $2q\in \langle1-i\rangle$ and therefore $2q= 2q+r-r = c-r\in \langle1-i\rangle$, so $c+\langle1-i\rangle = r+\langle1-i\rangle$, and every coset is of the form $0 + \langle1-i\rangle$ or $1 +\langle1-i\rangle$. Thus, $1 +\langle1-i\rangle$ is the only nonzero element, and is invertible with itself as its inverse.  Thus, $\mathbb{Z}[i]/\langle1-i\rangle$ is a field with two elements, and by a theorem, $\langle1-i\rangle$ must be maximal.  Is this correct? How can I find the XY coordinates of an HTML element (DIV) from JavaScript if they were not explicitly set? Keep processes alive after SSH logout Im trying to measure bandwidth, packet loss, latency and jitter between two computers on a wireless 802.11s mesh connection.   Im trying to make a (my first) bash script that can do the following:   SSH to another computer and start logging data from services (ptpd, tcpdump, iperf). Start the same processes on my own computer and start logging data. Once the iperf transmission on my own computer is finished, it should SSH into the remote computer and kill the the services.   The idea is for this these three steps run in a for-loop, that increases the package size transmitted by iperf for each iteration and logs the resulting data.  I know how to start a process on the remote pc by ssh host@adress process.  I am however clueless on how to start multiple processes through SSH and logout, since the processes are terminated once I logout. I have looked at the screen and nohup commands, but don't know how to use them in a script.  Thanks in advance!  EDIT:  Thanks for all the help so far.  I got nohup to work now, it was pretty simple as people pointed out.  So now I got: ssh host@adress nohup ./script.sh &gt; /dev/null 2&gt;&amp;1 &amp; in the script on my main pc. This starts a script on the remote pc just fine, and then logout of SSH. The next problem is how to execute the script on the remote pc as sudo, since this is needed by tcpdump.  Trying ssh host@adress **sudo** nohup ./script.sh &gt; /dev/null 2&gt;&amp;1 &amp; doesnt work.  Any ideas?  EDIT 2:  If anybody is stuck with the same problem, I found a guide how to solve this: How do you convert LPCWSTR to const char *? Automatic labeling of enumeration items Is PCA still done via the eigendecomposition of the covariance matrix when dimensionality is larger than the number of observations? I have a $20\times100$ matrix $X$, containing my $N=20$ samples in the $D=100$-dimensional space. I now wish to code up my own principal component analysis (PCA) in Matlab. I demean $X$ to $X_0$ first.  I read from someone's code that in such scenarios where we have more dimensions than observations, we no longer eigen-decompose the $X_0$'s covariance matrix. Instead, we eigen-decompose $\frac{1}{N-1}X_0X_0^T$. Why is it correct?  The normal covariance matrix is of size $D\times D$, each element of which tells us the covariance between two dimensions. To me, $\frac{1}{N-1}X_0X_0^T$ is not even of the correct dimensions! It is $N\times N$ matrix, so what would it tell us? Covariance between two observations?! Centering sections We want to find the solution $x$ to the congruence system  $$\begin{align} x &amp;\equiv r_1 \!\!\!\pmod{\!m_1}\\ x &amp;\equiv r_2 \!\!\!\pmod{\!m_2}\end{align},\ \ {\rm where}\ \  \gcd(m_1, m_2) = 1$$  These can be rewritten as  $$\begin{align} x &amp;= r_1 + m_1 j\\ x &amp;= r_2 - m_2k\end{align}$$  for unknown integers $j, k$. So we set those two equations as equal and rearrange them to  $$m_1j + m_2k = r_2 - r_1$$  Now assume we perform $\text{egcd}(m_1, m_2)$, which gives us the solution to  $$m_1u + m_2v = \gcd(m_1, m_2)$$  Let the integer $\,h\,$ make $\,h \gcd(m_1, m_2) = r_2 - r_1$.  Then $\qquad hm_1u + hm_2v = h\gcd(m_1, m_2) =  r_2 - r_1 = m_1j + m_2k$  At this point I am lost because I don't think we can just assume  $hm_1u = m_1j$ and extract $j = hu$.   How do I get the values of $j$ or $k$ so I can get the value of $x$? Why is triple-DES using three different keys vulnerable to a meet-in-the-middle-attack? Among other sources,  states that triple DES using three seperate keys (k1, k2, k3) is vulnerable to meet-in-the-middle-attacks, while triple DES using only two keys (k1, k2, k1) is not.  Why is this attack possible if all the keys are different, but not if the first and the third are the same? Momentum is defined by the product of mass and velocity. Now a projectile out of a gun has to have high velocity to penetrate a human body, as its mass isn't significant. But to reach this velocity, due to inertia/the law of energy conservation, momentum on both sides is to be equal. As there is strong negative acceleration in the opposite direction of the bullet, it should result in a strong force in the opposite direction of the bullet ($F = m*a $).  Therefore I wonder why shooting a bullet with a handgun is not ripping your hand apart.