How do I zcat two files inline to perform diff? How can I zcat 2 .gz files inline to perform a diff in unix? Have tried eval but syntax not right.   zcat file1.gz zcat file2.gz
Is there a safe way to run a diff on two zip compressed files? Seems this would not be a deterministic thing, or is there a way to do this reliably?
Install Headers on Kali apt-get install linux-headers-`uname -r` Reading package lists... Done Building dependency tree Reading state information... Done E: Unable to locate package linux-headers-4.9.0-kali3-amd64 E: Couldn't find any package by glob 'linux-headers-4.9.0-kali3-amd64' E: Couldn't find any package by regex 'linux-headers-4.9.0-kali3-amd64' If $ \langle G, \star \rangle $ is an abelian group, then for all $a, b \in G$, show that $(a \star b)^{n} = a^{n} \star b^{n}$. If $ \langle G, \star \rangle $ is an abelian group, then for all $a, b \in G$, show that $(a \star b)^{n} = a^{n} \star b^{n}$.  I am stuck at the first step, unable to figure out how to start. I am just beginning on group theory, and know that an abelian group obeys commutativity, associativity, has an identity element, and each element is invertible. I am unable to figure out how to apply this for the proof. Any hints on how I should get started? Why Does Software Updater Say No updates Available, but apt-get upgrade Shows updates available? Given the Lie algebra, what is the systematic way to construct the matrix representation of the generators of the desired dimension? I ask this question here because it is the physicists for whom representation of groups is more important than mathematicians.   Let us, for example, take $SU(2)$ for concreteness. Starting from the generic parametrization of a $3\times 3$ unitary matrix $U$ with $\det U=1$, and using the formula of generators $$J^i=-i\Big(\frac{\partial U}{\partial \theta_i}\Big)_{\{\theta_i=0\}}$$ one can find the $3\times 3$ matrix representation of the generators.  However, I'm looking for something else.    Given the Lie algebra $[J^i, J^j]=i\epsilon^{ijk}J^k$, is there a way that one can explicitly construct (not by guess or trial) the $3\times 3$ representations of $\{J^i\}$? Will the same procedure apply to solve other Lie algebras appearing in physics such as that of $SO(3,1)$ (or $SL(2,\mathbb{C})$)? I have a Linux instance that I set up some time ago.  When I fire it up and log in as root there are some environment variables that I set up but I can't remember or find where they came from.     I've checked ~/.bash_profile, /etc/.bash_rc, and all the startup scripts.  I've run find and grep to no avail.   I feel like I must be forgetting to look in some place obvious. Is there a trick for figuring this out? Why MOSFET source is indicated with arrow ? Setup IIS 7.5 with multiple website bindings and SSL? On IIS 7.5 I am trying to achieve this with two websites:  Default Web Site is bound to:  (blank host header port 80 - http) (blank host header port 443 - https) go.example.com www71.example.com the IP address of go.example.com  2nd web site "Beta" is bound to:  beta.example.com (blank host header port 443 - https) * using blank only because it doesn't seem to be possible to    bind https to a named host header   And both need to work with SSL.  But I have these problems:   When I type in beta.example.com, I see the go.example.com site instead I can not seem to add the SSL binding to both websites at once (I have a single *.example.com wildcard certificate).  The beta site will not even start if I add the https binding to it.   This is how I have set it up:    What is the correct way to set it up? When is Gauss' law not applicable? What does $b_i\mid b_{i+1}$ mean in this context? In the computational topology literature, the reduction algorithm for computing the Smith normal form of a boundary matrix uses the notation $b_j &gt; 1 \: \text{ and }\: b_j\mid b_{j+1}$ in the context of the diagonal elements of the Smith matrix. Can anyone give me an idea for what it means? Biblatex with Biber: Configuring my editor to avoid undefined citations Running the minimal example  \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @ARTICLE{example,   author  = {Other, Anthony Norman},   title   = {Some things I did},   year    = {2014},   journal = {J.~Irrep. Res.},   volume  = {1},   number  = {1},   pages   = {1-10} } \end{filecontents*} \usepackage[backend=biber]{biblatex} \addbibresource{\jobname.bib} \begin{document} Hello\cite{example}. \printbibliography \end{document}   I get the warning There were undefined references.  I have read  and know that I need to run:   LaTeX Biber LaTeX   However, my editor is only set up to run BibTeX. How do I go about setting up my editor/IDE to be able to run Biber, and how do I run the LaTeX/Biber/LaTeX cycle?  Answers (sorted alphabetically by editor name)                    Answer guidelines   Each answer should be for one editor. If the editor is cross-platform, if possible give a single answer with notes covering the minor platform variations. Please edit the question to include new answers in the 'link list' Each answer should be 'stand alone', i.e. don't say 'It's almost the same as editor Y but ...' for the editor part Instructions for 'build tools' such as arara or latexmk are welcome but should explain how to set up the editor in question as not all editors allow simple addition of arbitrary tools How to create a desktop shortcut in Unity? Is there an easy way to create a desktop shortcut for an application in Unity? The ability to right click or drag and drop icons to the desktop in Unity does not seem to be there. The space obtained by identifying the antipodal points of a circle How I can prove that the sequence $\sqrt{2} , \sqrt{2\sqrt{2}}, \sqrt{2\sqrt{2\sqrt{2}}}$ converges to 2? Prove that the sequence $\sqrt{2} , \sqrt{2\sqrt{2}},  \sqrt{2\sqrt{2\sqrt{2}}} \ $ converges to $2$.   My attempt  I proved that the sequence is increasing and bounded by $2$, can anyone help me show that the sequence converges to $2$? Thanks for your help. Is it safe to fully cook a stuffed turkey the night before thanksgiving? What is aperture, and how does it affect my photographs? If I create a file and then change its permissions to 444 (read-only), how come rm can remove it?  If I do this:  echo test &gt; test.txt chmod 444 test.txt rm test.txt   ...rm will ask if I want to remove the write-protected file test.txt. I would have expected that rm can not remove such a file and that I would have to do a chmod +w test.txt first. If I do rm -f test.txt then rm will remove the file without even asking, even though it's read-only.   Can anyone clarify? I'm using Ubuntu 12.04/bash. Determining "level" of an NPC ally for purpose of budgeting encounter XP Why does Lang describe a field as a union and compositum of its subfields in this manner? I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:   If $E,F \subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$. If $k \subset E$ and $\alpha_1,\dots,\alpha_n \in E$, then $k(\alpha_1,\dots,\alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $\alpha_1,\dots,\alpha_n$. Observe that $$ E = \bigcup k(\alpha_1,\dots,\alpha_n), $$ where the union is taken over all finite families $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$. The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family. $E$ is finitely generated over $k$ if there is a finite family $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$ such that $E = k(\alpha_1,\dots,\alpha_n)$. Observe that $E$ is the compositum of all its finitely generated subfields over $k$.   My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write $$ E = \bigcup_{\alpha \in E} k(\alpha) $$ because $E$ is clearly contained in the RHS, and each $k(\alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.  So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated. What do the different colors mean in ls? What do the different colours in Ubuntu's ls command mean? For example, when I type the ls command in one of my folders, I get one of the files in light green, the other (which is a folder) in blue with green highlighting.   What do those colours mean, and there is any manual about all the colours? Is it poor form to switch accepted answers? I had a question of the form "does something like X exist?" Someone wrote a response to say that, No, X does not exist, but I could write it if I liked. I had suspected as much, so I marked his answer as the accepted answer. Today someone actually posted the code to do X for me, and I feel that the new poster deserves the "Accepted Answer" checkmark.  Is it poor form for me to pick a new Accepted answer? Does the original answerer get penalized in terms of reputation?  While the original responder's answer was accepted at the time, I feel this new answer is really more helpful.  Edit: Which of these responses should I accept? What does the notion of a single accepted answer mean with a question that is subjective that could have multiple "right" answers?