When trying to upgrade to the PPA version of Nemo, I get the following dpkg error:  $ sudo apt-get dist-upgrade Reading package lists... Done Building dependency tree        Reading state information... Done Calculating upgrade... Done The following NEW packages will be installed:   cinnamon-translations python-requests python-urllib3 The following packages will be upgraded:   nemo nemo-data python-cupshelpers system-config-printer-gnome  Preparing to unpack .../cinnamon-translations_2.4.0-20141104040041-trusty_all.deb ... Unpacking cinnamon-translations (2.4.0-20141104040041-trusty) ... dpkg: error processing archive /var/cache/apt/archives/cinnamon-translations_2.4.0-20141104040041-trusty_all.deb (--unpack):  trying to overwrite '/usr/share/locale/ne/LC_MESSAGES/nemo.mo', which is also in package nemo-data 1.8.4-1.1 dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) Errors were encountered while processing:  /var/cache/apt/archives/cinnamon-translations_2.4.0-20141104040041-trusty_all.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   I have tried the usual suggestions that I have been able to find and have even tried deleting the nemo.mo file, but nothing seems to work. Any ideas as to how to get this sorted? I am using Ubuntu 14.04 with Unity, but have Nemo set as the default default fire manager.
For example:  $ sudo apt-get install curl Reading package lists... Done Building dependency tree Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: bsh : Depends: libjline-java but it is not going to be installed groovy : Depends: libjline-java but it is not going to be installed rhino : Depends: libjline-java but it is not going to be installed E: Unmet dependencies.   Try 'apt-get -f install' with no packages (or specify a solution).   I get the same or similar errors when I attempt to install clojure1.3, leiningen, and several other packages.   When I try the suggestion made in the error message, this is what happens:  $ sudo apt-get -f install  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   diffstat linux-headers-3.2.0-26-generic linux-headers-3.2.0-26 dh-apparmor dkms html2text libmail-sendmail-perl libsys-hostname-long-perl Use 'apt-get autoremove' to remove them. The following extra packages will be installed:   libjline-java Suggested packages:   libjline-java-doc The following NEW packages will be installed:   libjline-java 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. 23 not fully installed or removed. Need to get 0 B/72.0 kB of archives. After this operation, 129 kB of additional disk space will be used. Do you want to continue [Y/n]? Y (Reading database ... 226243 files and directories currently installed.) Unpacking libjline-java (from .../libjline-java_1.0-1_all.deb) ... dpkg: error processing /var/cache/apt/archives/libjline-java_1.0-1_all.deb (--unpack):  trying to overwrite '/usr/share/java/jline.jar', which is also in package scala 2.9.2-400 Errors were encountered while processing:  /var/cache/apt/archives/libjline-java_1.0-1_all.deb E: Sub-process /usr/bin/dpkg returned an error code (1)  $ sudo apt-get upgrade Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these. The following packages have unmet dependencies:  bsh : Depends: libjline-java but it is not installed  groovy : Depends: libjline-java but it is not installed  rhino : Depends: libjline-java but it is not installed E: Unmet dependencies. Try using -f.
I'm working on exercises from Kunen and I'm stuck. I must proof that the following are equivalent:   There exists a sequence $\langle A_\alpha:\alpha&lt;\omega_1\rangle$ such that $\forall\alpha(A_\alpha\subset\alpha)$ and for all $A \subset \omega_1$ the set $\{\alpha \in \omega_1:A\cap\alpha=A_\alpha\}$ is stationary. ($\diamondsuit$-principle) There exists a sequence $\langle A_\alpha:\alpha&lt;\omega_1\rangle$ such that $\forall\alpha(A_\alpha\subset\alpha\times\alpha)$ and for all $A \subset \omega_1\times\omega_1$ the set $\{\alpha \in \omega_1:A\cap\alpha\times\alpha=A_\alpha\}$ is stationary. There exists a sequence $\langle f_\alpha:\alpha&lt;\omega_1\rangle$ such that $\forall\alpha(f_\alpha:\alpha\rightarrow\alpha)$ and for all $f : \omega_1\rightarrow\omega_1$ $\exists\alpha(f|\alpha=f_\alpha\wedge\alpha&gt;0)$ There exists a sequence $\langle f_\alpha:\alpha&lt;\omega_1\rangle$ such that $\forall\alpha(f_\alpha:\alpha\rightarrow\alpha)$ and for all $f : \omega_1\rightarrow\omega_1$ the set $\{\alpha \in \omega_1:f|\alpha=f_\alpha\}$ is stationary.   I have proved that $1\implies 2\implies 4\implies 3$ and that $4\implies 1,$ but I'm having problems on proving that $3\implies$ "something", because it only talks about one $\alpha$. Can someone help me? Prove $n\mid \phi(2^n-1)$ If $2^p-1$ is a prime, (thus $p$ is a prime, too) then $p\mid 2^p-2=\phi(2^p-1).$  But I find $n\mid \phi(2^n-1)$ is always hold, no matter what $n$ is. Such as $4\mid \phi(2^4-1)=8.$  If we denote $a_n=\dfrac{\phi(2^n-1)}{n}$, then $a_n$ is , but how to prove it is always integer?  Thanks in advance! Prove: $\lim\limits_{n \to \infty} \int_{0}^{\sqrt n}(1-\frac{x^2}{n})^ndx=\int_{0}^{\infty} e^{-x^2}dx$ I'd like your help with the following claim to prove:  $$\lim_{n \to \infty} \int_{0}^{\sqrt n}\left(1-\frac{x^2}{n}\right)^ndx=\int_{0}^{\infty} e^{-x^2}dx.$$  I think I should use the claim:     Let $a,b$ two real numbers and $\{f_n\}$ a sequence of continuous functions on $\left[a,b\right]$  which converges uniformly to $f$ on $[a,b]$. Then    $$\lim_{n\to\infty}\int_a^bf_n(t)dt=\int_a^bf(t)dt.$$   But for this, I must prove that $(1-\frac{x^2}{n})^n$ uniformly converges to $e^{-x^2}$.  How do I do that? One of the hardest and trickiest things to do is to prove this uniformly converges.. every function has its own way. I believe that the more examples I'll see the easiest it will be. Thanks again! Basic If/Then in Python Parser of ArcGIS Field Calculator? LWJGL—How to Animate and Render Characters Using a Sprite Sheet I'm making an RPG similar to Super Nintendo RPGs in the early '90s. I'm handling movement much like Squaresoft's Final Fantasy IV.   Notice that the player never actually changes his x and y positions on screen. What I'm asking, to be precise, is how could I, in LWJGL through user input (say, the arrow keys), take the sprite sheet I have of my character's movement animations and render them in a [partially] fluid animation like above?  I've been perusing the internet for hours, and I've not found a surefire way to do this. I don't have any code as of yet; I'm more or less looking for a guideline or some pointers in the right direction concerning how I might tackle this.  And, to note, this'll be a rather large game, so I want to focus partially on speed and efficiency—that meaning that I don't want to dive into Slick2D and libGDX unless absolutely necessary. As I'm relatively new to the electronics world, I was wondering if you can connect multiple  ground terminals (corresponding to several different voltage outputs) to the same ground. Or do they each need their own?  In my case I have 5 lines, one 12V, one 3.3V, two 5V and one variable from a 12V in using a  voltage regulator that already has its own ground. So I'm guessing that each would need its own ground, but it is never bad to ask. Show finite complement topology is, in fact, a topology Figure subfigure layout with different numbers In previous Ubuntus (GNOME, not unity) I could add "--incognito" to the end of the executable file command of Chrome to make Incognito default.  I cannot find an executable file for Chrome in 12.04. How do I make Incognito default for Chrome in 12.04? What's the best way to communicate between view controllers? Being new to objective-c, cocoa, and iPhone dev in general, I have a strong desire to get the most out of the language and the frameworks.  One of the resources I'm using is Stanford's CS193P class notes that they have left on the web.  It includes lecture notes, assignments and sample code, and since the course was given by Apple dev's, I definitely consider it to be "from the horse's mouth".  Class Website:   Lecture 08 is related to an assignment to build a UINavigationController based app that has multiple UIViewControllers pushed onto the UINavigationController stack.  That's how the UINavigationController works.  That's logical.  However, there are some stern warnings in the slide about communicating between your UIViewControllers.  I'm going to quote from this serious of slides:   Page 16/51:     How Not To Share Data         Global Variables or singletons         This includes your application delegate      Direct dependencies make your code less reusable         And more difficult to debug &amp; test         Ok.  I'm down with that.  Don't blindly toss all your methods that will be used for communicating between the viewcontroller into your app delegate and reference the viewcontroller instances in the app delegate methods.  Fair 'nuff.  A bit further on, we get this slide telling us what we should do.  Page 18/51:     Best Practices for Data Flow         Figure out exactly what needs to be communicated   Define input parameters for your view controller   For communicating back up the hierarchy, use loose coupling         Define a generic interface for observers (like delegation)         This slide is then followed by what appears to be a place holder slide where the lecturer then apparently demonstrates the best practices using an example with the UIImagePickerController.  I wish the videos were available! :(  Ok, so... I'm afraid my objc-fu is not so strong.  I'm also a bit confused by the final line in the above quote.  I've been doing my fair share of googling about this and I found what appears to be a decent article talking about the various methods of Observing/Notification techniques:   Method #5 even indicates delegates as an method!  Except.... objects can only set one delegate at a time.  So when I have multiple viewcontroller communication, what am I to do?  Ok, that's the set up gang.  I know I can easily do my communication methods in the app delegate by reference's the multiple viewcontroller instances in my appdelegate but I want to do this sort of thing the right way.  Please help me "do the right thing" by answering the following questions:   When I am trying to push a new viewcontroller on the UINavigationController stack, who should be doing this push.  Which class/file in my code is the correct place? When I want to affect some piece of data (value of an iVar) in one of my UIViewControllers when I am in a different UIViewController, what is the "right" way to do this? Give that we can only have one delegate set at a time in an object, what would the implementation look like for when the lecturer says "Define a generic interface for observers (like delegation)".  A pseudocode example would be awfully helpful here if possible. Group of order $p^2$ is abelian. Yes, I know that there are tons of solutions of this up here, but I, essentially, wanted to try it a different way and ah, well.  Let $|G| = p^2$ for some prime $p$.  Consider $x \in G$. So, $|x| = p, $ or $ p^2$. If it is the latter, then, we are done.  So, if $|x|= p$, then, let, $H = [h|  h=x^i, i \in Z] \Rightarrow |H|= p$.  As $p$ is the smallest prime dividing $|G|$, $H$ is a normal subgroup.  Now, consider some $y \in G$, but not in $H \Rightarrow y^p= e$. Then, its easy to show that $G = \langle x,y \rangle$.  Now, consider a homomorphism $f:G \rightarrow \operatorname{Aut}(H), g \to c_g $, wherein $c_g$ represents conjugacy by $g$. So, for example, $c_g(x) = gx g^{-1}$.  Then, it is clear that, $H \subset \operatorname{Ker}(f) $, as it is cyclic and therefore abelian. So, we need only look at $G/H$.  Basically, I am asking for a hint as to why $c_y(x) = yxy^{-1} = x = c_e(x)$, where $x$ and $y$ are the generators of $H$ and $G/H$, respectively?  Because, if I establish it for the generators, then it follows that it applies for for all elements, i.e, that $\operatorname{Im}(f)$ is trivial and therefore that $G$ is abelian.  Thank You! Stripboard/veroboard/matrix board design software I'm prototyping a simple layout for a small project on matrix board, but figured there must be a better way than drawing it all out on paper. Are there any aimed at matrix board?  I've found the following software for stripboard, but nothing explicitly for matrix board:     Stripboard Magic (seems to be abandonware, but there's page about it )  Stripboard Editor Limited free version, designed to integrate well with     Any more I've missed? Any recommendations? How did Suren Manvelyan create the macro pictures of eyes? I came across some really cool  today. How did he manage to get these photos? I couldn't find any EXIF information anywhere, and I don't have enough experience with macro to figure out how he did it.  It's obvious that the light has a lot to do with the result. How and what kind have been used? And what kind of camera equipment? What is the proof that given a set of $n$ elements there are $2^n$ possible subsets (including the empty-set and the original set). Sum of two squares modulo p First, my apologies if this has already been asked/answered.  I wasn't able to find this question via search.  My question comes from Rudin's "Principles of Mathematical Analysis," or "Baby Rudin," Ch 1, Example 1.1 on p. 2.  In the second version of the proof, showing that sets A and B do not have greatest or lowest elements respectively, he presents a seemingly arbitrary assignment of a number $q$ that satisfies equations (3) and (4), plus other conditions needed to show that $q$ is the right number for the proof.  As an exercise, I tried to derive his choice of $q$ so that I may learn more about the problem.  If we write equations (3) as $q = p - (p^2 - 2)x$, we can write (4) as   $$ q^2 - 2 = (p^2 - 2)[1 - 2px + (p^2 - 2)x^2]. $$  Here, we need a rational $x &gt; 0$, chosen such that the expression in $[...]$ is positive.  Using the quadratic formula and the sign of $(p^2 - 2)$, it can be shown that we need   $$ x \in \left(0, \frac{1}{p + \sqrt{2}}\right) \mbox{ for } p \in A, $$  or, for $p \in B$, $x &lt; 1/\left(p + \sqrt{2}\right)$ or $x &gt; 1/\left(p - \sqrt{2}\right)$.  Notice that there are MANY solutions to these equations! The easiest to see, perhaps, is letting $x = 1/(p + n)$ for $n \geq 2$.  Notice that Rudin chooses $n = 2$ for his answer, but it checks out easily for other $n$.  The Question:  Why does Rudin choose $x = 1/(p + 2)$ specifically?  Is it just to make the expressions work out clearly algebraically?  Why doesn't he comment on his particular choice or the nature of the set of solutions that will work for the proof?  Is there a simpler derivation for the number $q$ that I am missing? How to fix Terminal error DYLD_ environment variables being ignored because main executable (/usr/bin/login) is setuid or setgid? Bypass BIOS password set by faulty Toshiba firmware on Satellite A55-S1065 laptop? If statement evaluating true no matter what. Python 3.3.0 Why might one also use a blank constructor? I was reading some Java recently and came across something (an idiom?) new to me: in the program, classes with multiple constructors would also always include a blank constructor. For example:   public class Genotype {   private boolean bits[];   private int rating;   private int length;   private Random random;    public Genotype() {              //  &lt;= THIS is the bandit, this one right here     random = new Random();   }    /* creates a Random genetoype */   public Genotype(int length, Random r) {     random = r;     this.length = length;     bits = new boolean[length];      for(int i=0;i&lt;length;i++) {         bits[i] =random.nextBoolean();     }   }    /* copy constructor */   public Genotype(Genotype g,Random r) {     random = r;     bits = new boolean[g.length];     rating = g.rating;     length = g.length;      for(int i=0;i&lt;length;i++) {         bits[i] = g.bits[i];     }    } }   The first constructor doesn't seem to be a "real" constructor, it seems as though in every case one of the other constructors will be used. So why is that constructor defined at all?