I have a ssd, and two hard drives. I have windows on the ssd, and use the one hard drive on windows as well. I just picked up another hard drive and haven't even installed it into my system yet. My question is, can I dedicate the new drive for Ubuntu only? and still keep the other two windows only. If I can, how exactly?
I have 2 1tb hard drives on my computer with Windows 8 on the first hard drive and nothing on the other.  I want to install Ubuntu 14 on the second hard drive. I've looked up some guides and they all say to install Ubuntu on the sdb partition when booting off a usb stick. I have also seen some say to unplug the Windows HDD and then install Ubuntu onto the second HDD, and Ubuntu will automatically detect Windows and ask what you want to boot into upon boot.   I am really concerned about this - Will it ask me to choose what OS I want to boot into? Is there something like rEFInd(Mac) for Windows? Can anyone please give me a guide on how to do it without ruining my computer?  Thanks
My 3 years old doesn't tell me when he needs to use the bathroom Back in Europe I have a N64 console. As I am currently living in Japan, I find myself tempted to buy some old N64 games in Japanese. However, the articles about the N64's region locking usually assume Japanese games on an American console...  My question thus is: Can you play a Japanese N64 Game on a European console? Suppose that we don't know logarithm, then how we would able to calculate $\sqrt x$, where $x$ is a real number? More generally, is there any algorithm to calculate $\sqrt [ n ]{ x } $ without using logarithm? More simple techniques would be nice.  Here is a simple technique used to approximate square roots by :  For example: $\sqrt {78}\approx 8\frac { 14 }{ 17 } $ , where $8$ is the nearest integer root of $78$, $14 = 78 - 8^2$, $17 = 2 \times 8 + 1$.  if $n=2^k$ we can use the method above.   For example, for $k=2$ Lets calculate $\sqrt [ 4 ]{ 136 } $: $$\sqrt [ 4 ]{ 136 } =\sqrt { \sqrt { 136 }  } \approx \sqrt { 11\frac { 136-{ 11 }^{ 2 } }{ 11\times 2+1 }  } =\sqrt { 11\frac { 15 }{ 23 }  } \\ \sqrt { 11\frac { 15 }{ 23 }  } \approx 3\frac { 11\frac { 15 }{ 23 } -{ 3 }^{ 2 } }{ 3\times 2+1 } =\frac { 544 }{ 161 } =3.38\\$$ The exact result is$$ \sqrt [ 4 ]{ 136 } =3.4149\cdots$$ The method approximates well, but it is working for only $n=2^k$ as I know. Visual design changes to the review queues In Leibniz notation, the 2nd derivative is written as $$\dfrac{\mathrm d^2y}{\mathrm dx^2}\ ?$$  Why is the location of the $2$ in different places in the $\mathrm dy/\mathrm dx$ terms? Resources for Blender Number of possible permutations of n1 1's, n2 2's, n3 3's, n4 4's such that no two adjacent elements are same? Given $n_1 $ number of  $1 $'s,  $n_2 $ number of  $2 $'s,  $n_3 $ number of  $3 $'s,  $n_4 $ number of  $4 $'s.  form a sequence using all these numbers such that two adjacent numbers should not be same.  I have tries lot of things but nothing worked.  can somebody tell me how to solve this problem? Lie bracket for Lie algebra of $SO(n,m)$ Hamiltonian Cycle Problem At the moment I'm trying to prove the statement:     $K_n$ is an edge disjoint union of Hamiltonian cycles when $n$ is odd.   ($K_n$ is the complete graph with $n$ vertices)  So far, I think I've come up with a proof. We know the total number of edges in $K_n$ is $n(n-1)/2$ (or $n \choose 2$) and we can split our graph into individual Hamiltonian cycles of degree 2.   We also know that for n vertices all having degree 2, there must consequently be $n$ edges. Thus we write $n(n-1)/2 = n + n + ... n$ (here I'm just splitting $K_n$'s edges into some number of distinct Hamiltonian paths) and the deduction that $n$ must be odd follows easily.  However, the assumption I made - that we can always split $K_n$ into Hamiltonian paths of degree 2 if $K_n$ can be written as a disjoint union described above - I'm having trouble proving. I've only relied on trying different values for $n$ trials and it hasn't faltered yet. So, I'm asking:     If it is true, how do you prove that if $K_n$ can be split into distinct Hamiltonian cycles, it can be split in such a way that each Hamiltonian cycle is of degree 2? I duplicated a few objects with Alt+D and now I want to apply some modifiers to them, however I can't, because they are multi-user objects.  I tried U > Objects but I still can't apply the modifier.  How to make multi user objects single user? If $a$ and $b$ are relatively prime, prove that $a + 2b$ and $2a+b$ are also relatively prime or have a $\gcd$ of $3$.  I'm very new to number theory so please don't assume I am familiar with some of the terminology. Ubuntu 18.04 opening system settings logs me out Why is carbon dating limit only 40,000 years? biblatex: displaying all authors of multi-author works in the bibliography I'm using the  package to add citations and a bibliography to my LaTeX document. I've noticed that only the first author plus "et al." is displayed for works with more than three authors. That's fine with me for in-text-citations, but I'd rather have the complete author information in the bibliography. How can I do that? After swapping the positions of the hour and the minute hand, when will a clock still give a valid time? At 12 o'clock, the hour hand and minute hand of the clock can be swapped, and the clock still gives the same time, but at 6 o'clock, it can not be swapped. So in what cases when we swap the hour and the minute hand position does a clock still give a valid time? Need to print out iPhone text messages I have a court case and have text messages on my iPhone I need to transfer to my iPad email for evidence.  Every time I try it doesn't work, it will send them to my iMessage but not my email.  I need to print them out How do I do this? Is there a single word for a "friend of a friend"? I am looking for a word that I could use instead of "friend of a friend". On certain occasions, it happens that you may want to talk about a friend of a friend with someone else.   In such cases how would you refer to this friend? I am looking for an example of a sequence which shows that, $a_{n+1} - a_n \to 0$ as $n \to \infty$ does not imply that sequence $a_n$ converges. I have a feeling that the sequence should be an oscillatory one but I am unable to think of an example. How to make a font with Adobe Illustrator? I have recently created my own font/typeface with Adobe Illustrator, and I would like to use it as a real font (e.g I would like to use it as I type something).   Is this possible in Adobe Illustrator or would I need a different software?   If so what program would be good for creating a font? Do not delete good duplicates!