I'm also using Jupyter and Anaconda, will it break/delete them or any python modules?
I'm using Ubuntu 11.10.  The python 2.7.2 provided has a bug that has been corrected in the latest 2.7.2 sources from the python repository.  What is the recommended way to replace the ubuntu provided python with the python from source? Or put another way, how do I "update" the ubuntu-provided one?  Ideally, I would just be able to create new .deb(s) that "update" the python2.7/python2.7-dev provided by Ubuntu.
The Bash command :(){ :|:& };: will spawn processes to kernel death. Can you explain the syntax? I looked at  and can't understand how this works.  This command "exponentially spawns subprocesses until your box locks up".  But why? What I understand less are the colons.  user@host$ :(){ :|:&amp; };: Jordan Canonical Form determined by characteristic and minimal polynomials in dimension $3$, but not beyond Why and how is the  of a matrix in $M_3(\mathbb C)$ fully determined by its characteristic and minimal polynomials? And why does it fail for $n &gt;3$?   Thanks. An easy question on complex Let $\{u_{k}\}_{k=1}^{\infty}$ be a complex number sequence. If $\sum_{k=1}^{\infty}\lambda^{k}u_{k}=0$, for each $\lambda\in \mathbb{D}(0, 1/3)$(where the $\mathbb{D}(0, 1/3)~$denotes an open disc centered at $0$ and radius $1/3$). Then can we conclude $u_{n}=0$, for $n=1, 2, 3...$ ? I have a vector space $V$ over a field of characteristic $0$. If $M_1,\dots,M_k$ are proper subspaces of $V$, and $N$ is a subspace of $V$ such that $N\subseteq M_1\cup\cdots\cup M_k$, how can you tell $N\subseteq M_i$ for some $i$?  I was first trying to show it just in the case $N\subseteq M_1\cup M_2$, and hoping to extend it to finitely many $M_i$. If either of the $M_i$ contains the other, the claim follows, so I suppose neither $M_i$ contains the other.   In hopes of a contradiction, I suppose $N\not\subseteq M_1$ and $N\not\subseteq M_2$, Picking $x_1\in N\setminus M_1$ and $x_2\in N\setminus M_2$, I'd have $x_1+x_2\in N\subseteq M_1\cup M_2$. The only thing I could conclude was that actually $x_1,x_2\notin M_1$ and $x_1,x_2\notin M_2$, which seems like a dead end. What's the right way to do this? induction proof: $\sum_{k=1}^nk^2 = \frac{n(n+1)(2n+1)}{6}$ I encountered the following induction proof on a practice exam for calculus:  $$\sum_{k=1}^nk^2 = \frac{n(n+1)(2n+1)}{6}$$  I have to prove this statement with induction.  Can anyone please help me with this proof? All internal links on Stack Exchange sites should be protocol-relative In preparation for the eventual deployment of full HTTPS support on Stack Exchange, and also to make the currently available "alpha" HTTPS support more usable, all links from Stack Exchange sites to other Stack Exchange sites should be .  Currently, at least the following places still feature links with explicit http: protocol prefixes:   the page footer, the "Hot Network Questions" and "Community Bulletin" modules in the sidebar,  (the site switcher menu is OK, though),   and, of course,   lots and lots of user-supplied links in post and comment content.   I've posted this feature request with the intent to provide a single central place for tracking these issues, rather than having them scattered across multiple meta threads.  If you find more places on SE where protocol-relative links should be used, please report them below.  I fully expect this request, in its full sense, to be treated as  for the time being; however, these issues do need to be fixed at some point before our HTTPS support is ready for "prime time".  Ps. Yes, the next release of  (v1.10) is going to include a general client-side fix for most of these issues.  In the mean time, the  plugin effectively provides the same functionality, and much more besides. Let $f,g:X\to Y$ be maps of spaces such that $f\simeq g$. Is it true that the mapping cones $\operatorname{cone}(f)$ and $\operatorname{cone}(g)$ are homotopy equivalent?  Can we write down an explicit homotopy equivalence? It ought not to be too hard to get a map $\operatorname{cone}(f)\to \operatorname{cone}(g)$ from the existence of a homotopy $H:X\times I\to Y$, but I haven't been able to find a sensible candidate, despite trying for quite a while. How to modify the space between the numbers and text of sectioning titles in the table of contents? I'm preparing a document using the book class. In the table of contents, the space between the subsection number and title is too wide. How to reduce it? A subring of the field of fractions of a PID is a PID as well. Let $A$ be a PID and $R$ a ring such that $A\subset R \subset \operatorname{Frac}(A)$, where $\operatorname{Frac}(A)$ denotes the field of fractions of $A$. How to show $R$ is also a PID?   Any hints? I have an external HDD and I kind of messed up the file permissions but when fixing it I thought it is ok bc with my username I can access the files perfectly fine. Now that I use this with two PC (actually ATM I don't have access to my other PC) I can't access these files.  The problem is this directory has hundreds of folders with no permission for "everyone". I would like to give it the default permissions including have all access for the user "everyone". How do I do that via command line for these hundreds of folders? After I installed Ubuntu 13.04, I can't mount my NTFS partition.  Error mounting /dev/sda5 at /media/mrxfly/xFLyDiskData: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda5" "/media/mrxfly/xFLyDiskData"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/sda5': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option. How to download and use any other kernel than the one which is installed by default Adding space around section title for in-register in KOMA-script context Let $a$, $b$ and $c$ be the three sides of a triangle. Show that $\frac{a}{b+c-a}+\frac{b}{c+a-b} + \frac{c}{a+b-c}\geqslant3$. Like most Python developers, I typically keep a console window open with the Python interpreter running to test commands, dir() stuff, help() stuff, etc.  Like any console, after a while the visible backlog of past commands and prints gets to be cluttered, and sometimes confusing when re-running the same command several times.  I'm wondering if, and how, to clear the Python interpreter console.  I've heard about doing a system call and either calling cls on Windows or clear on Linux, but I was hoping there was something I could command the interpreter itself to do.  Note: I'm running on Windows, so Ctrl+L doesn't work. Is conservation of momentum and energy valid for non-inertial frames? I have a sentence that contains a number of long dataset names. I would like to allow LaTeX to break these names at certain positions that I would like to specify somehow just like I can use \- to allow a word break with hyphenation. But: I would like LaTeX not to insert a dash (which could be mistaken as belonging to the dataset name). How can I do this?   (Something similar is realized in the url package so I guess I could just read that code :) I would not like to use the url package here to be able to make a syntactical (and typographic) difference between urls and datset names.) What rules say that summoning undead is evil, and what rules say why? Proof that $\gcd(ax+by,cx+dy)=\gcd(x,y)$ if $ad-bc= \pm 1$ I'm having problems with an exercise from Apostol's Introduction to Analytic Number Theory.     Given $x$ and $y$, let $m=ax+by$, $n=cx+dy$, where $ad-bc= \pm 1$. Prove that $(m,n)=(x,y)$.   I've tried to give a proof, but I suspect it's wrong (or at least not very good). I would be very thankful for any hints/help/advice!  My proof:     We observe that since $ad-bc= \pm 1$, $ad=bc \pm 1$, and $(ad,bc)=1$.   Now, $(a,b) \mid m$ and $(c,d) \mid n$ but      $$(a,b) = ((d,1)a,(c,1)b)=(ad,a,bc,b)=(ad,bc,a,b)=((ad,bc),a,b)=(1,a,b)=1.$$      Similarly, we determine $(c,d)=1$. So, $1=(a,b) \mid m$ and $1=(c,d) &gt; \mid n$. But $(x,y)$ also divide $m$ and $n$. Since $(x,y) \geq (a,b)=(c,d)=1$, this implies that $(x,y)=m,n$. Hence   $(m,n)=((x,y),(x,y))=(x,y)$. How can gravity affect light?