I'm working on a little project that makes installing from source easier and one of those parts is getting the project to compile to a certain directory /usr/src/pkgname, so that all the files in there correspond to where they would be if I compile to /. But in order to get the files to be available to the user, they need to be symlinked to their corresponding directory in /. For instance installing neofetch would put the files like this: /usr/src/neofetch └── usr     ├── bin     │   └── neofetch     └── share         └── man             └── man1                 └── neofetch.1  But I want them to be symlinked to / like this: / └── usr     ├── bin     │   └── neofetch     └── share         └── man             └── man1                 └── neofetch.1  and they should create the directories if they don't exist yet
When I install a simple program it often uses make &amp;&amp; make install and doesn't often even have an uninstall target.  If I wish to upgrade a program, is it standard protocol to assume it just rewrites seamlessly over the old program?  How do I keep track of these programs; do most people just 'fire and forget' and if no uninstall target is given do I have to manually delete everything?
Rendered image looks pixelated When I hit F12 to render an image and zoom in it is quickly pixelated. How can I render a higher res display? I have looked through the settings and couldn't find a solution. Show that $d(z,a)=|\frac{z-a}{1-\overline{a}z}|$ is a metric on the unit disk For any $z, a$ in the open unit disk, we define$$d(z,a)=\left \vert \frac{z-a}{1-\overline{a}z} \right \vert$$  Show that $d$ is a metric on the open unit disk.     It is easy to show $d(z,a)=d(a,z)$ and $d(z,a)=0$ $\rm iff$ $z=a$. However, I am having trouble showing that it satisfies triangle inequality. Any help would be appreciated! Suppose $f$ and $g$ are entire functions, and $|f(z)| \leq |g(z)|$ for all $z \in \mathbb{C}$, Prove that $f(z)=cg(z)$.   My try :  I consider $h(z)=\frac{f(z)}{g(z)}$. If I prove that $h(z)$ is entire, using the fact that $|h(z)|\leq 1$, the result follows immediately from Liouville's theorem.  To prove that $h(z)$ is entire, I have to prove that $h(z)$ has removable singularities at possible zeros of $g(z)$.  Suppose $g(z_0)=0 \Rightarrow |g(z_0)|=0 \Rightarrow |f(z_0)|=0$, BUT what if $z_0$ be a root of of order $k$ of $g(z)$ (i.e. $f^{(n)}(z_0) = 0 $ for all $ 0 \leq n \leq k-1$) and be a zero of order $m$ of $f(z)$ and $k&gt;m$ ?  And if that's not the case, how to rigorously show that $z_0$ is a removable singularity ?  Thank you all in advance. How to enable root login again after changing password? I had enabled root login before and tried to change its password using this . But after successfully changing the password and locking it via sudo passwd -dl root. I cannot login back to SSH, it says Access is denied.  I have two users on my machine. root and admin, admin does not have su permission. When I try to use sudo on admin user, it says that admin is not in the sudoers file. That is why i need my su user back. How can I prove $\sup(A+B)=\sup A+\sup B$ if $A+B=\{a+b\mid a\in A, b\in B\}$ If $A,B$ non empty, upper bounded sets and $A+B=\{a+b\mid a\in A, b\in B\}$, how can I prove that $\sup(A+B)=\sup A+\sup B$? The batcave, in any version of Batman, is large.  Plus there's the batmobile, which required special construction, plus the batcomputer and numerous other batwidgets.  How did a good sized batcave get built without the land above it being torn up and without requiring a huge construction crew?  And, after the cave was built, how was the batmobile built in secret, without someone involved in it being able to make the connection between the car they built and the one that shows up in the news when Batman is first seen?  (While he's in Gotham, a masked vigilante is news that would end up nation wide.)  There would also be the need for secrecy so vilains can't find out how it is built and what the specs are.  And then there's the continual supply of batwidgets.  Just as with the batmobile, there's the need for these items and how they work to be kept secret.  It'd take several factories to produce all that Batman uses and major construction for any batcave I've seen (which is in movies and on TV).  How is all this done in secret?  (Or is there a trail of bodies?) Getting Started to Xetex for Devangari? Relationship between Partial Harmonic Sum and Logarithm. pgrouting unexpected output Directory-tree listing in Python NullPointerException accessing views in onCreate() Can the rogue repeatedly hide in combat to sneak attack the same enemy? One of my players is a rogue and has been, on his turn, using Cunning Action to hide as a bonus action and immediately afterwards attacking. I have been ruling that this does work to grant him advantage as an unseen attacker as I believe that is the RAW, but it seems a little strange. Is he really, in the span of 6 seconds, ducking behind a corner and popping back out and this completely disorientates his target? I guess I just wanted to make sure I was ruling correctly. Which experiments prove atomic theory?  Sub-atomic theories:   atoms have: nuclei; electrons; protons; and neutrons. That the number of electrons atoms have determines their relationship with other atoms.   That the atom is the smallest elemental unit of matter - that we can't continue to divide atoms into anything smaller and have them retain the characteristics of the parent element. That everything is made of atoms.     These sub-theories might spur more thoughts of individual experiments that prove individual sub-atomic theories (my guess is more was able to be proven after more experiments followed). 32 bit or 64 bit OS on a 512 mb VPS? I am planning to rent a VPS service with following basic specification:   512mb of RAM 1 CPU 20gb HDD (4gb of it is swap) Ubuntu 10.10 server   I am able to choose between a 32 bit or 64 bit install of Ubuntu server as the operating system.   My question is would it be better to chose a 32 bit operating system since I will have only 512mb of RAM, rather than using a 64 bit operating system and dealing with the additional overheads?  edit:  I have installed Ubuntu server 10.10 32 bit and 64 bit on VirtualBox. After a minimalistic installation with only ssh server, the 32 bit installation consumes 63mb of RAM when first boot up and 64 bit consumes 85mb of RAM.  After installing and running  daemon, 32 bit consumes 99mb of RAM when first boot up and 64 bit consumes 128mb. How do I write content to another browser window using Javascript? I've opened a new window with window.open() and I want to use the reference from the window.open() call to then write content to the new window.  I've tried copying HTML from the old window to the new window by using myWindow.document.body.innerHTML = oldWindowDiv.innerHTML; but that's doesn't work.  Any ideas? Gravitational potential at a point in a gravitational field is defined as work done per unit mass in bringing a small test mass from infinity to the point.  I know that:   By integration, we find that gravitation potential is negative. The maximum value of gravitational potential which is at infinity distance is 0, therefore minimum value should be negative.   But, what I do not understand is force is in the same direction as displacement so why work done is not positive? How can I create an executable JAR with dependencies using Maven? Magnetic field lines When I searched the net about magnetic field lines,  told something about contour lines and that magnetic materials placed along a magnetic field has some specific loci, which i did not understand. Can someone explain it to me in details.  Also how do we know that tangent to a magnetic field line gives the direction of magnetic field? I am very confused. \overbrace and \underbrace with square bracket Convergence of $\sum_{n=1}^{\infty}{\sqrt[n]{n}-1 \over n}$ I am trying to conclude about the convergence of $$\sum_{n=1}^{\infty}{\sqrt[n]{n}-1 \over n}$$ If I take ${\sqrt[n]{{\sqrt[n]{n}-1 \over n}}}= {\sqrt[n]{\sqrt[n]{n}-1} \over \sqrt[n]{n}}$ this looks like it converges to $0$ but I am suspicious about the numerator. At the same time, other techniques I know like the ratio test, $n(\sqrt[n]{n}-1)$ and comparisons don't yield meaningful results. Any hints?