$ sudo apt-get install mysql-server [sudo] password for user:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package mysql-server   I am using Ubuntu 14.04.
I just installed Ubuntu 12.10 (amd64), and want to install a recent version of MySQL 5.6.  If possible, I would like to install (not upgrade) it the "Debian Way' (i.e., using apt-get or dpkg).
Ubuntu 20.04 still supporting Python2 Fundamental Theorem of Algebra - an elementary complex analysis proof? We begin by assuming that a non-constant complex polynomial $$p(z)=a_n z^n+a_{n-1}z^{n-1}+...+a_1 z+a_0,$$ where $a_0 \neq 0$, doesn't vanish in $\mathbb{C}$. Therefore $1/p$ is also an analytical function everywhere. Note that $(p(z)-a_0)/z$ is a polynomial and therefore, due to Cauchy's theorem, the following integral must be zero.  $$\int_{S_r^1}\frac{(p(z)-a_0)/z}{p(z)}dz=\int_{S_r^1}\frac{a_nz^{n-1}+a_{n-1}z^{n-2}+...+a_1}{a_nz^n+a_{n-1}z^{n-1}+...+a_1 z+a_0}dz=0.$$  On the other hand  $$\int_{S_r^1}\frac{a_nz^{n-1}+a_{n-1}z^{n-2}+...+a_1}{a_nz^n+a_{n-1}z^{n-1}+...+a_1 z+a_0}dz$$  $$=\int_{0}^{2\pi}\frac{a_n(re^{i\theta})^{n-1}+a_{n-1}(re^{i\theta})^{n-2}+...+a_1}{a_n(re^{\theta})^n+a_{n-1}(re^{i\theta})^{n-1}+...+a_1 (re^{i\theta})+a_0}(ire^{i\theta})d\theta$$  $$=\int_{0}^{2\pi}i d\theta - \int_{0}^{2\pi}\frac{a_0 i}{a_n(re^{i\theta})^n+a_{n-1}(re^{i\theta})^{n-1}+...+a_1 (re^{i\theta})+a_0}d\theta$$ $$=2\pi i -\int_{0}^{2\pi}\frac{a_0i}{p(re^{i\theta})}d\theta.$$  Let $r \rightarrow \infty$ and the integral approaches value $2\pi i$ - a contradiction. Therefore $1/p$ can't be entire and $p$ must vanish somewhere in the complex plane.  EDIT: I have changed this post and deleted the idea that the integral $\int_{\partial D_r}\frac{(p(z)-a_0)/z}{p(z)}dz=0$ could be evaluated with the fundamental theorem of calculus. Now, as it stands, this proof is essentially the same as the one that Mr. José Carlos Santos points out in his comment. In CodeGear Delphi 2007, how can I turn specific warnings and hints off? I am attempting to turn off H2077 - Value assigned to 'varname' never used. I understand intuitively that this is true, but I'm embarrassed to say I'm having a hard time constructing a rigorous proof that $|a+b| \leq |a|+|b|$. Any help would be appreciated :) How do I unlock all the other ships in the hangar? Find the maximum value of $72\int\limits_{0}^{y}\sqrt{x^4+(y-y^2)^2}dx$ Find the maximum value of $72\int\limits_{0}^{y}\sqrt{x^4+(y-y^2)^2}dx  $ for $y\in[0,1].$  I tried to differentiate the given function by using DUIS leibnitz rule but the calculations are messy and I tried to solve directly by integrating it but that also is not working.Can someone please help me in solving this question? Bash while read loop breaking early Lightning force:createRecord capture redirect after save Is there a way to use force:createRecord but capture the redirect to the newly created record page that occurs after saving the record? Finally, prevent the redirect from completing?  createRecord : function (component) {     var createRecordEvent = $A.get("e.force:createRecord");     createRecordEvent.setParams({         "entityApiName": "Event__c"     });     createRecordEvent.fire(); } How prove this $\sum_{k=1}^{2^{n-1}}\sigma{(2^n-2k+1)}\sigma{(2k-1)}=8^{n-1}$ Given the positive integer numbers $n$,prove that $$\sum_{k=1}^{2^{n-1}}\sigma{(2^n-2k+1)}\sigma{(2k-1)}=8^{n-1}$$  where $\sigma(n)$ is defined as $$\sigma{(N)}=\sum_{d|N}d$$  This problem I think is very interesting, and have nice methods?  Thank you everyone.  and I find some of this     or can see: Why are there 2 packages for some applications (e.g. Chromium) in Ubuntu Software? If $f(0)=0$ and $f'$ is increasing, then $\frac{f(x)}{x}$ is increasing. 30" monitor has black border around desktop I have been using a 24" monitor with my macbook pro early 2011 connected via a mini display port to DVI adaptor.  I recently received an HP Z30i 30" monitor.  When I connect to it with an mini display port to display port adaptor, although it displays at the monitors native 2560x1600 resolution, the mac is scaling the desktop display down so as to leave a 1cm or so black border around the desktop.  The mac reports using a resolution of 2560x1600 and the display reports this also.   This makes the display blurry as single pixels become sub pixels.   The display looks like the same effect as having "under scan" turned on when using an HDMI cable at 1080p.  I thought that maybe there was a hardware or display problem, but when I boot off a previous system partition from a different hard-drive using the same OS (10.8.5) release, the monitor set up works perfectly.  This proves the OS release, display and the hardware, so I'm thinking that there must be a preferences problem with my current setup.  Perhaps the under scan setting is somehow being applied to this display when it's not using HDMI?  I've tried deleting /Library/Preferences/com.apple.windowserver.plist, ~/Library/Preferences/ByHost/com.apple.windowserver.HostNumber.plist and rebooting but no results.   The scaling is applied before the login screen and logging in as a different user has the same problem.  Any ideas?  It's driving me nuts, I've got this nice 30" screen and I can't use it! Capacitance of a single charged plate? Lets say we have a single plate that has a charge of $+Q$ on it. A plate with charge $-Q$ is infinite distance away. Will the plate with $+Q$ have a capacitance associated with it? Why or why not? I was thinking that because the distance between the plates is infinity, the capacitance is zero, but according to my TA, that is not the case. There is always some sort of "absolute" capacitance for the plate with $+Q$ (a capacitance will exist between the plate and air?). Can someone help me out in understanding this? I will be transferring between two international flights at Tokyo Narita airport. I'm scheduled to depart the same day I arrive. I am planning to stay within the airport during the layover. Does anyone know if I will require a transit visa at Narita? I'm sorry if this question goes against the meta for posting questions - I attached all the "beware, this is a soft-question" tags I could.  This is a question I've been asking myself now for some time. In most areas, there's a "cut off age" to be good at something. For example, you're not going to make the NHL if you start playing hockey at 20. It just won't happen.  So my question then, how late is too late to start studying math and make a career out of it? By "start studying math" I mean, to really try to understand and comprehend the material (as opposed to just being able to do well in a formal, intuitional environment).   I don't mean this from a "do what you love, its not too late" motivational perspective. I mean this from a purely biological perspective; at approximately what age has your brain's capacity to learn effectively and be influenced by your learning stop? When does the biological clock for learning new math run out?  My reasoning for asking this question is (for those who care): I love math. Really I do. But , having spent the first 21 years of my life in sports/video games/obtaining a degree in a scientific field which I care nothing of/etc, despite all my best attempts at trying to learn math, am I just too late starting to ever actually be good enough at it to make it a career? I've almost completed my second degree (in Math), but find that in many cases, despite how I look at a problem, I lack the intuition to comprehend it. I'm going to single him out (sorry), only as an example, but Qiaochu Yuan is my age.   Note 1: If this question isn't a suitable post, I won't be offended at all if you vote to close - I know this question borders what's acceptable to ask.  Note 2: Thanks to everyone for reading and taking the time for the great responses. Really appreciate it! 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? Windows 8 Pro clean install - everything slow; hard drive at constantly at 100% Yesterday, I have downloaded and installed Windows 8 Professional, after downloading it (legally) and burning it to a DVD, on my 3-year-old  (Intel Core Duo 2x2.4&nbsp;GHz, 4&nbsp;GB RAM,  hard disk drive).   The installation failed two or three times, each time differently (error codes, for example 0xc000021a, with an infinite boot loop), but finally I completely formatted the hard drive and installed. Seemingly, everything was OK.  However, after booting successfully, the OS is extremely slow. When I open the task manager, it shows that the HDD is at 100% - however, no application or background process or Windows process can be made responsible. I searched the Internet and found that Windows might try to "index" the hard drive, but I did't find a process that isn't also on my second computer, which still uses the Release Preview (restarting every two hours). Also, the startup is empty, and HD Tune and HDD Health show that the drive health is OK, even though I don't know how reliable these two programs are.  I looked for diagnose software from Toshiba, but they only offer tools for "Fujitsu branded Toshiba devices"; I tried it out, and it did not work on my hard drive.  Does this sound like a hard drive failure? The laptop is 3.5-years-old, has been carried around sometimes roughly and was used (and on) most of the time. However, it would have failed exactly the night before installing Windows&nbsp;8 Profesional, which seems - unlikely.  If this is a software error - then what did I do wrong if this occurs from the moment of installation (even the personalization at the end of installation took half an hour)? How can I fix this? I'm having trouble with this functional equation, to find all functions $f:\mathbb R \to \mathbb R$ for which the following is valid for all $x,y\in \mathbb R$: $f(x) + f(x+f(y)) = y + f(f(x) + f(f(y)))$ I haven't been able to pinpoint any solution, nor to prove surjectivity or injectivity. So 0 progress. Tried with $x=y=0, x=0, y=0, x=-f(y), y=f(x)$, and even with some assumptions on bijectivity, but nothing helped. I don't know the source but seems like a pretty difficult problem, maybe even impossible to solve. Approximating $\arctan x$ for large $|x|$ I would like to know if there is reasonably fast converging method for computing large arguments of arctan.  Until now I've came across Taylor series that converges only on interval $(-1,1)$ and for increasing $|x|$ the rate decreases. Also I've found about continued fractions for arctan, which seems to converge more rapidly and can be used for any real number, but again with increasing $|x|$ I need to perform way too much iterations until I get at least 3 digits precision.  I'm therefore looking for a method that would allow me to compute arctan for large arguments with good precision and in reasonable amount of iterations. We have played a 7-team competition, all seven teams met, we eliminated the team with the lowest points. After that the remaining six teams played knock out games and the three winning teams will go direct to semi-finals.  We decided that 4 teams should be picked to go for semi-final and that the best loser will join the other three to make it four teams to battle at the semi-final and final.  During the quarter final games, one team is beaten 2-0, another is beaten 3-0 and the third team is beaten in a penalty shoot-out by 4-0.  Now should you want a best loser to join the other three teams making four teams to play in the semi-final, who among these three teams would be in the best losers position.