I have been waiting for 16.04.1.  On 22/07/16, I received the email from Adam Conrad, informing that the upgrade was now available.  I opened Software Updater, but it only offered me an upgrade to 15.10.  Why is this?  Garry  The upgrade was offered to me late on Friday 29/07/16 (Australian EST).  Thanks for the comments...
So, today is July 21st and . gives me an option to download 16.04.1 LTS. However, attempting to upgrade gets me this message -  $ sudo do-release-upgrade Checking for a new Ubuntu release No new release found   What is wrong? Does it matter that I am running apt-get update behind apt-cacher-ng?  Note: Commenting out the files in apt.conf.d that used apt-cacher-ng did not make a difference.  Edit: Explanation for possible duplicates:  deals with upgrade from 12.04LTS to 14.04LTS. My question is specific to 14.04 LTS to 16.04.1 LTS upgrade. Old answers, while good for archival purposes are less relevant in a fast changing package like ubuntu. Moreover none of the answers answer what is wrong. The link  pointed out is mentioned in one of the comments. This Q &amp; A is more helpful for people upgrading today than the work around mentioned in "".
Can anyone enter as a student at the Citadel ? Or must one be recommended by Lords or a powerful institution?   Aemon Targaryen was a son of a King, so the Citadel would let him access without questioning. Samwell Tarly was sent by Lord Commander Jon Snow, from the Night's Watch. , a novice of the Citadel. A common born but it is not known how he entered the Citadel. We can notice that he is not a good student, but has not been fired.    I don't remember how the other Maesters were recruited, if they are always relatives of Lords, Kings... Can any lowborn commoner just "knock the door", and enter the Citadel? Recurrence relation for number of ternary strings that contain two consecutive zeros The question is: Find a recurrence relation for number of ternary strings of length n that contain two consecutive zeros.    I know for ternary strings with length one, there are 0. For a length of 2, there is just 1 (00), and for a length of 3, there are 5 (000,001,002,100,200).    I did a similar problem, finding a relation for the number of bit strings of length n with two consecutive zeros: $$a_n = a_{n-1} + a_{n-2} + 2^{n-2}$$    Since you can add "1" to the end of all the $a_{n-1}$ strings, "10" to all the $a_{n-2}$ strings, and "00" any string of size $n-2$.    For the ternary string problem, I'm pretty sure you would replace the $2^{n-2}$ with $3^{n-2}$, but confused about the other terms of the relation. My guess is that it would have the coefficient $2$ in front of the other terms, since you can add either $1$ or $2$ to the end of $a_{n-1}$ and either $01$ or $02$ at the end of $a_{n-1}$.    So I believe the answer for the relation is: $$a_n = 2a_{n-1} + 2a_{n-2} + 3^{n-2}$$    How does that look? Minecraft Survival Mode Storing Images in DB - Yea or Nay? So I'm using an app that stores images heavily in the DB. What's your outlook on this? I'm more of a type to store the location in the filesystem, than store it directly in the DB.  What do you think are the pros/cons? Proof that the One-Dimensional Simple Harmonic Oscillator is Non-Degenerate? The standard treatment of the one-dimensional  (SHO) using the raising and lowering operators arrives at the countable basis of eigenstates $\{\vert n \rangle\}_{n = 0}^{\infty}$ each with corresponding eigenvalue $E_n = \omega \left(n + \frac{1}{2}\right)$. Refer to this construction as the abstract solution.  How does the abstract solution also prove uniqueness? Why is there only one unique sequence of countable eigenstates? In particular, can one prove the state $\vert 0\rangle$ is the unique ground state without resorting to coordinate representation? (It would then follow that the set $\{\vert n \rangle\}_{n = 0}^{\infty}$ is also unique.)  The uniqueness condition is obvious if one solves the problem in coordinate representation since then one works in the realm of differential equations where uniqueness theorems abound. Most textbooks ignore this detail (especially since they often solve the problem both in coordinate representation and abstractly), however I have found two exceptions:   Shankar appeals to a theorem which proves one-dimensional systems are non-degenerate, however this is unsatisfactory for two reasons:   Not every one-dimensional system is non-degenerate, however a general result can be proven for a large class of potentials (the SHO potential is in such a class). The proof requires a departure from the abstract solution since it classifies the potentials according to their functional properties.  Griffiths addresses this concern in a footnote stating that the equation $a \vert 0\rangle = 0$ uniquely determines the state $\vert 0\rangle$. Perhaps this follows from the abstract solution, however I do not see how. Is convex hull of a finite set of points in $\mathbb R^2$ closed? Is the convex hull  of a finite set of points in $\mathbb R^2$ closed? Intuitively, yes. But not sure how to show that. Thanks! Show that $\sin(z) = z$ has infinitely many solutions in complex numbers. Little Picard theorem should help, but using big Picard theorem is undesirable. Thanks a lot! Is there a difference between “?!” and “!?”? System.ListException: Before Insert or Upsert list must not have two identically equal elements - Deep Dive I had the following exception thrown at me when trying to process more than one selected records via a custom button in the list view.    Class Code  global class MerchandiseInventoryClass {      webservice static void ConverttoInventory(String[] merchandise_id)    {        //Convert Merchandise collection into Inventory Collection...         Merchandise__c[] merchandise_collection = [SELECT ID,Author__c,Book_Title__c,Edition__c,Publisher__c,Total_Merchandise_QtyTotal_Qty__c,Status__c FROM Merchandise__c WHERE ID = :merchandise_id];          Inventory__c i = new Inventory__c(); //Line 1        List&lt;Inventory__c&gt; newInventory = new List&lt;Inventory__c&gt;();        for(Merchandise__c m : merchandise_collection )        {            if(m.Status__c !='Fully Converted')            {            i.Author__c = m.Author__c ;            i.Book_Title__c = m.Book_Title__c;            i.Edition__c = m.Edition__c;            i.Publisher__c = m.Publisher__c;            i.Qty_Available__c = m.Total_Merchandise_QtyTotal_Qty__c;            i.Merchandise__c = m.Id;            m.Uninventoried_Qty__c = 0;            m.Status__c = 'Fully Converted';            newInventory.add(i);            }        }        insert newInventory;        update merchandise_collection;    }  }   By moving the Line 1 to within the for loop solved the issue for me.  Thanks to this post (refer the Best Answer in that post)    What puzzles me is that WHY i have to instantiate "i" for every iteration within the loop.  Why the list collection ("newInventory") is complaining that are duplicate elements and why should it even confuse in the first place when I am performing an "insert" even ? When and how did "pretty" enter English as an intensifying adverb? Today I saw an idiomatic road sign: "Pretty Muddy". I found this lack of strict English on a road sign unusual (on par with my "Dead Slow" official speed limit sign in Leeds, pic below), but as it turned out it's a charity race and the signs were merely directions.  This got me thinking however, how do words like "pretty" and "dead" as   end up in English? Taking "pretty" as an example, when did this first appear?     I wonder how fast you have to be going before they stop you. How would this hold up in court? Is there a way to bypass resistance/immunity to fire damage? I want to use fire-based spells for thematic reasons and a lot of things have immunity to it.   Is there a feat or class feature I could use to bypass/reduce those? For example, is there something that ignores fire resistance and reduces fire immunity to just resistance?   I know the easy way around it is just to pick another damage type spell but I really want to roleplay a pyromancer/firebender-type character. Does anyone know if there is an API to get the current monitor state (on or off) in Windows (XP/Vista/2000/2003)?  All of my searches seem to indicate there is no real way of doing this.    tries to use  which according to Microsoft's docs does not work for display devices.   In Vista I can listen to  but I do not seem to get events when the monitor is turned off manually.   In XP I can hook into WM_SYSCOMMAND SC_MONITORPOWER, looking for status 2. This only works for situations where the system triggers the power off.   The WMI Win32_DesktopMonitor class does not seem to help out as well.   Edit: Here is  on comp.os.ms-windows.programmer.win32 indicating there is no reliable way of doing this.   Anyone else have any other ideas? GOTO still considered harmful? Everyone is aware of Dijkstra's  (also  .html transcript and  .pdf) and there has been a formidable push since that time to eschew the goto statement whenever possible. While it's possible to use goto to produce unmaintainable, sprawling code, it nevertheless remains in . Even the advanced  control structure in Scheme can be described as a sophisticated goto.  What circumstances warrant the use of goto? When is it best to avoid?  As a followup question: C provides a pair of functions, setjmp and longjmp, that provide the ability to goto not just within the current stack frame but within any of the calling frames. Should these be considered as dangerous as goto? More dangerous?    Dijkstra himself regretted that title, for which he was not responsible. At the end of  (also  .pdf) he wrote:     Finally a short story for the record.   In 1968, the Communications of the ACM   published a text of mine under the   title "The goto statement considered   harmful", which in later years would   be most frequently referenced,   regrettably, however, often by authors   who had seen no more of it than its   title, which became a cornerstone of   my fame by becoming a template: we   would see all sorts of articles under   the title "X considered harmful" for   almost any X, including one titled   "Dijkstra considered harmful". But   what had happened? I had submitted a   paper under the title "A case against   the goto statement", which, in order   to speed up its publication, the   editor had changed into a "letter to   the Editor", and in the process he had   given it a new title of his own   invention! The editor was Niklaus   Wirth.   A well thought out classic paper about this topic, to be matched to that of Dijkstra, is , by Donald E. Knuth. Reading both helps to reestablish context and a non-dogmatic understanding of the subject. In this paper, Dijkstra's opinion on this case is reported and is even more strong:     Donald E. Knuth: I believe that by presenting such a   view I am not in fact disagreeing   sharply with Dijkstra's ideas, since   he recently wrote the following:   "Please don't fall into the trap of   believing that I am terribly   dogmatical about [the go to   statement]. I have the uncomfortable   feeling that others are making a   religion out of it, as if the   conceptual problems of programming   could be solved by a single trick, by   a simple form of coding discipline!" He is loved.   This is something that I've always kind of wondered.  In a sentence like this, is loved a verb or an adjective? Can it be considered either? Sometimes it is convenient to use an absolute path to include a preamble. To do so, I use the following "hack":  \documentclass[a4paper, 12pt]{article} \newcommand{\folder}{/path/to/folder} \input{\folder/preamble}  \begin{document} \end{document}   Now my question is, whether there is a more elegant way to do this, especially a way which is compatible with one of the flatten scripts from  ? As the title says. How do I get from  $\frac{n}{\varphi(n)}$ to $\sum\limits_{d \mid n} \frac{\mu^2(d)}{\varphi(d)}$?  I know that $$\frac{n}{\varphi(n)}=\frac{\sum\limits_{d \mid n} \varphi(d)}{\sum\limits_{d \mid n} \mu(d)\frac{n}{d}},$$ and I suspect it is down this road I should go. But I get totally confused by the sums and I have no clue on how to divide them and "combine" them into one again. Any hints or advice would be much appreciated. How to correctly do a division using a slash? What's the correct way to do division using a backslash? If I write $a/bc + d$, will that be equal to $(a/(bc))+d$?   Basically, if I place a slash, will I divide by what's directly behind the slash $(b)$, the term that's behind the slash $(bc)$, or everything after the slash $(bc+d)$? Decoupling caps, PCB layout What are the possible catch bonuses and how much experience do they reward? I have 2 graphics cards (Tesla k10, K40) in my supermicro SuperServer (7047GR-TPRF). I installed Ubuntu Server 14.04, but when I install cuda or Nvidia graphics driver (version 311 or 340), my Ubuntu desktop hangs on login.