I have a laptop running Linux with a 4GB RAM stick that came with it. It's a DDR3 1066 MHz stick. I also have a 1GB DDR3 1333 MHz stick lying around.  I've read somewhere that it might not be good to pair up RAM sticks that are not equal in a computer (the set should be symmetrical), so if they were both 1333 MHz or both 1066 MHz I wouldn't be asking this. But since the 1GB one is faster, is it advantageous to install both and end up with 5GB of RAM?  This question relates to  which says that the speed bottlenecks to the slowest rate, which I think would mean that they will both work at 1033. Does that mean that I should then install both RAMs?  Thanks.
I have a 4GB DDR3 800Mhz recently I installed another 4GB. It turns out it's  DDR3 667MHz. Does it really matter I should own both rams 800MHz?    Slot1 shows recent RAM installation. ALSO I don't know if this is 1600MHz (it shows 800x2 and 667x2 for other) or just 800MHz ram.
What can I do if I'm the victim of serial downvoting? While browsing Stack Overflow, I noticed that I lost a lot of reputation:        Is this serial downvoting? Will it be corrected by a rep-recalculation? How often are those done?    Here's a second instance: Illustrating op amp feedback without control theory We are teaching op amps in a high school class, before calculus.  So we can't use control theory to teach how op amps respond.  All the same, I would like to have an intuitive explanation for how a feedback circuit works.  Take the negative feedback, for instance.  Is there a clear way to show how an initial difference of delta between V+ and V- leads to a very large (G(V+ - V-)) difference in the output, which then leads to ...  I'd like to be able to take that argument and show how the voltage of the output converges in addition to the standard virtual short argument.  Can anyone explain it clearly? I was given this question by a friend and after working tirelessly on it I have not come up with anything substantial. I was hoping someone in the community could provide a pointer or possibly a solution. The person who gave me the question says he has the answer to it, but I am more curious about the working.  Here is the question:     Three points $(B, C, D)$ lie on parabola  $y = x^2$ and a fourth point $A$ is placed such that $ABCD$ forms a square. Find the minimal area of $ABCD$.   So far my working out has involved a collection of distance/mid-point formula's and I haven't even reached the point where I differentiate to minimize the area.  Any pointers would be welcome.   Edit  Apparently the correct answer is $\sqrt{2}$ units squared. I recently obtained a Seagate Expansion 3TB external harddrive. I'm trying to copy over all of my stuff to prepare for reformatting and installing a new OS. A handful of my mp3s did not transfer when I was doing my music folder. I checked them after the fact and the ORIGINAL files became corrupted somehow. I am certain of at least a few that were not corrupted in anyway before doing this. Every now and then during my transfer I got  There was an error copying the file into /media/***/Seagate Expansion Drive. Error splicing file: Input/output error   Each of these files that I check after are corrupted at some point in the duration and will not play. Why did this happen and what can I do to fix it? Possible Duplicate:          On  it's a stated fact that if $I$ and $J$ are coprime ideals of a ring $A$, then $I^k$ and $J^\ell$ are also coprime for any integers $k,\ell$.   There's no proof given. Why is this fact true? Tag score calculation wrong in Android App Best practices for storing UI settings? Calculation of number density from material density Material density is given by $ \rho =m/V$, where $m$ is mass and $V$ is volume. Again number density given by $n=N/V$, where $N$ is the total number of particle. How can I calculate number density $n$ from material density $ \rho $. Let $f_n, f \colon [a,b] \to \mathbb{R}.$ Show that, if $f_n \to f$ uniformly, then the Lebesgue integrals are equal, i.e. $\int f = \lim \int f_n$.  This is clearly true for continuous functions, but how do I handle the case of non-continuous functions? How does the telepathy supernatural ability work? How can I immediately detect when new files added to a folder within a  script? I would like the script to process files as soon as they are created in the folder. Are there any methods aside from scheduling a  job that checks for new files each minute or so? Triple Boot Lion+Win7+Linux Notify close voters when a closed question gets edited As mentioned in , a question closed because it was not well-phrased is currently very unlikely to be reopened after an edit clarifying the issues. Those who voted to close should at least be asked to reconsider and reopen the question after such an edit. Title tag different from title appearing in Google? Why does the x86-64 / AMD64 System V ABI mandate a 16 byte stack alignment? Function on $[a,b]$ that satisfies a Hölder condition of order $\alpha > 1 $ is constant I want to show that if a function $f:[a,b]\rightarrow \mathbb R$ satisfies a Hölder condition of order $\alpha &gt; 1 $ then it is constant.  The way I think of it is as follows:  $$|f(x) - f(y)| &lt; K|x-y|^\alpha$$  $$\frac{|f(x) - f(y)|} {|x-y]}  &lt; K|x-y|^{\alpha -1}$$  $$\lim_{y\rightarrow x} \frac{|f(x) - f(y)|} {|x-y]} \le \lim_{y\rightarrow x}  K|x-y|^{\alpha -1} =0 $$ As the limit is $0$, we can remove the modulus, so we get:  $$\lim_{y\rightarrow x} \frac{f(x) - f(y)} {x-y} = 0$$ So $f$ is derivable and $f'(x) = 0$ for all $x$ in $[a,b]$. Note that the reason we can add the limit $y\rightarrow x$ is because $[a,b]$ is closed in $\mathbb R$.  However, the question gives as a hint using the mean value theorem. I am not sure why one should do that. You would first have to prove that $f$ is derivable in a similar manner to what I did, and then prove that $f$ is constant. Or is there a simpler way to do it and I am missing it?  Also please inform me of any mistakes I did in the proof (if any)/ Thank you! When Cantor's Intersection theorem won't work with closed sets Give an example to show that Cantor's Intersection Theorem would not be true if compact sets were replaced by closed sets.    Compact set is closed and bounded, so what I'm going to find is something that is closed but not bounded.  By the Cantor theorem, which says that a decreasing sequence of non-empty compact subset will have a non-empty intersection.  What I was trying to approach is how two sets just "touched" and as if they have not bounded, two sets "touched" nothing. But I cant give an example for that ASP.NET Call Code Behind Function From Javascript How does the Southwest Airlines boarding process work? I'm flying this week on Southwest Airlines for the first time. I paid for "Early Bird" automatic checkin and the FAQ mentions something about "A" boarding passes. I have no idea what that means, and I know that Southwest doesn't have assigned seats.  How does the boarding process work and is there anything I should be aware of? How can I do a full shutdown of windows 10 without logging in? I have a computer with both Windows 10 and Ubuntu 17.04 installed on it. I can't log in to Windows, and think it's a problem with the registry. Luckily, there is a way to restore the registry from backup from Ubuntu, but you have to be able to modify files on the Windows partition. Right now, I can't write to the NTFS partition because Windows didn't do a full shutdown.  How can I force windows 10 to do a full shutdown without being able to log in?