I have a 250GB HDD with a partition for Windows 10. I am currently trying to install Ubuntu on the unused partition.How can this be achieved?
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?
Does a Nikon DX lens on a FX camera get subjected to the 1.5X crop factor? Imagine I have tons of RAM. Let's say 64GB. That's a lot for even gaming PCs. Now the default location of a pagefile in Windows is on the main OS drive, be it HDD or SSD, which are faster in general, but still not as fast as RAM.  Something tells me that disabling the pagefile on the hard drive or creating a virtual RAM drive and letting the pagefile be there could make Windows move all its virtual memory to RAM, and so increase the system's performance, but I'm not very knowledgeable in that area, so that might not be true at all.  I tried both, but I couldn't analyze the results to reach a definite conclusion with my knowledge level in memory things.  Would this work? If not, why? How do I find the files installed by a particular package? Where is the .deb file to look at? I have installed pulseaudio-module-bluetooth using apt.  $ type pulseaudio-module-bluetooth bash: type: pulseaudio-module-bluetooth: not found $ which pulseaudio-module-bluetooth $ whereis pulseaudio-module-bluetooth pulseaudio-module-bluetooth:   Clearly, I'm looking for the wrong thing.  The package does not simply install a command that is the same name as the package.  Alright, then.  I want to find out what all commands (or executables) this package installed, and their locations.  The answers to "" tell me how to find the files installed by the package if I have a .deb file.  I'm not installing directly from a .deb file, though.  I'm using apt.  Where is the .deb file that that used?  Is there a copy on my system somewhere that I can query with the commands in the answers to that question?  Where?  If there isn't a local copy on my system, can I get one with apt?  How?  Is there some handy apt (or similar) command that wraps this up for me, so that I do not have to run dpkg-deb directly?  What is it?  Can I find the package's file list entirely on-line, without explicitly downloading any .deb files and before installing anything with apt?  How? Order a MySQL table by two columns How do I sort a MySQL table by two columns? What I want are articles sorted by highest ratings first, then most recent date.  As an example, this would be a sample output (left # is the rating, then the article title, then the article date)  +================+=============================+==============+ | article_rating | article                     | article_time | +================+=============================+==============+ | 50             | This article rocks          | Feb 4, 2009  | +----------------+-----------------------------+--------------+ | 35             | This article is pretty good | Feb 1, 2009  | +----------------+-----------------------------+--------------+ | 5              | This Article isn't so hot   | Jan 25, 2009 | +================+=============================+==============+  The relevant SQL I'm using is: ORDER BY article_rating, article_time DESC  I can sort by one or the other, but not both. Windows Power Options Clarification So I was looking through the Windows 7 power options via Control Panel today, and I realized I had a couple of unresolved questions as to the nature of various choices. I was wondering if someone could give me a clear and concise explanation of the difference between the following four selections:   Sleep Mode Hibernate Mode Standby Mode Turn off hard disks after...   For example, regarding option 4 - does this mean that after the elapsed time limit, the computer will go into standby, hibernate, sleep, or just turn off? Below is an image of the options (albeit on a Windows XP system, but I think the same concepts should apply): msiexec is command prompt software that installs an  program. But I have found that you can install an MSI file from the command line by just typing in the name of the MSI file on the command line.  But in order to uninstall the MSI file, it seems you have to call the msiexec program and give it a /x or /uninstall.  How can I uninstall an MSI from the command line without using the msiexec routine? A friend of mine asked me to calculate the value of a perticular determinant, but after spending quite some time on it I'm unable to find a solution to it. The given determinant is:  $$         \begin{vmatrix}         0 &amp; 1 &amp; \cdots &amp;n-2&amp;n-1 \\         n-1 &amp; 0 &amp; \cdots &amp;n-3&amp;n-2 \\         \vdots &amp; \vdots &amp; \ddots &amp; \vdots &amp;\vdots\\         1 &amp; 2 &amp; \cdots &amp; n-1 &amp;0 \\         \end{vmatrix} $$  Also my friend is supposed to solve this determinant by more or less elementary methods, like elementary row operations, transpose... and no eigenvalues, nor adjoints.    First of all it seems like the value of the determinant is:  $$         \frac{1}{2n}\begin{vmatrix}         0 &amp; n &amp; \cdots &amp;n&amp;n \\         n &amp; 0 &amp; \cdots &amp;n&amp;n \\         \vdots &amp; \vdots &amp; \ddots &amp; \vdots &amp;\vdots\\         n &amp; n &amp; \cdots &amp; n &amp;0 \\         \end{vmatrix} $$  Anyway I tried adding all the rows to the last one and by taking $\frac{n(n-1)}{2}$ in front to have a row of 1s, but it didn't helped me much.  Then I tried to use the fact that:  $$         \begin{vmatrix}         A &amp; C \\         0 &amp; B \\         \end{vmatrix} = \det(A) \cdot \det(B) $$, where $A,B$ are square matrices. By subtracting the $(\frac{n}{2} + i)$-th column from the $i$-th ($i=0,1,2...$) and then adding the $i$-th row to the $(\frac{n}{2} + i)$-th row, one can obtain the wanted form, but again nothing more. Also this method pretty much fails when $n$ is odd.  My best attepmt was to notice that $A_{ij} + A_{ji} = n$ and using $\det(A^{T}) = \det(A)$, but unfortunatelly  $$\begin{vmatrix}         0 &amp; n &amp; \cdots &amp;n&amp;n \\         n &amp; 0 &amp; \cdots &amp;n&amp;n \\         \vdots &amp; \vdots &amp; \ddots &amp; \vdots &amp;\vdots\\         n &amp; n &amp; \cdots &amp; n &amp;0 \\         \end{vmatrix} \not = \begin{vmatrix}         0 &amp; 1 &amp; \cdots &amp;n-2&amp;n-1 \\         n-1 &amp; 0 &amp; \cdots &amp;n-3&amp;n-2 \\         \vdots &amp; \vdots &amp; \ddots &amp; \vdots &amp;\vdots\\         1 &amp; 2 &amp; \cdots &amp; n-1 &amp;0 \\         \end{vmatrix} + \left( \begin{vmatrix}         0 &amp; 1 &amp; \cdots &amp;n-2&amp;n-1 \\         n-1 &amp; 0 &amp; \cdots &amp;n-3&amp;n-2 \\         \vdots &amp; \vdots &amp; \ddots &amp; \vdots &amp;\vdots\\         1 &amp; 2 &amp; \cdots &amp; n-1 &amp;0 \\         \end{vmatrix}\right)^T$$ I tried to decompose the LHS by using the $n-$linearity of the determinants, by then one gets $2^n$ determinants on the RHS similar to the first one, but things are messy. I've been looking for some addon or something to render only the marked frames on timeline, i found this answer here on the stackexchange   The thing is this script only works with multiple cameras, i have only one camera that goes all aorund the scene but i only want to render the frames that i've marked on timeline.  Is there someone who can help me modify this script? Or find a better solution? Proof by induction on a rooted tree with even number of vertices Let $T = (V, E)$ be a rooted tree with an even number of vertices. Prove by induction that there exists a set of edges $S \subseteq E$ such that every $v \in V$ is incident with an odd number of edges in $S$.  I was wondering if my argument is sufficient to prove the statement above:  Base case: $|V|=2$, there is only 1 edge and both vertices are incident with 1 edge $-&gt;$ $S \subseteq E$.  Inductive step:  Let $|V|&gt;2$, implying that $T$ has at least 2 external vertices. Let us choose two arbitrary external vertices $w,u \in V$. Such vertices are only incident to 1 edge each, $e_w$ and $e_u$. We can say that $e_w,e_u \in S$.   By induction, there exists a set $S$ in $T'=T-\{w,u\}=(V',E')$ such that every $v \in V'$ is incident with an odd number of edges in $S$ because removing 2 vertices from a tree with an even number of vertices maintains the property $|V|=2n$. How are NFL matchups determined for each season? During the 2012 NFL Season, the Pittsburgh Steelers and Baltimore Ravens play each other in weeks 11 and 13, two weeks (in both NFL schedule and time) apart. To me, that seems too close for comfort.   I do know that teams play other teams in their division twice. How does the NFL schedule procedure work? What is syntax highlighting and how does it work? How does the Hogwarts Headmaster know whom to invite to school? So all wizards get an invitation to Hogwarts at 11... How do they know whom to invite?  If a wizard is Muggle-born, then nobody would know about their existence.  Or do they register some weird magical stuff being done by them before 11? I am trying to integrate one Salesforce org to other org by using Oauth setup, I wanted to use  use consumer key and consumer secret key in my REST class to connect with the org, after connection part completion, I want to access Get(), Put(), Post(), etc. Including the ability to set Oauth and Authorization headers needed for Salesforce Rest API calls.  Actually I'm new in REST implementation so can you please explain me by using code samples. How to use classes from .jar files? I read the Java tutorials on Sun for JAR files, but I still can't find a solution for my problem. I need to use a class from a jar file called jtwitter.jar, I downloaded the file, and tried executing it (I found out yesterday that .jar files can be executed by double clicking on them) and Vista gave me an error saying "Failed to load Main-Class Manifest attribute from [path]/jtwitter.jar".  The guy who coded the .jar file wants me to import it, but where do I store the .jar file to import it in my code? I tried putting both the .jar file and my .java file in the same directory, didn't work.  The file I'm trying to work for is here:   I'm using JCreator LE. How do I properly use the "Not an Answer" flag? What is the "Not an Answer" flag and what is its purpose? When should I use this flag? When should I not use this flag? But I'm still not sure if I'm using the flag correctly... An answer is "Not an Answer", but the flag was declined or disputed!   See also: Every time I try to do something seemingly-simple in CSS, it doesn't work.  I have a content div that contains a 460x160 image. All I want to do is position the image at the bottom-right corner and wrap my text around it.  &lt;div id="contents"&gt;     &lt;img src="..." /&gt;     text text text text text text ... &lt;/div&gt;   So I want it to look like:  ------------------ | text text text | | text text text | | text text -----| | text text |    | ------------------   Doing it with a top-left or top-right image is cake:  #contents img { float:right; }  ------------------ | text text |    | | text text -----| | text text text | | text text text | ------------------   Now how do I push that to the bottom? The best I've come up with so far are:  #contents img { float:right; margin-top: 90%} // really needs to be 100%-160px  ------------------ | text text      | | text text      | | text text -----| | text text |    | ------------------   In this case the text does not print in the margin, so there is white space above the image.  #contents { position:relative; } #contents img { position:absolute; right:0; bottom:0; }  -or-  // move the img tag under the text in the html and: #contents img { float:right; margin-top:-160; }  ------------------ | text text text | | text text text | | text text -----| | text text | te | ------------------   In this case the text prints over or under the image.  So... how can I accomplish this? limsup of intersection of events as a subset of intersection of limsups Let $A_1, A_2, \ldots$ and $B_1, B_2, \ldots$ be two sequences of events in some probability triple $(\Omega, \mathcal{F}, \mathbf{P})$. Now, it is true that $\left(\limsup_n A_n\right) \cap \left(\limsup_n B_n\right) \supseteq \limsup_n (A_n \cap B_n)$, and I can think of many different cases where this relation holds true for equality (e.g., let $A_n = B_n$, or $A_n = B_n^c$, or $B_n = \emptyset$, or $B_n = \Omega$). However, I cannot think of any case where $\left(\limsup_n A_n\right) \cap \left(\limsup_n B_n\right) \supset \limsup_n (A_n \cap B_n)$ holds for strict inclusion.  My proof for the relation is simple. Since $A_n \cap B_n \subseteq A_n$ and $A_n \cap B_n \subseteq B_n$, then we can perform some set algebra as follows:  $$\bigcup_{k=n}^\infty (A_k \cap B_k) \subseteq \bigcup_{k=n}^\infty A_k$$ $$\bigcap_{n=1}^\infty \bigcup_{k=n}^\infty (A_k \cap B_k) \subseteq \bigcap_{n=1}^\infty \bigcup_{k=n}^\infty A_k$$  Then we can use the same logic for $B_n$, and come to the conclusion as stated in the beginning. throwing exceptions out of a destructor Most people say never throw an exception out of a destructor - doing so results in undefined behavior. Stroustrup makes the point that "the vector destructor explicitly invokes the destructor for every element. This implies that if an element destructor throws, the vector destruction fails... There is really no good way to protect against exceptions thrown from destructors, so the library makes no guarantees if an element destructor throws" (from Appendix E3.2).   seems to say otherwise - that throwing destructors are more or less okay.  So my question is this - if throwing from a destructor results in undefined behavior, how do you handle errors that occur during a destructor?  If an error occurs during a cleanup operation, do you just ignore it? If it is an error that can potentially be handled up the stack but not right in the destructor, doesn't it make sense to throw an exception out of the destructor?  Obviously these kinds of errors are rare, but possible. Why is my Wi-Fi process using 3GB of memory? Cleric build to maximize melee damage and spell healing