The app is installed and functional but I wanna uninstall it. I've tried through the command line but I get the error message saying "notepad-plus plus" not installed.
How to completely remove Notepad++ in Ubuntu 18.04 terminal?  I can't find it in Synaptic package manager, and don't know where is on system, but I can see an icon in Activity. It is probably not completely installed, because I can't open it.
C# getting its own class name Which facility upgrade unlocks maneuver nodes in KSP Which  unlocks  in career mode in KSP?  The  hints that maneuver nodes are now unlocked with a facility upgrade:     Are there any perks for upgrading?      The building in question   will upgrade visually, both from the outside and the inside. More   gameplay mechanics will be also be unlocked as the player progresses   through the different building tiers. For example, allowing EVAs in   space or being able to use maneuver nodes in the map view. I have 3 old computers lying around right now running a P2 at 800 MHz(?), Intel Mobile 1.6 GHz, AMD Athlon XP 2000+ at 1.66 GHz, and (might not use this) P4 at 2.7 GHz, all with 512 MB Ram, and am considering clustering them together for fun/knowledge. They would be running an undecided version of linux, preferably ubuntu based.   The issue is what I want to use it for: general computing and occasional video encoding. By general computing I mean day to day tasks. However I'm not sure if every program started by a single X session is going to exist on the same machine, defeating the purpose of such a system. Will programs be split up or exist on one machine?  Second, assuming this is running 100baseT ethernet (not sure if the PCI slot itself could handle Gigabit), would the speed of having a program exist over the network be an issue? It seems that the constant asking of various things in RAM would be quite slow.  And before you say "buy another computer!", that's not the point of this question. I'm asking would it be usable, not necessarily practical. And yes I know, this is going to be extreamly power consuming. What does it mean if a professor does not answer your email in time? I recently joined a research group as a postdoc. I wrote the professor an email to ask quick but important questions including asking him when when he wanted me to start. It's been over a week and I haven't received get an answer. Other emails I've sent previously have also gone unanswered for long periods as well.   With that background, my question is: do professors sometimes (intentionally or otherwise) not respond to emails in a timely manner? Assume that $Y_0,\ldots , Y_n$ are independent random variables with the following identical distribution: $Y_i=1$ with propability $p$ and $Y_i=0$ with propability $1-p$. Also set $S_0=0$ and $S_n=Y_0+\ldots + Y_n$.  It's quite trivial that $(Y_n)_{n\geq 0}$ is a Markov chain, and I managed to show that $(X_n)=(S_n)_{n\geq 0}$ is also a Markov chain, by showing that  $\mathbb{P}(X_{n+1}=i_{n+1}\,|\,X_0=i_0,\ldots,X_n=i_n)=\mathbb{P}(X_{n+1}-X_n=i_{n+1}-X_n\,|\,X_0=i_0,\ldots,X_n=i_n)=\mathbb{P}(Y_{n+1}=i_{n+1}-X_n\,|\,X_0=i_0,\ldots,X_n=i_n)=\mathbb{P}(Y_{n+1}=i_{n+1}-i_n)=\mathbb{P}(Y_{n+1}+i_n=i_{n+1})=\mathbb{P}(X_{n+1}=i_{n+1}\,|\,X_n=i_n)$  However I am now running into the problem that I have to find whether or not $(X_n)=(S_0+\ldots + S_n)_{n\geq 0}$ is a Markov chain. I suspect that it isn't, but i'm having trouble finding a counterexample. I also need to find if $(X_n)=(S_n, S_0+\ldots+S_n)$ is a Markov chain, but I think this actually might be one, since $X_n$ gives "more information" (so to speak) to $X_(n+1)$. Again, having trouble actually proving that.  I appreciate any help, tips etc you can give me. Did Darth Sidious and Vader ever discover how to cheat death? In Episode 3 Revenge of the Sith Palpatine/Sidious strings Anakin along to the dark side with the promise that together the two of them will be able to re-discover Darth Plagueis' secret to cheating death.      "To cheat death is a power only one has achieved, but if we work together, I know we can discover the secret."   From the end of Revenge of the Sith to their deaths in Return of the Jedi did Darth Sidious and Darth Vader ever manage to re-discover this secret? Effect of linear terms on a QFT I was told when first learning QFT that linear terms in the Lagrangian are harmless and we can essentially just ignore them. However, I've recently seen in the linear sigma model, \begin{equation}  {\cal L} = \frac{1}{2} \partial _\mu \phi _i \partial ^\mu \phi _i - \frac{m ^2 }{2} \phi _i \phi _i  - \frac{ \lambda }{ 4} ( \phi _i \phi _i ) ^2  \end{equation}  with $m ^2 =-\mu^2 &gt; 0$, adding a linear term in one of the fields $\phi_N$, does change the final results as you no longer have Goldstone bosons (since the $O(N)$ symmetry is broken to begin with).   Are there any other effects of linear terms that we should keep in mind or is this the only exception of the "forget about linear terms" rule? Can bosons that are composed of several fermions occupy the same state? It is generally assumed that there is no limit on how many bosons are allowed to occupy the same quantum mechanical state. However, almost every boson encountered in every-day physics is not a fundamental particle (with the photon being the most prominent exception). They are instead composed of a number of fermions, which can not occupy the same state.  Is it possible for more than one of these composite bosons to be in the same state even though their constituents are not allowed to be in the same state? If the answer is "yes", how does this not contradict the more fundamental viewpoint considering fermions? Determine the following limit as x approaches 0: $\frac{\ln(1+x)}x$ $$\lim_{x\to 0} \frac{\ln(1+x)}x$$  The process I  want to take to solving this is by using the definition of the limit, but I am getting confused. ( without l'hopitals rule)   $$\lim_{h \to 0} \frac{f(x+h) - f(x)}h$$  $$\lim_{h \to 0} \frac{\frac{\ln (1+x+h)}{x+h} - \frac{\ln(1+x)}x}h$$  $$\lim_{h \to 0} \frac{x\ln(1+x+h) - (x+h)\ln (1+x)}{hx(x+h))}$$  At this point I get confused because I know the answer is $1$, but I am not getting this answer through simplification of my formula. Profile tab hyperlink should match name change What should be done when no more Pokemon can be caught? (when full storage) It seems that I can buy 50 more slots using 200 coins, but what if I keep on getting more and more common Pokemons such as Pidgey or Rattata, then the slots will be full again.  Right now, I am sorting by CP (Combat Power) and then "Transfer" the lowest CP Pokemons to the Professor (to give it away), but wonder what is a good or better way to handle this?  (For example, can I combine several Pidgey into one?) If $a_n$ goes to zero, can we find signs $s_n$ such that $\sum s_n a_n$ converges? Let $a_n$ be a sequence of complex numbers that converge to zero. Can we always find $s_n \in \{-1,1\}$ such that $\sum_{n=1}^{\infty} s_n a_n$ converges?  If the $a_n$ are real numbers, we can find such a sequence $s_n$. If the partial sum of the first $N$ terms is positive we make sure the following terms are negative until the sum becomes less than zero. Then we switch to making the terms positive until the partial sum becomes greater than zero, and so on. It is easy to see that the partial sums will either tend monotonically towards zero, or oscillate around zero with decreasing amplitude.   Edit: Actually there is no reason that the partials sums should go to zero in the monotone case. They will still converge however. Image of the union is the union of the images $$ f\left(\bigcup\limits_{\lambda \in \wedge} A_{\lambda}\right) = \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$$  Let $b \in f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda})$ $\rightarrow b=f(a)$ for some $a \in (\bigcup\limits_{\lambda \in \wedge} A_{\lambda})$.  Since $a \in (\bigcup\limits_{\lambda \in \wedge} A_{\lambda}) \rightarrow a \in A_{\lambda}$ for some $\lambda \in \wedge$.  Since $b=f(a)$, then $b \in f(A_{\lambda})$ for some $\lambda \in \wedge$.  $\rightarrow b \in \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$ $\rightarrow f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda}) \subset \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$.  I used a similar argument to prove $\bigcup\limits_{\lambda \in \wedge} f(A_\lambda) \subset f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda})$.  Which shows $ f(\bigcup\limits_{\lambda \in \wedge} A_{\lambda}) = \bigcup\limits_{\lambda \in \wedge} f(A_\lambda)$.  Please let me know if this is valid. How does the Doctor know how old he is? I've often wondered, how does the Doctor know how old he is? He not only travels through time, but also through space, and visits planets where days can be shorter or longer than 24 hours. How does he 'keep score'?  Also, does he count his age in Earth years or Gallifrey years? They might be completely different in length. Determine the number of lines within a text file Is there an easy way to programmatically determine the number of lines within a text file? Map display not filling window in QGIS on Mac? In this screenshot of QGIS, you can see that the map is not filling the window. I have tried resizing the window in various ways.   Am I missing something obvious, or is this a bug?  Versions:   MacBook Pro MacOS High Sierra 10.13.5 QGIS version 3.2.1-Bonn QGIS code branch Release 3.2 Compiled against Qt 5.9.6 Running against Qt 5.9.6 Compiled against GDAL/OGR 2.2.4 Running against GDAL/OGR 2.2.4 Compiled against GEOS 3.6.2-CAPI-1.10.2 Running against GEOS 3.6.2-CAPI-1.10.2 4d2925d6 PostgreSQL Client Version 9.6.6 SpatiaLite Version 4.4.0-RC0 QWT Version 6.1.3 QScintilla2 Version 2.10.7 PROJ.4 Version 493 Python 3.6.6 If $p$ is a prime and $p \mid ab$, then $p \mid a$ or $p \mid b$. The proof is already given in the textbook but I tried other way around.   Proof by contradiction: Let's assume that $p$ doesn't divide $a$ and $p$ doesn't divide $b$, but $p$ divides $ab$. So $\gcd(p,a)=1$ and $\gcd(p,b)=1$. Given that we can construct linear combinations   $sp+ta=1$ together with $up+wb=1$. Multiplying the left and the right sides of the equations we get  $spup+spwb+taup+tawb=1$ or $p(sup+swb+tau)+ab(tw)=1 \implies \gcd(p,ab)=1$. This is a contradiction.   Is it rigorous and sound proof? Why can't I change the permissions of files I have access to? Is it possible to raise stats? Sensitivity to initial conditions and topological transitivity Forgive the possibly naive question, but I'm returning to a basic undergrad-level study of chaotic dynamical systems and can't quite seem to reconcile the notion that in order for a dynamical system to be considered chaotic, it must have positive global Lyapunov exponents. Such exponents, of course, drive the divergence of trajectories. However, topological transitivity implies that trajectories can get arbitrarily close as well over some finite time. It seems that positive Lyapunov exponents would disallow this mixing. Is there a point at which these positive exponents no longer describe the system, and the mixing behavior begins?