I am using a notebook without a CD burner and want to install Ubuntu. I could use an USB stick as an installation medium but I would like to do something different:   I would like to use my old PC and put the HDD from the laptop into it. Than make this HDD as a installation medium using a Ubuntu DVD (the old PC has a CD burner). In the next step I would like to put the prepared HDD into the laptop and install Ubuntu on the same HDD (from the same HDD). Is something like this possible?
I know that I can create/burn bootable CD/DVD or live USB and can boot/install from it. But suppose I am currently running GNU/Linux and I've ISO file of another GNU/Linux that I want to install on my hard disk, then Can I directly boot from ISO from hard disk and try/install that GNU/Linux operating system?
Meaning of "stackexchange" What does stackexchange mean? I have checked out this  to read about the Stack Exchange Network. How to I stop a launchd script from running on wake I have a simple launchd script that plays a sound every 30 minutes and it runs out of the user library ~/Library . It doesn't run if my machine is asleep, but does run the last event missed when the machine wakes. I think this is the expected behavior. My question is, how do I stop this happening. If I missed the half-hour event, I don't want it to be run at 20 minutes past the hour.  Here's the core of my script. It calls a Python script. I tried to put a block in the python script to check that I am within a few minutes of each 30 minutes, but that doesn't seem to work on wake. (Is it missing the system clock somehow?)  &lt;key&gt;ProgramArguments&lt;/key&gt; &lt;array&gt;     &lt;string&gt;/usr/local/bin/python3&lt;/string&gt;     &lt;string&gt;/Users/pheon/Documents/playsound.py&lt;/string&gt; &lt;/array&gt;  &lt;key&gt;StartCalendarInterval&lt;/key&gt; &lt;array&gt;     &lt;dict&gt;         &lt;key&gt;Minute&lt;/key&gt;         &lt;integer&gt;0&lt;/integer&gt;     &lt;dict&gt;         &lt;key&gt;Minute&lt;/key&gt;         &lt;integer&gt;30&lt;/integer&gt;     &lt;/dict&gt; &lt;/array&gt;   Here is a snippet from the python code which checks the time before playing the sound.  time0 = datetime.datetime.now() if (time0.minute % 30) &lt; 2:     subprocess.run(["/Users/pheon/bin/afplay-vol.sh", "1", bell],check=True) Let $I = \{a +ib \in \Bbb Z[i] : a$ and $b$ are both multiple of $5\}$. Let $I = \{a +ib \in \Bbb Z[i] : a$ and $b$ are both multiple of $5\}$. Show that $I$ is an ideal of $\Bbb Z[i]$. Is $I$ a maximal ideal? And to find the numbers of elements of the quotient ring $\Bbb Z[i]/ I$.  I have shown that $I$ is an ideal of $\Bbb Z[i]$. But how to verify that $I$ a maximal ideal or not?   And to find the numbers of elements of the quotient ring $\Bbb Z[i]/ I$.   Is there any general way to verify when  $I = \{a +ib \in \Bbb Z[i] : a$ and $b$ are both multiple of $n\}$ will be maximal or not? How can I narrow down these gaps? I am writing my curriculum vitae, but I have one question.  In the first image, there are spaces between different sections.  (Between contact and phone, between education and Seoul~~,....)  Thus, I want to narrow down these gaps.  How can I solve this problem??  \documentclass[margin,line,letterpaper,11pt]{res}  \usepackage{times}  \usepackage{enumitem}   \setlength{\topmargin}{0.1in} \setlength{\textheight}{11in}  \setlength{\textwidth}{6in} \setlength{\oddsidemargin}{-.55in}  \setlength{\evensidemargin}{-.55in}  \oddsidemargin -.25in \evensidemargin -.49in \textwidth=5.4in  \newcommand{\ts}{\textsuperscript}  \newcommand{\block}[1]{     \vspace{.1in} \section{\sc #1} }  \newcommand{\subblock}[1]{     \vspace{-.2in}\subsection*{#1} }  \newenvironment{enum}{     \begin{enumerate}[leftmargin=5mm]     \setlength{\itemsep}{1mm} }{     \end{enumerate} }   \begin{document}   \name{\sc \LARGE  }   \begin{resume}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \block{Contact} Phone:  \\ Email:  \\\vspace*{-6mm} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \block{Education}  University : \\  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \block{Other\\ Activities}  Club : \\   %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \end{resume} \end{document} Why only light nuclei are able to undergo nuclear fusion not heavy nuclei? Is it because of the binding energy or the binding energy per nuclei .  I am having trouble with this whole binding energy and nuclear fusion concept. I edited my mesh changing the number of vertices after adding shapekeys, and it get totally messed up when the shapekeys are on. Is there a way to solve this problem without remake the shapekeys all again!? Prove QM-AM inequality $$\dfrac{x_1^2+ x_2^2 + \cdots + x_n^2}n \geq \left(\dfrac{x_1+x_2+\cdots+x_n}n\right)^2$$   I don't think AM, GM can be used here. And simple expansion doesn't help too. What should I do? Let $\{a_n\}$ be defined as follows: $$a_1 = 2, a_{n+1}=\dfrac{1}{3-a_n}$$ $n \geq 1$.   Does $\{a_n\}$  converge?    Using the monotone convergence thereom, if the sequence is both bounded below and decreasing, $\forall n\in\mathbb{N}, n\geq 1$, then we can say the sequence converges.  I'm having trouble proving that the sequence is bounded below by induction.    Claim: The sequence is bounded below by $0$.  Base Case:  $n=1$  $a_1 = 2 \geq 0$, so this holds.  Induction Step  Suppose that $a_k \geq 0$, for some $k \in\mathbb{N}$. (IH)  Prove $a_k \geq 0\to a_{k+1} \geq 0$  I have some difficulty here.  $a_{k}=\dfrac{1}{3-a_{k-1}} \geq 0$  $a_{k+1}=\dfrac{1}{3-a_{k}}$, but we know $a_k \geq 0$, but we don't know how much bigger. It could be that $a_k = 4$, and then I have $a_{k+1}=\dfrac{1}{3-4}$, which is negative, and does not confirm with my claim of being bounded below by $0$. Have I gone somewhere wrong in my induction? 19MB/s Net Speed but Only 2MB/s Usable Hi so i just got internet a about a month ago and my net speed is 19MB/s, I have tested it on loads of sites they all say the same thing(19MB/s), but it wont use more than around 2MB/s i have tried downloading different ways, and with more than 1 download at a time and I still get capped at about 2MB/s. It affects everything like loading websites and playing games as well. So if I'm downloading (max 2MB/s) and I load up a web page, every thing slows down, the download speed slows and web sites take for ever to load up, what can it be that makes it thus, and speed test say's 19MB/s $\mbox{rank}(A)=1$ implies $\det(A+I)=\mbox{trace}(A)+1$ This problem comes from exercise from my lecturer  Let $A$ be a square matrix such that $\mbox{rank}(A)=1$. Prove that $\det(A+I)=\mbox{trace}(A)+1$.  ($I$ is the identy matrix)  I usually haven't any idea in solving linear algebra problem. Solving a implicit, recursive function Assuming $F(0,0)=0$, can I solve $F(F(x,y),y)=0$ for $y=f(x)$ near $(0,0).$ How to customize MacBooks' keyboard? I spilled a juice on my MacBook-Pro keyboard. Consequently, some keys like 2, esc and tab don't work anymore on my keyboard.   Is there anyway to change those disabled keys with combination of some other keys, like Fn,Ctrl, Option+ something, using an app or a command? Edit Mode buttons for selecting vertices and edges vanished When I am in Edit Mode for my project, the Mesh Select Mode buttons have disappeared!  I loaded the default project and the buttons are where they are supposed to be; the issue is only in my project. Born's Rule, What is the Reason? Mile or miles? Singular or plural? Could you explain me please, why sometimes the word "mile" is used in singular, sometimes in plural, while in both cases it refers to several and not 1 mile.  Example:     They took part in a 26 mile long swimming race.   After 12 miles he got tired.   Thanks in advance to those who can enlighten me! What's the canonical way to check for type in Python? Trouble with proving $A$ is an integrally closed domain $\Rightarrow$ $A[t]$ is integrally closed domain Proof by induction of summation inequality: $1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\dots+\frac1{2^n}\ge 1+\frac{n}2$ Proving $|P(A\cap B)-P(A)P(B)|\leq \frac{1}4$ Let $A$ and $B$ be two events of a probability space. Prove that  $\displaystyle|P(A\cap B)-P(A)P(B)|\leq \frac{1}4$   I think it's a very challenging problem, and I've made no progress so far ...  Can someone give me a hint ? Does the 14 day self-isolation period in the UK end if a travel-corridor starts during the 14-day self-isolation period?