I have a computer with two hardrives. One of them has windows 7 installed on it. The other is blank and formated. I was wondering how I can install ubuntu onto the second hardrive but not the first.
I have two hard drives. One is used for Windows and one is empty. I want to install Ubuntu on the empty hard drive. The Windows hard drive is disk0 in Windows and the empty hard drive is disk1. When I install Ubuntu and it asks where I want to install it, I choose "Something Else" but I am stuck there. What do I choose for "boot loader installation"?
Django: How can I protect against concurrent modification of database entries Is it possible to prove $g^{|G|}=e$ in all finite groups without talking about cosets? Why is disk usage greater than the size of all files on it? What is the physical significance of the imaginary part when plane waves are represented as $e^{i(kx-\omega t)}$? I've read that plane wave equations can be represented in various forms, like sine or cosine curves, etc. What is the part of the imaginary unit $i$ when plane waves are represented in the form $$f(x) = Ae^{i (kx - \omega t)},$$ using complex exponentials? Limit bandwidth used by Windows Update I have a Windows 8 (64-bit, not Pro) machine, and I want to limit the Internet bandwidth available to Windows Update. I read about BITS and GPMC methods, but I don't know how to open the BITS window, and GPMC seems like a Windows Server feature.  How can I control how much bandwidth is available to Windows Update and BITS? Sharing Jupyter notebooks within a team I would like to set up a server which could support a data science team in the following way: be a central point for storing, versioning, sharing and possible also executing Jupyter notebooks.  Some desired properties:   Different users can access the server and open and execute notebooks that were stored by them or by other team members. The interesting question here is what would be the behavior if user X executes cells in a notebook authored by user Y. I guess the notebook should NOT be changed: Solution should be self-hosted. Notebooks should be stored either on the server or on Google drive or on self-hosted instance of owncloud. (Bonus) Notebooks will be under git versioning control (git may be self-hosted. Cannot be bounded to GitHub or something of that sort).   I looked into  and . With the former, I didn't understand how to allow cross users access. The latter seems to only support GitHub as the storage of the notebooks.  Do you have experience with either of the solutions? Drawing Roman laurel leaves (SPQR) in TikZ I was trying to get the symbol of the old .  I'm actually interested in the laurel leaves, and not so much in the banner per se.  What I would like to have is something like this (in Tikz, as oppose to simply \includegraphics).  With the possibility to change the stylish A to any other simple roman letter.    I'm a complete newbie with TikZ, and even though I know this question sounds like do this for me, I would really appreciate if someone could at least throw in an sketch where to start. If $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$ Let $a_1,a_2,a_3,\ldots$ be reals. Prove that if $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$.   For this I have shown the case for when $ a_n^{2} \le\frac {|a_n|}{n}$ $\Rightarrow$ $ |a_n|\le\frac {1}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le \frac{1}{n^{2}}$ and we know that $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges and hence $\sum_{n=1}^{\infty}\frac {a_n}{n}$ converges by the comparison test. Now considering $ a_n^{2} \ge\frac {|a_n|}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le a_n^{2}$ $\rightarrow$ combining the two cases for any n we have: $\frac {|a_n|}{n}\le\frac{1}{n^{2}}+a_n^{2}$ Hence using the comparion test again we know that $\sum_{n=1}^{\infty} a_n^{2}$ converges and $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges hence the sum converges so we can conclude that $\sum_{n=1}^{\infty} \frac {a_n}{n}$ is absoluetly convergent $\Rightarrow$ convergent.  Not to sure if this is correct, any help would be much appreciated, many thanks. Got NODATA issue: 'NODATA' (does the network require authentication?) I can use my mobile broadband to access Internet with Firefox but when I want to install any package from terminal or make 'apt-get update' command I got the following error:  got 'NODATA' (does the network require authentication?)   apt-get update output:  Get:1 extras.ubuntu.com trusty InRelease [213 B] 98% [1 InRelease gpgv 213 B] [Connecting to archive.ubuntu.com] Splitting up /var/lib/apt/lists/partial/extras.ubuntu.com_ubuntu_dists_trusty_InRelease into data Ign extras.ubuntu.com trusty InRelease E: GPG error: extras.ubuntu.com trusty InRelease: Clearsigned file isn't valid, got 'NODATA' (does the network require authentication?)    output of `cat /var/lib/apt/lists/partial/extras.ubuntu.com_ubuntu_dists_trusty_InRelease  &lt;!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"&gt; &lt;html&gt; &lt;head&gt; &lt;title&gt;404&lt;/title&gt; &lt;meta http-equiv="Cache-Control" content="no-cache"/&gt; &lt;/head&gt; &lt;body&gt; &lt;p&gt; Not Found &lt;/p&gt; &lt;/body&gt; &lt;/html&gt;   output of wget:  wget -O - http://extras.ubuntu.com/ubuntu/dists/trusty/InRelease  --2014-06-01 09:23:35--  http://extras.ubuntu.com/ubuntu/dists/trusty/InRelease Resolving extras.ubuntu.com (extras.ubuntu.com)... 91.189.92.152 Connecting to extras.ubuntu.com (extras.ubuntu.com)|91.189.92.152|:80... connected. HTTP request sent, awaiting response... 200 OK Length: 213 [text/html] Saving to: ‘STDOUT’   0% [                                       ] 0           --.-K/s              &lt;!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"&gt; &lt;html&gt; &lt;head&gt; &lt;title&gt;404&lt;/title&gt; &lt;meta http-equiv="Cache-Control" content="no-cache"/&gt; &lt;/head&gt; &lt;body&gt; &lt;p&gt; Not Found  &lt;/p&gt; &lt;/body&gt; &lt;/html&gt; What is the "canary thread" and why is it starving? The following occasionally appears in /var/log/syslog:  rtkit-daemon[1145]: The canary thread is apparently starving. Taking action. rtkit-daemon[1145]: Demoting known real-time threads. rtkit-daemon[1145]: Successfully demoted thread 1431 of process 1368 (n/a). rtkit-daemon[1145]: Successfully demoted thread 1430 of process 1368 (n/a). rtkit-daemon[1145]: Successfully demoted thread 1368 of process 1368 (n/a). rtkit-daemon[1145]: Demoted 3 threads.   What's going on here? Satisfying explanation of Aristotle's Wheel Paradox. The paradox:    We have a circle and there is another circle with smaller radius. They are co-centeric.  If circle make full turn without sliding, both smaller and bigger circle make full turn too. If we assume that the passed road is equal to the circumference of circles. We have got smaller circle's radius is equal to bigger one's.  Unsatisfying Solutions I found:    "Do not assume that smaller circle's circumference is equal to passed road since the surface that contacts to the ground is bigger one. " // Okey but it does not explain the paradox, it explains just what is the wrong assumption (even does not explain why it is a wrong assumption.) It is undeniable that every point on both smaller and bigger circle will contact exactly one and only one point on their path. Therefore we can think that this is a bijective maps and smaller circle is isomorphic to bigger one. (Okey but ....)   Question: What is the true answer? What is wrong with the definition of circumference of a circle and relationship with its taken path. This is from  .      Let $\mathcal{A}$ be a locally small category, and let $A,A' \in \mathcal{A}$ with $\operatorname{Hom}(-,A) \cong \operatorname{Hom}(-,A')$. Prove directly that $A \cong A'$.     My thoughts:      Let $\eta$ denote the natural isomoprhism between the two functors.    We have    $$H(A,A) \xrightarrow{ \eta_A} H(A,A')$$   So $\eta_A(id_A): A \rightarrow A'$ is a candidate. Now I want to construct inverse.    $$ H(A',A') \xrightarrow{\eta_{A'}} H(A',A)$$   Then the map $\eta^{-1}_{A'} (id_{A'}):A' \rightarrow A$.    So I'd like to show that the composition is identity. By the naturality condition of $\eta$, from $H_A(A) \rightarrow H_{A'}(A')$ (and similarly on other direction)    $$ \eta_A(id_A) \circ \eta^{-1}_{A'}(id_{A'}) = \eta_{A'}(\eta_{A'}^{-1}(id_{A'}))= id_{A'} $$   We deduce these two maps are inverses. Hence $A' \cong A$.    Is this correct? Or is there a neat way to see this? How to filter a list by hour How does deleting work? What can cause a post to be deleted, and what does that actually mean? What are the criteria for deletion? Copy skype chat history to text files? I'd like to convert my Skype chat history to a collection of text files for archival purposes.  Ideally, I'd like to have a command (e.g. script or app) so that I could do this on a regular basis.  Any one have any idea on how to go about doing this? Following , I would like to know what exactly it means for a tag to be marked as blocked (formerly blacklisted) on a Stack Exchange site.  Does it mean I can't use that tag on my question? What are the reasons for blocking a tag? Who can block tags? Why am I being prompted to remove a tag from a question I'm editing? Control a property with no socket (color ramp swatch, etc) from a Group Node input? Run a program without administrative privileges in Windows 7 My account in Windows 7 is an administrator account. When I open the Run box (WinKey + R), I am warned, "This task will be created with administrative privileges."    Is there any way to run programs as myself, but without administrative privileges when logged in as an administrator? Working with a huge file. Illustrator is super slow. What can I do to ease the load? The size of the file is 168mb and it's nearly impossible to work on the file because every action takes like five minutes or so to complete. The artwork is of a scene filled with characters and I so far outlined the entire thing with a brush and afterwards expanded all the strokes thinking it would help ease the load. However, the file is still way too big. Is there something I can do to make it easier to work on the file?  Edit: I flattened transparency and got it reduced to 33mb. Huge difference, but would like it even smaller if possible. Graph with Cycle and Two-Colorable i think if the graph G has an odd cycle, it's not two-colorable, otherwise it can be two colorable.   i read in one notes that the following is True: we couldent two-colorable any graph G that has cycle.    anyone could clarify me ?