whenever i type apt-get install git then it show error... error displayed by terminal is     yogesh@yogesh-dell:~$ apt-get install git     E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied)     E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?
I get this error whenever I try to install programs using the terminal:  home@ubuntu:~$ apt-get install myunity E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?   Also I'm unable to install updates using the terminal.
Ubuntu system is broken after accidentally uninstalling many packages How do I remove top bar on secondary monitor?? I am seeing quite a few conversions which have as source "accounts.google.com" (almost 40%).  AFAIK, in the new Universal Analytics as soon as a user has a Referrer set a new session is started. So if a user is getting on my page, and creates an account using social auth (e.g. Google accounts) when being redirected back, will this create a new session? I guess this would explain that there are many conversions coming from accounts.google.com - is it safe to enter accounts.google.com into the Referral Exclusion List? And more - what about Facebook logins, those would show up as facebook.com, but i probably don't want to exclude facebook.com as referrer?  Any ideas how to deal with UA referrers and social logins? Fundamental group of a torus with points removed Question 5.33 from "Topology and its Applications"  by Baesner is to compute the fundamental group of the torus ($T^2$) with $n$ points removed. I can "see" in my mind that if we remove one point we get a bouquet of two circles. Less clear is what happens when we remove two (or more) points. Any hints? On Windows 10 Professional, with the November update (Build 10586, Version 1511) , is there any possibility to completely remove Windows Defender ?  I don't want to just disable Windows Defender.  I want to completely uninstall from my system. Proof that the One-Dimensional Simple Harmonic Oscillator is Non-Degenerate? The standard treatment of the one-dimensional  (SHO) using the raising and lowering operators arrives at the countable basis of eigenstates $\{\vert n \rangle\}_{n = 0}^{\infty}$ each with corresponding eigenvalue $E_n = \omega \left(n + \frac{1}{2}\right)$. Refer to this construction as the abstract solution.  How does the abstract solution also prove uniqueness? Why is there only one unique sequence of countable eigenstates? In particular, can one prove the state $\vert 0\rangle$ is the unique ground state without resorting to coordinate representation? (It would then follow that the set $\{\vert n \rangle\}_{n = 0}^{\infty}$ is also unique.)  The uniqueness condition is obvious if one solves the problem in coordinate representation since then one works in the realm of differential equations where uniqueness theorems abound. Most textbooks ignore this detail (especially since they often solve the problem both in coordinate representation and abstractly), however I have found two exceptions:   Shankar appeals to a theorem which proves one-dimensional systems are non-degenerate, however this is unsatisfactory for two reasons:   Not every one-dimensional system is non-degenerate, however a general result can be proven for a large class of potentials (the SHO potential is in such a class). The proof requires a departure from the abstract solution since it classifies the potentials according to their functional properties.  Griffiths addresses this concern in a footnote stating that the equation $a \vert 0\rangle = 0$ uniquely determines the state $\vert 0\rangle$. Perhaps this follows from the abstract solution, however I do not see how. So, I just finished off the first part of an important task for school and today when I was going to continue, the document with my notes were gone. The only fragment I've got left of my file is the back up file, which doesn't show in the folder where I saved the document, but I can search for it.  Is there anyway which allows me to open the back up file, save it as a text file and continue my task? I don't really have the time for running restoring tools, which never has helped me in a satisfactory way anyway.  I wrote the document in gedit and my version of Ubuntu is 12.10. Does $\lim_{n\to\infty}\underset{n}{\underbrace{\cos(\cos(...\cos x))}}$ exist? Possible Duplicate:         Does the following limit exist?  $$\lim_{n\to\infty}\underset{n}{\underbrace{\cos(\cos(...\cos x))}}$$  If yes, find the limit.  If no, please explain why the limit doesn't exist.  I think, the limit exists.  So, I tried to use Squeeze theorem but didn't work. Showcase of beautiful typography done in TeX & friends If you were asked to show examples of beautifully typeset documents in TeX &amp; friends, what would you suggest? Preferably documents available online (I'm aware I could go to a bookstore and find many such documents called 'books'). Extra bonus for documents whose LaTeX source is available.  This is not an idle question. Seeing great examples of any craft is both educational and inspiring, let alone explaining why we prefer TeX to Word or other text editors.  For instance, I like how Philipp Lehman's  looks. I don't know enough LaTeX to realize how much customization was done, but the ToC looks polished.  Your nominations, please ... How can I give other drives and partitions short, meaningful names in nautilus? In nautilus and Unity the external drive has a nice short descriptive name "mcat", but all partitions on the 4 internal drives are displayed as a size (834 GB filesystem) or a huge 32-character string form of a GUID:  I'm guessing the external drive is nice, short, sweet and readable because that drive may have no partitions (well, just one I guess) and that name may be the drive label, whereas partitions usually don't have names. That may explain my problem, but doesn't solve it.  Is there some way to give reasonable names to these partitions in nautilus and Unity? I'm using the package braket for my physics notes, and this speeds things up a great deal but I'm constantly writing \ket{\psi} or \bra{\psi}, and because this specific pair of bra and ket appears so often, this gets repetitive and I would like a macro to speed this up.  However since the braket package works only in math mode, my attempt \newcommand{\ketp}{$\ket{\psi}}$ work when I'm writing in text mode, but when I'm writing in mathmode it breaks (unsurprisingly).  Is there any way I can get this command to work in both mathmode and textmode without having to define two different macros, one for each?    Thanks in advance for any help.  P.S. I'm certain this is a very simple question but I could find little to no explanation of this feature. How to parseInt a string with leading 0 Use HERE file and redirect output of command I have the following code in a batch script:  mpirun -np 6 ./laplace &lt;&lt;END 100 100 100 0.01 100 3 2 1 END | tail -n 1 &gt; output   But it isn't working. What I want it to do is to use the HERE file as input to the mpirun command, and then pipe the output to the tail command. However, I think the HERE file and tail output things are getting confused.  How should I write this so that it does what I want? Schengen visa refused from German embassy I was having trouble playing the game on my android so I downloaded it to my wife's phone (Galaxy S6). I read some posts on how to get it running on my android and it worked but, my level 7 account is on my wife's phone.  How do I get it back to my android? When I sign out and back in it doesn't ask for any sign in info. I've tried deleting the app's data and even uninstalling and re-installing, but it still doesn't ask for sign-in info. How to prove $B-A \succeq 0 \Leftrightarrow$ ellipsoid $x^TBx \leq 1$ contains $x^TAx \leq 1$? Assume $A \in \textbf{S}^n_{++}$, an ellipsoid centered at the origin given by $$\mathcal{E}_A = \{x\mid x^TA^{-1}x \leq 1\}$$ Then we have $\mathcal{E}_A \subseteq \mathcal{E}_B $ if and only if $B-A \succeq 0$. This is the proposition in the Boyd &amp; Vandenberghe's  (pages 45-46). The authors gave only the result, without proof. How to prove it? Are Harry Potter and Ginny Weasley Distant Relatives? For $x\in\mathbb R\setminus\mathbb Q$, the set $\{nx-\lfloor nx\rfloor: n\in \mathbb{N}\}$ is dense on $[0,1)$ Let $A,B \subset \mathbb{R}$. Show that $\sup(A \cup B) = \max\{\sup A, \sup B\}$ Let $A,B \subset \mathbb{R}$. Show that $\sup(A \cup B) = \max\{\sup A, \sup B\}$   Here's what I did so far:  Let $\sup A, \sup B$, and $\sup (A \cup B)$ denote upper bounds of $A,B$, and $A \cup B$, respectively. If $x \in A$, then $x \le \sup A$. If $x \in B$, then $x \le \sup B$. In either case, $x \in (A \cup B)$. So either $x \le \sup A$ or $x \le \sup B$. In either case, $x \le \max \{\sup A, \sup B\}$. So $\max \{\sup A, \sup B\}$ is the upper bound of $A \cup B$, which means $\sup (A \cup B) \le \max\{\sup A, \sup B\}$.  I do not know if there's a better way to go at it, but all I did was show the inequality. Can I do this, and show the reverse inequality? If so, how can I go about doing that? Bash: command not found