I want to install it on my old desktop PC. here is it's specs:   CPU: Intel Pentium 4@2.4GHz RAM: 736 MB VRAM: 256MB HDD: 120GB   I can install the following OSes on it:   Windows Vista Home Basic w/SP2 Mac OS X v.10.5.8 "Leopard" Ubuntu 14.04 LTS?
For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?
Best methods to fix broken tracks I've made a couple of PCBs which need the odd few 10 mil tracks, but are mostly 20/30 mil. Unfortunately the etching process isn't fantastic and there are numerous breaks in the traces, most of them small.  I've managed to convince solder lumps to go over the top of the smaller gaps, and have used components legs to bridge some of the larger ones. The solder lumps don't feel particularly reliable though, and there are some gaps which are too small and awkward to get a piece of wire across but too big to be bridged with just the iron.  Are there any standard ways to reliably fix up broken traces?  Update: Thanks for the suggestions everyone!  I found and tried out a silver conductive pen. As a first time user I found it difficult to dispense, and obviously I didn't use enough of it or mix it properly because it didn't even end up being conductive.  It seems like the main problem was that I was trying to use pieces of wire which are too short. I found some small gauge tinned wire and used longer lengths, running it over significant lengths of good track on either side of the fault. That makes it much easier to position, and you can tack them down one end at a time. Is it true that every pair of twin primes >3 is of the form 6n plus or minus 1? Is it possible to have twin primes whose center is not divisible by 6? Yes, I'm really sure I want to delete that post Attempting to delete questions on the mobile site on iOS causes two notification messages asking me to confirm the deletion, which it shouldn't do.  I haven't really looked into it, but it may just be that the handlers from full.js and mobile.js are both being triggered, as there seems to be the flash of the error dialog indicating something went wrong on the supposed second AJAX request when the response from the first triggers a page reload.  You can see this happening by following the method calls; the mobile view first calls   StackExchange.question.init() -&gt; StackExchange.question.fullInit()   -&gt; StackExchange.vote.init()     -&gt; u()    ...where u() sets a delegated click handler on  $("div.post-menu *[id^='delete-post-'], table.flagged-posts *[id^='delete-post-']")   ...that calls .preventDefault() on the event, but doesn't block other handlers from firing.  It then later calls StackExchange.mobile.init(), which in turn calls the method J() that sets up a similar handler directly on $(".delete-post").  Since both handlers get triggered, there's two confirmation dialogs, and two attempts to delete the post. The extra handler in mobile.js seems unnecessary, so just removing it would appear to be the easy fix to the problem. I have to prove the  by tomorrow and I am really unconfident about what I did:  $$\sum_{n=1}^\infty a_n\text{ converges } \iff \sum_{n=1}^\infty 2^n a_{2^n}\text{ converges}$$  I did the following:  Let $(b_n)$ be a sequence as follow: $b_{2^k+m}:=a_{2^k}$ with $k\in\mathbb N_0$ and $0\leq m&lt;2^k$.  It's $a_{n+1}\leq a_n$ and so $0\leq a_{n+p}\leq a_n$ for all $n,p\in\mathbb N$.  So $\sum\limits_{n=1}^\infty b_n$ converges by the majorizing series $\sum\limits_{n=1}^\infty a_n$. And it's $\sum\limits_{n=0}^\infty b_n=\sum\limits_{n=0}^\infty\sum\limits_{m=0}^{2^n-1}a_{2^{n+1}}=\sum\limits_{n=1}^\infty 2^{n-1}a_{2^n}$ so $\Rightarrow$ is done.  For $\Leftarrow$ consider $c_{2^k+m}:=a_{2^k}$ with $k\in\mathbb N_0$ and $0\leq m&lt;2^k$.  It's $|a_n|\leq c_n$ and $\sum\limits_{n=0}^\infty c_n=\sum\limits_{n=0}^\infty\sum\limits_{m=0}^{2^n-1}a_{2^{n}}=\sum\limits_{n=1}^\infty 2^{n}a_{2^n}$ and so $\sum\limits_{n=1}^\infty a_n$ converges by the majorizing series $\sum\limits_{n=0}^\infty c_n$.  Is this in form and content correct? Traffic (views, visits) is not correctly registered on Site Analytics or Area 51 In the ,  can monitor some things like the total traffic on the site. However, it seems to be broken at the moment, all figures are almost zero. This is how it looks for Meta Stack Exchange (other sites show similar pictures): How to get multiple selected values of select box in php? How to get the current date/time in Java How to encrypt in VBScript using AES? I am looking to encrypt some data using  in  using a specific key and  value. Are there any good function libraries or COM components that would be good to use?  I looked at ; it allows a passphrase only, and won't allow setting specific key and IV values. Why is "idea" sometimes pronounced as "idear"? I know that idea is pronounced as /aɪˈdiə/, but I've meet several people in real life who put an 'r' at the end of the word. How come? Prove that for real number $p\geq  0$ we have   $$\lim_{n\to\infty}\frac{(1^{1^p} \cdot2^{2^p}\cdots n^{n^p})^\frac{1}{n^{p+1}}}{n^\frac{1}{(p+1)}} = \exp\left(\dfrac{-1}{(p+1)^2}\right).$$ Google Chrome (Windows) not displaying text/encoding correctly on certain websites I experience a problem similar to    Here's a screenshot on the website     I've tried:   Removing fonts I have installed Setting the encoding to Western, UTF-8, Greek, Automatic Changing the fonts used in Google Chrome Removing Google Chrome, including all application data/user profiles Running CCleaner Reinstalling Google Chrome, twice Installing Chromium (fonts display fine in Chromium) Turning off Windows ClearType Changing Windows/Chrome languages from English (Australia) to US, UK Restarting Windows several times after making changes   All of which did not work. I do not connect over VPN/proxy.   Can anyone give me any tips?  Windows 7 x64 Ultimate Block IPs if they access a resource Why do a lot of questions from around 2008 seem to have really high upvotes? I have seen this a lot but i ran into this question today:    And the answer (while good) has 83 upvotes which seemed a little over the top.  I see dozens of answers of this caliber every week that only seem to get a few upvotes.    Was there some sort of SO policy that encouraged people to upvote more during this period?  Am I just imagining that answers from this period received more votes than comparable ones now? There is an alignment issue in the stackexchange.com search page .  The bottom bar is missing in the search input box.  Sample URL:   Screen shot for reference:    Firefox version: 54.0b8 (32-bit) OS Version: Windows 10 Pro  Also happens with Chrome latest version. Proving a combinatorial identity without double counting Consider the following problem:  We have a collection of m white and n black balls. We pick k balls (k ≤ m+n) without replacement. What is the expected number of white balls in the sample?  Counting method 1: The ratio of white balls in the collection is m/(m+n). If we repeatedly sample the collection, we expect that on average, our sample has the same ratio. Therefore, the expected number of white balls in a sample of size k is km/(m+n). As a side note, I think the above argument somehow depends on the unbiasedness of  the mean estimator. Am I right?  Counting method 2: We directly compute the expected number of white balls in the sample: $$ \frac{\sum_{i=0}^{k} i\binom{m}{i}\binom{n}{k-i}}{\binom{m+n}{k}} \enspace.$$  So, we reach at the identity: $$ \sum_{i=0}^{k} i\binom{m}{i}\binom{n}{k-i} = \frac{km}{m+n}\binom{m+n}{k} \enspace.$$  How to prove the above result without double counting? It seems to be provable using  as well as $i\binom{m}{i} = m\binom{m-1}{i-1}$. But is there a simpler approach (which does not depend on extra identities such as Vandermonde's)? Seeing strange things in light I have noticed that if you look directly at tubelight (I have only white ones in my home) and close your eyes little, you see little random shaped colourless things sometimes with slow speed and sometimes with falling down.   They are shaped like circles with something in between and in chains of random length.   My father has also seen them. So, I am sure I am not imagining things. What the hell are they? Loop doesn't see value changed by other thread without a print statement Problem on Linear Diophantine Equation over 3 variables How to solve $ax+by+cz=d$ over integers where $a,b,c,d$ are integers? I made a series of outdoor shots with Nikon D5000, with the 18-55mm 1:3.5-5.6G VR kit lens.  On some shots, I see in the EXIF info f/11, and in another shot, f/9.    How can that be, that the f-number is greater than 5.6, when that's listed as the maximum in the lens spec? Can I transfer trophies and data to a new account? Okay I have created a sub account on my ps3 as a new user. I wanted to change my psn online id. So I have copied all game data from the old account to my new account, but when I go to play the game it still says the trophies and data belong to the old account. I don't want to delete the old one and lose all my saved games and trophies, is there a way to either unlock and allow my new user to own the data and trophies or transfer the trophies and data so that my new account may own it?