I would like to ask about upgrade of 13.10 to Ubuntu 14.04.  When I type in CL sudo update-manager after finding new version and beginning of an upgrade dialog appears saying:  Free translation:  Cannot calculate upgrade Unsolvable error  It could be  due: upgrading to devel release upgrading from devel release unofficial software packages   First one is not true, second neither, I am not using many unofficial packages.  What to do?
I just finished backing up my system and when I try to upgrade to Utopic Unicorn, I get the error "Cannot Calculate the upgrades." I ran the upgrade by sudo apt-get dist-upgrade, sudo do-release-upgrade after the GUI method failed, they all gave the same error.  The feedback gives some recommendations:  This can be caused by:  * Upgrading to a pre-release version of Ubuntu  * Running the current pre-release version of Ubuntu  * Unofficial software packages not provided by Ubuntu    I am not upgrading to a pre-release version nor coming from one, I'm going from Ubuntu 14.04 LTS to 14.10. I have no broken packages and I have unchecked all my non-official software sources in the 'Software &amp; Updates' manager.  My guess left is the Unofficial software packages not provided by Ubuntu. If anyone could give any help as to how to check for unofficial packages using Synaptic or another, my appreciation.  Are there any other factors that may be causing this error and how would I go about checking/fixing those?  Thanks.  Edit: I have no broken or held packages. Everything is up-to-date, and restarting everything or anything has no effect.
FAQ: Migrations What are the rules on migrations:   Migrations in general Migrations to public betas Migrations to private betas I am looking for a closed form (ideally expressed as elementary functions) of the function $\exp_n(x) = \sum_{k=0}^n x^k / k!$.  I am already aware of expressing it in terms of the gamma function. Background / Motivation When counting combinations of objects with generating functions, it is useful to be able to express the partial sum $1 + x + \cdots + x^n$ as $\frac{1-x^{n+1}}{1-x}$. For example, to count the number of ways to pick 5 marbles from a bag of blue, red, and green marbles where we pick at most 3 blue marbles and at most 2 red marbles, we can consider the generating function $f(x) = (1+x+x^2+x^3)(1+x+x^2)(1+x+x^2+\cdots)$. By using the partial sum identity, we can express it as $f(x) = \left(\frac{1-x^4}{1-x}\right)\left(\frac{1-x^3}{1-x}\right)\left(\frac{1}{1-x}\right)$.  Simplify, express as simpler product of series, and find the coefficient of the $x^5$ term. I want to be able to do the same for a generating function in the form $g(x) = \exp_{n_1}(x)^{p_1} \exp_{n_2}(x)^{p_2} \cdots \exp_{n_j}(x)^{p_j}$ The easiest way to extract the coefficient of a given term $x^p / p!$ would be to use a similar closed form expression for $\exp_n(x)$ and a similar technique to $f$. Attempted Solutions Differential equation Recall that the way to prove the identity $1+x+x^2+\cdots+x^n = \frac{1-x^{n+1}}{1-x}$ is to define $S = 1 + x + x^2 + \cdots + x^n$ and notice that: $S - Sx = 1 - x^{n+1}$. Likewise, notice that $y(x) = \exp_n(x)$ satisfies $y - y' = x^n/n!$.  Via SAGE, the solution is $y(x) = \frac{c+\Gamma(n+1,x)}{n!}e^x$.  Our initial condition $y(0) = 0$ so $c=0$.  By , $\Gamma(n+1,x) = n! e^{-x} \exp_n(x)$ so we have $y(x) = \exp_n(x)$. Recurrence Relation Notice that $\exp_n(x) = \exp_{n-1}(x) + x^n/n!$. Using the unilateral Z-Transform and related properties, we find that $\mathcal{Z}[\exp_n(x)] = (z e^{x/z})/(z-1)$. Therefore, $\exp_n(x) = \mathcal{Z}^{-1}\left[(z e^{x/z})/(z-1)\right] = \frac{1}{2 \pi i} \oint_C z^n e^{x/z}/(z-1)\;dz$. $(z^n e^{x/z})/(z-1)$ has two singularities: $z = 1$ and $z = 0$.  The point $z = 1$ is a pole of order one with residue $e^x$.  To find the residue at $z = 0$ consider the product $z^n e^{x/z} (-1/(1-z)) = -z^n \left( \sum_{m=0}^\infty x^m z^{-m} / m! \right) \left( \sum_{j=0}^\infty x^j \right)$.  The coefficient of the $z^{-1}$ term is given when $n - m + j = -1$. The residue of the point $z=0$ is then $-\sum_{m,j} x^m / m! = -\sum_{m=n+1}^\infty x^m / m!$. Let $C$ by the positively oriented unit circle centered at the origin.  By Cauchy's Residue Theorem, $\frac{1}{2 \pi i} \oint_C z^n e^{x/z}/(z-1)\;dz = \frac{1}{2 \pi i} 2 \pi i \left(e^x - \sum_{m=n+1}^\infty x^m / m!\right) = \exp_n(x)$. Finite Calculus I've tried to evaluate the sum using finite calculus, but can't seem to make much progress. Say i have this PHP code:  $FooBar = "a string";   i then need a function like this:  print_var_name($FooBar);   which prints:  FooBar   Any Ideas how to achieve this? Is this even possible in PHP? I need to generate random numbers within a specified interval, [max;min].  Also, the random numbers should be uniformly distributed over the interval, not located to a particular point.  Currenly I am generating as:  for(int i=0; i&lt;6; i++) {     DWORD random = rand()%(max-min+1) + min; }   From my tests, random numbers are generated around one point only.  Example min = 3604607; max = 7654607;   Random numbers generated:  3631594 3609293 3630000 3628441 3636376 3621404   From answers below: OK, RAND_MAX is 32767. I am on C++ Windows platform. Is there any other method to generate random numbers with a uniform distribution? Can Objective C determine the caller object reference at runtime (reflection)? How did Ron speak Parseltongue and re-enter the Chamber of Secrets? Although 'The Deathly Hallows' was overall an excellent conclusion to Harry Potter's saga, there were moments within the book that felt infuriatingly lazy, like Rowling was whipping the plot along regardless of the holes she tore in it. For me, the lowest point was when Ron gargles at the entrance of the Chamber of Secrets- and succeeds!- so he can get some Basilisk fangs to destroy a Horcrux (which are conveniently vulnerable to this venom).  This is, by itself, a shockingly slapdash deus ex machina, but even worse is how it is completely inconsistent with the guidelines Rowling herself set. First and foremost, Parseltongue is not just a language, but a magical ability that can only be learned through hereditary or magical means (Potter being the sole example of the latter). This is firmly established by the fact that even Dumbledore, the greatest wizard of all time and a polyglot, is completely unable to speak it despite understanding it perfectly.  Without linguistic knowledge nor inherent ability, the chances of making any kind of coherent sentence (let alone the right one!) would be incredibly slim even in the case of mundane languages; it would be like gibbering at a Filipino in the hope that what you said was fluent Tagalog and didn't insult their mother.  Other baffling issues somewhat related to my question are thus; even if Ron had somehow unlocked the gate, how did he make his way down? In the second novel, Lockheart's foolery demolished the main tunnel to the Chamber, making it impossible to access or leave; the fact that the teeth are still there also implies that the Chamber wasn't excavated and the rubble cleared in the interval. Granted, he could have tried Apparating, but then he wouldn't have needed to fake Parseltongue to begin with. Proof of the following inequality $ \frac{x - y}{\log x - \log y} > \sqrt{xy} $, $x>y$. I have seen the following inequality  $$ \frac{x - y}{\log x - \log y} &gt; \sqrt{xy} \ , \quad \forall x&gt;y $$ be stated as a near "obvious" fact in another , on the site.  The inequality is very cute, but so far I have not been able to prove it.  It reminds me of the Lipschitz inequality, but has some minor differences. Also Jensens inequality comes to mind. Is there something obvious I am missing, or is this ineqality not as easy to prove as it looks? Do messages in archive count to your inbox space? Pretty much as the title says, do messages in archive count to your total inbox space? Let $x &gt; 1$ and $a$, $b$ be positive integers. I know that $a$ divides $b$ implies that $x^a - 1$ divides $x^b - 1$. If $b = qa$, then  $$x^b - 1 = (x^a)^q - 1^q = (x^a - 1)((x^a)^{q-1} + \ldots + x^a + 1).$$  I'm interested in the converse of the statement. If $x^a - 1$ divides $x^b - 1$, does this imply that $a$ divides $b$? Is Firefox 57 multithreaded? According to  on MDN, Firefox 57 finally runs things in different processes.  So is Firefox 57 multithreaded?  In particular, how many cores does it use at most? Say I open 20 tabs at once on a quad-core machine, will Firefox 57 launch as many threads, or at least as many as needed to max out my CPU?  (Chromium for instance spawns a number of sub-processes and very easily uses all the resources available. Firefox up to 56 in GNU/Linux is rarely seen going over 135 % of one core however many tabs I open.) Signature/date line with fixed width Word for killing off or attempting to kill off an entire bloodline? Does the existence (now proved) of gravitational waves imply the existence of Gravitons? I studied the theoretical part about the Gravitational waves in General Relativity (linearization of gravity and small perturbations of the metric and so on).  But I was wondering about: since electromagnetic radiation is composed/carried by Photons (or better:the EM force), shall gravitational waves be composed/carried by Gravitons?   In the end:do gravitational waves imply the existence of gravitons? Or it's something unrelated and off topic? I've found conflicting sources over who initiated the idea of Marvel's Multiverse having numbered universes.  Some say Alan Moore's Captain Britain was the first to use Earth-616, whereas others indicate it was fan-created from Fanzines: with Mark Gruenwald's Omniverse being the frontrunner.  Who is responsible for creating the universe designations? Is there any credible information on their development? Is there a formal spelling for the English letter names? Do the parent directory's permissions matter when accessing a subdirectory? Let $C$ be the coefficient of $x^2$ in the expansion of the product $(1 - x)(1 + 2x)(1 - 3x)\cdots(1 + 14x)(1 - 15x).$ Find $|C|.$   Just to begin,  $(1-x)(1+2x) = -2x^2 + x + 1$  $(1-x)(1+2x)(1-3x) = 6x^3 - 5x^2 - 2x + 1$   But expanding on like this take too long.  In the end the terms will be like:  $(1 - 15x)(a_0 + a_1x^1 + a_2x^2 + ....)$  Then just looking at the $x^2$, it will be:  $(a_2x^2 - 15a_1x^2) = x^2(a_2 - 15a_1)$  But it it still a very hard problem, any hints? An invalid argument, the conclusion of which is a tautology Why it is not possible to have such argument?  I found some textbook Introduction to Formal Logic and this is from one of the first excercises. This is marked as impossible, but I do not understand why. Navigation bar is too long on progressbar theme, can it wrap? My navigation bar at the top of each slide (that links to each section) has too many sections. I would like to keep the bar and keep each section but I would like to wrap it i.e. have it on two lines.  Is that possible?  I am using compress and I am using  as a theme. Is it acceptable to change colors on a logo to make it fit a website's theme? I have a few payment brand images that need to go in the footer of a website, the footer is very dark grey, to the point where making the logos grey-scale wouldn't be much of a good idea, especially as we still need the logos to stand out.  For example I took the following logo:   And changed it to fit with our very dominant red theme:    Is this good in terms of the user's perspective? Is this legal or misrepresenting the brand? If so is completely changing a logo to white acceptable for dark backgrounds?