I'm want to install Ubuntu on my computer, but I have some doubts about the installation process.  So I have a 256 GB SSD and a 2 TB HDD. I currently use Windows 10 as my primary OS and it's installed on my SSD in partition C: (it's important to note that my SSD has 3 partitions: a system backup partition, EFI system partition and C: )  Now, I'm forced to install Ubuntu on my HDD (it only has one partition: E:) because my SSD is almost full. Nevertheless, I can create a new partition on my HDD for installing Ubuntu   Is it possible to install Ubuntu on my HDD, which is partitioned as NTFS, and dual boot when I turn on my PC? If so, what's the correct installation process in order to do so?  I'm pretty new to Ubuntu and I would like to learn more  Thank you in advance
I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?
Should we add more badges for asking questions? This proposal was superseded , which improves on the core concept.   Early on, there was a question about whether Stack Overflow should . At the time,  was:  Getting answers is reward enough for asking questions.  Even then, Stack Overflow was getting more than enough questions, so it didn't make much sense to incentivize more questions.  lists the badges that can be earned by asking quality questions. (There are at least 8). But looking at the list of recent , it looks more like a list of . These badges are difficult to come by in the first place, and they're much harder to earn on sites like  even though there are some  on that site. It turns out that . We , but we still need plenty of oysters. The Student bronze badge is awarded for the first upvoted1 question. There are no equivalent gold or silver badges. Therefore, I'd like to propose the following:  Student—Asked first question with score of 1 or more Sophomore—Asked 10 questions with score of 1 or more Socrates—Asked 50 questions with score of 1 or more  Do you have any suggestions of better names/levels?  To give you an idea of how many of these badges would be awarded, I wrote . The results2 for the original trilogy: users   gold silver bronze none    Site Name  ------- ---- ------ ------ ------- ---------  3000344 7127 67713  805778 2194566 Stack Overflow 235053  115  1698   53073  181980  Super User 156773  53   1191   40063  116710  Server Fault  The gold version on SO would be slightly more rare than  and more common than . Obviously, there would be fewer badges for smaller sites: 5545    1    18     917    4628    Philosophy 4032    4    41     802    3230    History  5663    3    28     917    4746    Parenting   Several older sites would get none at all: 5778    null 29     1063   4715    Quantitative Finance 7884    null 20     927    6957    Project Management 4333    null 17     1630   2703    Motor Vehicle Maintenance and Repair  These smaller sites get at most . I suspect that a gold or silver badge would encourage site regulars to increase that number without sacrificing quality. Certainly the requirement for those questions to stay in positive territory would prevent a person from flooding the site3 with terrible questions in order to get the badge.   1. The [original spec](https://blog.stackoverflow.com/2008/07/stack-overflow-badge-feedbac/) didn't consider voting at all for Student and Teacher.   2. Your results will vary from mine since I'm looking at slightly newer data. The bronze badge count also differs from the number of [Student](https://stackoverflow.com/help/badges/2/student) badges because the badge isn't revoked when a user's question is later downvoted or deleted.   3. There is a potential problem with cookie-cutter or variation-on-a-theme questions. However, I think the typical tools for closing and deleting questions will prevent people from gaming the system for these badges. What is the meaning of the color of the node sockets in the node editor? I have been searching on the web and I can't find this. What is the meaning of the color of the node sockets in the node editor? How many times more than $0$? If I run history, I can see my latest executed commands.  But if I do tail -f $HISTFILE or tail -f ~/.bash_history, they do not get listed.  Does the file get locked, is there a temporary location or something similar? Let $n \in ℕ$. Show that the ring $ℤ/nℤ$ is a field if and only if $n$   is prime.   Let $n$ prime. I need to show that if $\bar{a} \neq 0$ then $∃\bar b: \bar{a} \cdot \bar{b} = \bar{1}$. Any hints for this ?  Suppose $ℤ/nℤ$ is a field. Therefore: for every $\bar{a} \neq 0$ $∃\bar b: \bar{a}\cdot \bar{b}=1$. How can I show that $n$ must be prime ? I'm trying to wrap my head around how SQL Server decides to grant certain rights based on a users login privileges.  If a user is part of a group "READ ONLY" which has access to DB1, but they are also a part of a group "SysAdmin" which has full db owner rights to the same DB1, which rights are they given when they log in?  On a similar note. What if they are part of a group but also have a standalone account with other middle of the road privileges? A horizontal line with the same space-filling behaviour as /hfill? Is there a command or package which would allow me to draw a line in the largest available space in the way that \hfill fills up the remaining space in a line?  i.e., a command to draw a line from the end of the text, wherever it happens to fall, to the right edge of the textwidth (leaving space for any additional text indented to be at the end of the line)? Proving $\frac{a}{a^2-a+1}+\frac{b}{b^2-b+1}+\frac{c}{c^2-c+1}+\frac{d}{d^2-d+1}\le \frac{8}{3}$ given $a+b+c+d=2$ Let $a,b,c,d\in \mathbb{R}$ and $a+b+c+d=2$. Prove that $$\frac{a}{a^2-a+1}+\frac{b}{b^2-b+1}+\frac{c}{c^2-c+1}+\frac{d}{d^2-d+1}\le \frac{8}{3}.$$   We have $$\frac{a}{a^2-a+1}\le \frac{4}{3}a\Longleftrightarrow \frac{-a\left(2a-1\right)^2}{3\left(a^2-a+1\right)}\le 0,$$ (Right)  So $$LHS\le \frac{4}{3}\left(a+b+c+d\right)=\frac{8}{3}=RHS$$  When $a=b=c=d=\frac{1}{2}$  But also $a=b=c=1;d=-1$ i don't know how to solve it. Let $1, \omega, \dots, \omega^{n-1}$ be the roots of the equation $z^n-1=0$, so that the roots form a regular $n$-gon in the complex plane. I would like to calculate $$ \prod_{j \ne k} (\omega^j - \omega^k)$$  where the product runs over all $j \ne k$ with $0 \le j,k &lt; n$.    My attempt so far  Noting that if $k-j = d$ then $\omega^j - \omega^k = \omega^j(1-\omega^d)$, I can re-write the product as $$ \prod_{d=1}^{\lfloor n/2 \rfloor} \omega^{n(n-1)/2}(1-\omega^d)^n$$  I thought this would be useful but it hasn't led me anywhere.  Alternatively I could exploit the symmetry $\overline{1-\omega^d} = 1-\omega^{n-d}$ somehow, so that the terms in the product are of the form $|1-\omega^d|^2$. I tried this and ended up with a product which looked like $$\prod_{j=0}^{n-1} |1 - \omega^j|^n $$  (with awkward multiplicative powers of $-1$ left out). This appears to be useful, but calculating it explicitly is proving harder than I'd have thought.  The answer I'm expecting to find is something like $n^n$.    My motivation for this comes from Galois theory. I'm trying to calculate the discriminant of the polynomial $X^n+pX+q$. I know that it must be of the form $ap^n+bq^{n-1}$ for some $a,b \in \mathbb{Z}$, and putting $p=0,q=-1$, the polynomial becomes $X^n-1$. This has roots $1, \omega, \dots, \omega^{n-1}$, so that $(-1)^{n-1}b$ is (a multiple of) the product you see above. An expression for $a$ can be found similarly by setting $p=-1,q=0$. convexity proof of a function including ln and sums How to merge an unallocated partition with an extended partition? How do I change which audio jacks are used for input and output? I'm using a Realtek HD audio card built-in my motherboard. The Windows driver comes with a control panel that allows me to select which back panel jacks are used for what. So for example I can make both the blue jack and green jack for output and only the red one for mic-in. (Whereas by default, the blue jack is for line in, which I never need.)  How can I do the same under Linux? If possible, please don't suggest something that involves PulseAudio or JACK; I'd like to do it the plain way, e.g. by editing ALSA configuration files, if possible. The way I understand it, my problem should have nothing to do with software servers redirecting streams, just instructing the driver to treat this jack as so and so because it's hardware supported.  Thank you very much! The question is how can I exclude an object from the freestyle render?  What I need to do is create a Clay render with the wire only on the airplane.  My scene is simple I only have two objects the "Toy Plane" and the "floor". For the Clay render I only override the materials to a simple clay material and done.    But this happens when I use freestyle. How can I tell freestyle to ignore the "Floor"? Algorithm to find Largest prime factor of a number What is the best approach to calculating the largest prime factor of a number?  I'm thinking the most efficient would be the following:   Find lowest prime number that divides cleanly Check if result of division is prime If not, find next lowest Go to 2.   I'm basing this assumption on it being easier to calculate the small prime factors. Is this about right? What other approaches should I look into?  Edit: I've now realised that my approach is futile if there are more than 2 prime factors in play, since step 2 fails when the result is a product of two other primes, therefore a recursive algorithm is needed.  Edit again: And now I've realised that this does still work, because the last found prime number has to be the highest one, therefore any further testing of the non-prime result from step 2 would result in a smaller prime. What are the prerequisites to encounter the legendaries in ORAS? There are a lot of legendaries available in ORAS, however a lot of them will only show up/be available if certain prerequisites are met.  I know Groudon/Kyogre are available through the Story, and      Rayquaza &amp; Deoxys   through the postgame Delta episode, but what about the other available legendaries? What do I need to do to catch them? Is a general GRE score of X sufficient for entry to postgraduate degree Y? How can I convert monsters from D&D 3 or 3.5 to 2ed monsters? This is Ubuntu server 10.04 64 and samba 3.4.7.  I have a shared directory /home/mit/share and another one /home/temp that I link into the shared one:  ln -s /home/temp /home/mit/share/temp   But on windows, after using internet, I cannot open S:/temp, but on Linux it is possible to access /home/mit/share/temp like expected.   This works if I link directories inside /home/mit/share/temp, so I guess samba is restricting to jump with a link outside/above the shared directory.   EDIT:  See also this question titled .  It seems best to put unix extensions = no into the global section and follow symlinks = yes and wide links = yes only into the shares section, where you really need it.  The unix extension flag has to live in the global section and not in the individual shares sections. But for security reasons it is better to use the other options only where you need it, and not globally. I was looking for proofs using Calculus for the area of a circle and come across this one $$\int 2 \pi r \, dr = 2\pi \frac {r^2}{2} = \pi r^2$$  and it struck me as being particularly easy. The only other proof I've seen was by a teacher and it involved integrating $x = \sqrt{r^2 - y^2}$ from $-1$ to $1$, using trig substitutions and then doubling the area to get $\pi r^2$ but the above proof seemed much more straight forward.  Is it a valid proof, or is it based on circular logic or some other kind of fallacy? Cut one side of a rectangle node in TikZ I would like to draw two consecutive rectangle nodes (one is next to the other with an intersected edge). How to cut one side of a rectangle node in TikZ so that the intersected side looks like others?   Consider the example below, I don't want the "duplicated" edge between node 1 and 2.   \begin{tikzpicture}    \node [style={draw, inner sep=0pt, minimum size=0.5cm}]           (1) at (0, 0)  { $1$ };   \node [style={draw, inner sep=0pt, minimum size=0.5cm}]           (2) at (0.5, 0)  { $2$ };  \end{tikzpicture}