Hello folks From where i can download 32bit for 13.04 version for my virtual box. Only 32bit. Thanks shazz
A new version of Ubuntu has been released. I still can't find it on ubuntu.com. Where can it be downloaded from, or is it the only way to install it using update-manager to upgrade an existing installation?
How I can identify which process is making UDP traffic on Linux? Changing the size of the mouse pointer in Ubuntu MATE 18.04 does not work I have Ubuntu 18.04 with the gnome-desktop  and parallel the Ubuntu MATE desktop installed. While I can easily change the size of the mouse pointer (DMZ-White) in the Gnome3 desktop , this does not work on the MATE desktop. I use for this the dconf-editor.  Maybe someone knows a solution?  Thanks a lot. Can you lose an ability if your reputation falls below a threshold? Is it safe to answer "erase disk and install Ubuntu" on a virtual machine? Running 64 bit programs on a 32 bit system Update 2014-04-17 04:47 UTC: Stable, with some odds and ends to clean up      The main MSO/MSE sites are stable, but there are plenty of corners left to sweep. For details, see:    Not all of them mind you, just Meta Stack Overflow into Meta Stack Exchange.  I'll have you know, factually, that we really did believe this would take place in six-to-eight weeks when it was , but we've finally got a tentative date established.  If things go according to plan, we'll begin the operation shortly after 8:30 PM EDT on the 16th, completing everything within a few hour window. Ideally, all service disrupting endeavors will be completed within the first hour, which include:   The availability of Meta Stack Overflow The availability of Stack Overflow (more on this shortly) The availability of Chat on Meta Stack Overflow   As you know, we'll be bolting on a standard issue per-site meta on Stack Overflow, while breaking the link between what will have become Meta Stack Exchange and Stack Overflow. There's some irritable innards in that particular region, so we'll be asking folks to expect the unexpected during the maintenance window. Affected sites will be in and out of read-only mode, or quite possibly just down for maintenance while we're doing the actual break.  I'll be posting a system message on both Meta Stack Overflow as well as Stack Overflow itself 24 hours before we begin the actual work.   Did I say tentative in a six-to-eight-something time frame again? Why yes, I did - we're currently running some tests on the dev tier to simulate the split as closely as possible, so that we can better anticipate quirks that we need to address prior to actually doing it.  Once the sites have actually been stood up functionally on the production tier, we're going to get to work on finishing touches. This will include things like site settings (which determine bits of text you see in the question prompts, rep thresholds, etc) and all sorts of other fine tuning.  Once we're done:   Stack Overflow will have a blank, empty child meta site just like every other site The new Meta Stack Exchange will be up and running All rooms on Chat Meta Stack Overflow will be moved to Chat Meta Stack Exchange  I'll send over about 150 - 200 questions from MSE to MSO, most of which will be tag or SO-specific feature related posts that got buried by the network stuff without resolution.   If the tentative date moves, I'll update this post with the new date. However, we do not anticipate this happening any later than Saturday, April 19 - in the case that we see down time we can't mitigate and need to do it on a weekend.  The ground work is basically done, we're finishing up sanity now with a great deal of confidence, and we're pretty certain that we'll hit between those dates, if not directly on the tentative 16th.  Questions? Kvetch? Anonymous confessions? Answer below, and I'll address each in comments. Is it standard to say $-i \log(-1)$ is $\pi$? I typed $\pi$ into Wolfram Alpha and in the short list of definitions there appeared  $$ \pi = -i \log(-1)$$  which really bothered me. Multiplying on both sides by $2i$:  $$ 2\pi i = 2 \log(-1) = \log(-1)^2 = \log 1= 0$$  which is clearly false.  I guess my error is $\log 1 = 0$ when $\log$ is complex-valued.  I need to use $1 = e^{2 \pi i}$ instead.  So my question: is it correct for WA to say $\pi = -i \log(-1)$?  Or should be they specifying "which" $-1$ they mean?  Clearly $ -1 = e^{i \pi}$ is the "correct" value of $-1$ here. Ubuntu doesn't boot! Auto increment filename I have a need to collect some duplicate files and want to avoid name collisions. The problem is that this collection of files might be added to by another execution of my script before the files are cleaned out and just want to continue to increment the number.  I decided on a simple until loop to increment the number like so.  until [[ ! -f ${PWD}/DUPES/${num}-$1 ]]; do num=$((num +1)) done mv --no-clobber $1 ${PWD}/DUPES/${num}-$1   I can't imagine ever exceeding 1k files in an extreme example, so my questions are...  Is this a terribly inefficient way to achieve this? Should I be parsing the existing files to get the highest leading number to start incrementing from there, or is this ok for the extreme example I put forth?  Or is there a better way all together? What animal is a “weefil”? What animal is depicted in this image labelled “weefil”? A set with a finite integral of measure zero? I'm trying to prove the following statements.  Let $G$ be a finite abelian group $G = \{a_{1}, a_{2}, ..., a_{n}\}$.   If there is no element $x \neq e$ in $G$ such that $x = x^{-1}$, then $a_{1}a_{2} \cdot \cdot \cdot a_{n} = e$.   Since the only element in $G$ that is an inverse of itself is the identity element $e$, for every other element $k$, it must have an inverse $a_{k}^{-1} = a_{j}$ where $k \neq j$. Thus $a_{1}a_{1}^{-1}a_{2}a_{2}^{-1} \cdot \cdot \cdot a_{n}a_{n}^{-1} = e$.   If there is exactly one $x \neq e$ in $G$ such that $x = x^{-1}$, then $a_{1}a_{2} \cdot \cdot \cdot a_{n} = x$.   This is stating that $x$ is not the identity element but is its own inverse. Then every other element $p$ must also have an inverse $a_{p}^{-1} = a_{w}$ where $p \neq w$. Similarly to the first question, a rearrangement can be done: $a_{1}a_{1}^{-1}a_{2}a_{2}^{-1} \cdot \cdot \cdot xx^{-1} \cdot \cdot \cdot  a_{n}a_{n}^{-1} = xx^{-1} = e$. And this is where I am stuck since I proved another statement.    Any comments would be appreciated for both problems. Windows 7 time issues Is my ESTA valid for a second trip? I visited the USA in May this year, on an ESTA which I applied for in April. It was approved and I was allowed entry into the country.    I'm re-visiting again this November for two weeks. Am I able to use the same ESTA again or do I need to re-apply for a new one? I know it says it's valid for two years, but is that valid for every use within those two years, or I have to use it within two years, and once I have visited on that visa, it's invalid? What exactly are DLL files, and how do they work? How exactly do DLL files work? There seems to be an awful lot of them, but I don't know what they are or how they work.  So, what's the deal with them? Something small goes wrong, and this triggers something slightly bigger, which triggers something slightly bigger, and so on and so forth until you end up with a chain of problems of increasing severity until it ends in catastrophy.  Something like the old saying "for want of a nail the battle was lost", only highlighting that each intermediate issue was a problem in its own right, not just a stepping-stone to the final disaster.  Is there a common word/phrase that specifically describes this? I'm thinking "cascade of ever-increasing problems", but this seems clumsy, and I suspect there might already be a neat word or expression that covers it. Lets say I have a loop in Bash:  for foo in `some-command` do    do-something $foo done   do-something is cpu bound and I have a nice shiny 4 core processor. I'd like to be able to run up to 4 do-something's at once.  The naive approach seems to be:  for foo in `some-command` do    do-something $foo &amp; done   This will run all do-somethings at once, but there are a couple downsides, mainly that do-something may also have some significant I/O which performing all at once might slow down a bit. The other problem is that this code block returns immediately, so no way to do other work when all the do-somethings are finished.  How would you write this loop so there are always X do-somethings running at once? Different methods of evaluating $\int\sqrt{a^2-x^2}dx$: Is there a simple and nice way to solve $\int\sqrt{a^2-x^2}dx$:  PS:I am not looking for a substitution like $x=a\sin p$, Proving an infinite number of primes of the form 6n+1 The proofs given on other sites weren't that clear and used different methods that I have yet to learn.    Prove that there are an infinite number of primes of the form 6n+1.  The hint that was given was: Let p = p1, p2, ..., pk + 1, where p1 = 2, p2 = 3,...pk are the first k primes.  Show that p is prime.  (p1 means p sub 1, p2 means p sub 2, and pk is p sub k.  Wasn't sure how to write it on this.)    Can someone explain this hint on how they came about of p1 = 2, p2=3, etc, and prove this please?    Also, how would the proof change if the form changed?  ("Prove that there are infinite number of primes of the form....") arcpy.env.overwriteOutput = True not working for one dataset