I'm bought a laptop with the following configuration:  240 GB SSD for Windows 10 1 TB HDD  I have some important programs and documents on the HDD and I don´t want to loose them. I have reserved 50 GB of space to install Ubuntu 16.04 LTS on the seccondary HDD.  . I would like to install ubuntu in the 50 GB partition in HDD 1 and leave the SSD in its current state. How would I do it?  Edit:  I'm not just trying to install Ubuntu 16.04 LTS on a separate HDD, it must be on a partition of that HDD
Im not familiar with Ubuntu or Linux in general but have succesfully installed dual-boot windows7/Ubuntu on a single harddisk on my private PC. I used the "Install Ubuntu alongside them"-option.   On my work PC I have an existing windows 7 64-bit installation that boots from BIOS firmware on a SSD drive (C:), and have my working data (documents etc) on a partition on a separate disk (D:). I now want to install Ubuntu (v 14.04.3) on the remaining unformatted space on D:\ using with the option of choosing system using GRUB. There are of cause fine descriptions around (e.g.  and ). My question is how to setup the partitions in the "something else"- option during the Ubuntu installation.   In  tutorial they assume that all partitions on the D-drive can be deleted; however I only obviously want to keep the working data on the existing D-partition, and place Ubuntu on the residual space (or part of it) on the D:-drive.  A) How is this ensured ? B) how many partitions should I make (boot, root, home, swap ?)  C) and should boot be made primary, and the others logical ? D) Should I set Device for boot loader installation as/dev/sdb - will this not erase the existing D-partion ?
How can I change xfce bottom panel to the top? I am using Xubuntu 12.10 and would like to change the panel which is currently on the bootm to the top.  This is the opposite of what most people using Unity want to do.    I have done this in the past but have forgotten how and could not find the info easily this time. Cheers, This is from Fraleigh's First Course in Abstract Algebra (page 82, Theorem 8.16) and I keep having hard time understanding its proof. I understand only until they mention the map $\lambda_x (g) = xg$. Can someone explain this proof step by step? Thank you so much! Here is the proof:  Let $G$ be a group. We show that $G$ is isomorphic to a subgroup of $S_G$. Define a one-to-one function $\phi: G \to S_G$ such that $\phi(xy)=\phi(x) \phi(y)$ for all $x,y \in G$. For $x \in G$, let $\lambda_x: G \to G$ be defined by $\lambda_x (g) = xg$ for all $g \in G$. The equation $\lambda_x (x^{-1} c) = x(x^{-1} c) = c$ for all $c \in G$ shows that $\lambda_x$ maps $G$ onto $G$. If $\lambda_x (a) = \lambda_x (b)$, then $xa=xb$ so $a=b$ by cancellation. Thus $\lambda_x$ is also one to one, and is a permutation of $G$. We now define $\phi: G \to S_G$ by defining $\phi(x) = \lambda_x$ for all $x \in G$. To show that $\phi$ is one to one, suppose that $\phi(x) = \phi(y)$. Then $\lambda_x = \lambda_y$ as functions mapping $G$ into $G$. In particular $\lambda_x (e) = \lambda_y (e)$, so $xe=ye$ and $x=y$. Thus $\phi$ is one to one. It only remains to show that $\phi(xy) = \phi(x) \phi(y)$, that is, that $\phi_{xy} = \lambda_x \lambda_y$. Now for any $g \in G$, we have $\lambda_{xy} (g) = (xy)g$. Permutation multiplication is function composition, so $(\lambda_x \lambda_y)(g) = \lambda_x (\lambda_y (g)) = \lambda_x (yg) = x(yg)$. Thus by associativity, $\lambda_{xy} = \lambda_x \lambda_y$. "approach to address" or "approach to addressing"? Depending on our point of view, we offer different approaches to address(ing?) a same issue.   Should I use &mdash;ing in this context, and if yes, why? Sum of closed spaces is not closed I have a quick question about the refraction of light, and I'm sorry if it seems a bit simplistic or even stupid, but I'm still learning.  We know that when light passes through a denser medium, it slows down. However, is there a limit to that slowing down? If no, wouldn't it be possible, with some type of medium we make ourselves (like a crystal), to decrease the light's speed down to a point where we would be able to "see the photons moving forwards"?  I know it is way more complicated than that and that you can't see light unless some other light bounces off it, what I mean is slowing down light to an extreme and unusual speed). That sounds completely absurd but I can't seem to find what is wrong. Can anyone can explain it to me? :) What are suitable TV sizes and viewing distances for couch surfing on a 1080p LCD HDTV? How variance is defined? The variance of a random variable $X$ is defined as $E[(x-\mu )^2]$. Why can't it be defined as $E[|x-\mu |]$. i.e., What is the basic idea behind this definition. Thank you. When I'm watching a film in Mythtv the screen turns to black every 10 - 15 mins and I have to log back into Ubuntu. Very annoying!  How do I disable the black screen / screensaver / logout in Unity?  There no longer seems to be any options to turn the screen saver off as there were in Ubuntu prior to Unity. "In back of'' vs. "back of" vs. the spatial sense of "behind" in AmE Give each site a parallel site for polling, recommendations and subjective-ish stuff I want to test in a script whether a hostname resolves to something other than 127.0.0.1 as a pre-flight test for an install script. The tools I know (dig, nslookup) specifically query DNS. In my situation a correct entry in /etc/hosts is a valid configuration. So the question is:  Is there a dig-like tool, ideally already on the system, that does the full name-resolution process via nsswitch.conf, like (for example) ping does?  dig my-test-server-that-only-exists-in-etc-hosts    returns NXDOMAIN. How can I determine if it is possible to check luggage during a layover? A common desire among some travelers with long layovers is to leave the airport for a while, and perhaps do some shopping, or even buy goods in the airport.  But this then often necessitates the ability to check additional luggage during the layover, for the remainder of the journey.  There might be other reasons to want to check luggage mid-journey as well.  Are there any general rules one can use to determine whether this is an option in a given airport when traveling with a given airline, and the associated costs (when it is possible)? Find the last two digits of $9^{{9}^{9}}$ I have to find the last two decimal digits of the number $9^{{9}^{9}}$.  That's what I did:  $$m=100 , \phi(m)=40, a=9$$ $$(100,9)=1, \text{ so from Euler's theorem,we have :} 9^{40} \equiv 1 \pmod{100}$$  $$9^{{9}^{9}} \equiv 9^{9^{2+2+2+2+1}} \equiv 9^{9^2 \cdot 9^2 \cdot 9^2 \cdot 9^2 \cdot 9} \equiv 9^{81 \cdot 81 \cdot 81 \cdot 81 \cdot 9} \equiv 9^{(40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot 9} \equiv (9^{(40+40+1)})^{(40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot 9} \equiv 9^9 \equiv 9^4 \cdot 9^4 \cdot 9 \equiv 6561 \cdot 6561 \cdot 9 \equiv 3721 \cdot 9 \\ \equiv 21 \cdot 9 \equiv 89 \pmod{100}$$  So,the last two digits are $8 \text{ and } 9$. $$$$But,is there also an other way two calculate the last two digits of $9^{{9}^{9}}$ or is the above the only one? How many irreducible polynomials of degree $n$ exist over $\mathbb{F}_p$? I know that for every $n\in\mathbb{N}$, $n\ge 1$, there exists $p(x)\in\mathbb{F}_p[x]$ s.t. $\deg p(x)=n$ and $p(x)$ is irreducible over $\mathbb{F}_p$.     I am interested in counting how many such $p(x)$ there exist (that is, given $n\in\mathbb{N}$, $n\ge 1$, how many irreducible polynomials of degree $n$ exist over $\mathbb{F}_p$).   I don't have a counting strategy and I don't expect a closed formula, but maybe we can find something like "there exist $X$ irreducible polynomials of degree $n$ where $X$ is the number of...".  What are your thoughts ? remove files when name does NOT contain some words Buy a second seat in order to bring an extra bag? How do you choose Spells Known when creating a new character above 1st level? It's not clear to me how to choose Spells Known when creating a new character at a higher level.  Let's take the Bard as a working example first:  Bard level 2:   Spells Known: 5 Slots per Spell level: 1st &times; 3   Bard level 3:   Spells Known: 6 Slots per Spell level: 1st &times; 4, 2nd &times; 2   I'm interpreting this to mean that, if an existing 2nd-level Bard gains a new level (level 3), he's gaining 1 (one) new spell known. He can then choose the new spell known to be either 1st or 2nd, correct?  What I don't understand then, is the case of creating a new character starting at a higher level; say, creating a new Bard at level 3.  In that case you're forced to choose 6 spells, which must be from the list of 1st- and 2nd-level spells, correct?  When making this 3rd-level Bard from scratch, though, can I select 2nd level spells for all 6 spells known?  As another example, say you're creating a very high level Bard from scratch, starting at level 15. The book says your Spells Known is 19, and your spell slots are 1st × 4, 2nd × 3, 3rd × 3, 4th × 3, 5th × 2, 6th × 1, 7th × 1, and 8th × 1.  So, for those 19 Spells Known, you can choose any spells from 1st through 8th spell level. Am I free then to select as many spells as I can at 8th spell level (5 in number), working backwards, and in the end ignoring the 1st, 2nd, 3rd level spells entirely?  As another example, the Ranger doesn't know any spells at 1st level, nor have any spell slots, but the book says “You know two 1st-level spells of your choice from the ranger spell list.” Does it mean at 2nd level and above?  Long story short: When choosing Spells Known for a spellcasting character created above 1st level, am I allowed to choose my Spells Known at whatever spell level I like, just so long as I have at least one spell slot of that level?  I'm working on a D&amp;D 5e character generator and need to clarify this. Where do I find the client id and client secret of an existing connected app? Remove association with blank file extension? How to resume baking fluid simulation? It happens sometimes that after finishing bake (e.g., for fluid simulation) we wish we could continue the simulation for two more seconds :(    How to use the cached bake to continue the simulation?  We played with the settings, but with no success.