Every time I type a question in Stack Overflow , I occasionally see a "Draft Saved" string under the question area. Does this mean that Stack Overflow has a draft saving feature? If so, how is it used?
Many times it takes me a while to properly compose my question before posting. Sometimes it's just a jumble of ideas and concepts, and is not something I'd want seen immediately. However, there is no way to save a partial question unless you post it.  This should work exactly like it does in Gmail. There, once you start composing your question, it's autosaved as a draft. If your browser crashes or you need to come back later to complete it, it will be there for you to finish and post later.  Optionally, allow multiple draft questions and a page to edit/delete them. If needed, make them expire after some amount of time.
I was hoping to find a more "mathematical" proof, instead of proving logically $\displaystyle \sum_{k = 0}^n {n \choose k}^2= {2n \choose n}$.  I already know the logical Proof:  $${n \choose k}^2 = {n \choose k}{ n \choose n-k}$$  Hence summation can be expressed as:  $$\binom{n}{0}\binom{n}{n} + \binom{n}{1}\binom{n}{n-1} + \cdots + \binom{n}{n}\binom{n}{0}$$  One can think of it as choosing $n$ people from a group of $2n$  (imagine dividing a group of $2n$ into $2$ groups of $n$ people each. I can get $k$ people from group $1$ and another $n-k$ people from group $2$. We do this from $k = 0$ to $n$. Unable to modify files/folders in NTFS partition wildcard * in CSS for classes Determining the name of the VMware host of a VM guest - from the guest Prove that: area of triangle $S_{ABC}=p \cdot R$, where p is half perimeter of triangle $DEF$ Prove that: area of triangle $S_{ABC}=p \cdot R$, where p is half perimeter of triangle $DEF$. $AD,CF, BE$ are altitudes. Is there a simple way? Find the population size that maximizes the probability that two random samples of size $20$ will have exactly $2$ members in common Ten fish are caught in a lake, marked, and then returned to the lake. Two days later 20 fish are again caught, 2 of which have been marked.  (a) Find the probability of 2 of the 20 fish being marked if the lake has $k$ fish (assuming the fish are caught at random). (b) What value of k maximizes the probability?    Progress:     I got the (a), $$\binom{10}{2}\binom{k-10}{18}\bigg/ \binom{k}{20}$$ But how do I get part (b) where $k$ is to maximize the probability? I understand that the first point release of Ubuntu 18.04, namely 18.04.1 is now available and that my system should now offer it as an update.  My current OS version is 16.04.5 LTS. In System Settings/Software and Updates I have set 'Notify me of a new Ubuntu version' to 'For long term support versions'. I have tried both the main server and the server for United Kingdom, neither offers an update when Software Updater is clicked or via the Ubuntu Software icon.  Can anyone please tell me why I don't get the option of updating to 18.04?  Edit:  I don't remember the details exactly, but I think that my last LTS point release update was offered automatically a lot sooner after the published release date than where we are now with 18.04.1.  Edit 10th August  It appears that there has been some problem with the update process and that it should be fixed next week, see:    Edit 14th August 18.04.1 LTS now available from UK server, I can’t get used to the new Unity system. I’d like to move the left Unity panel to the bottom of screen (like Windows 7 – more similar is better).  But I can't find a way. Is it possible? In previous Ubuntus (GNOME, not unity) I could add "--incognito" to the end of the executable file command of Chrome to make Incognito default.  I cannot find an executable file for Chrome in 12.04. How do I make Incognito default for Chrome in 12.04? I want to write batch or something, that will write output of top into a file on login.  I did top &gt;&gt; output-file, but it contains some strange character!  Can somebody give a simple tutorial about how to write batch file in Linux? Convert from a specifc range to another one I asked a question regarding a very specific feature of a program and whether or not it works with a larger program.  Within hours someone had marked it with "This question may already have an answer here of a similar question, but not related to my question.  The question I asked IS NOT ADDRESSED in the referred-to question. It's frustrating to spend half an hour putting together an intelligent and specific question, and then have someone mark it as a duplicate (or possible duplicate), which apparently causes people to skip over my question. I haven't received any more responses since the question was flagged.   Two questions:  (1) How do I get this flagging removed and (2) what's the best way to prevent these "helpful" flaggings in the future? Computing the $n^{\textrm{th}}$ permutation of bits. I've seen  post about the $n^{\textrm{th}}$ permutation of a set but that is not what I need. If you have a bit string (ones and zeros only) there are  to quickly permute the NEXT lexicographically ordered bit permutation. For example take $$000111 \rightarrow 001011 \rightarrow 001101\rightarrow\cdots$$ etc. If the string is long then there are going to be approximately one Bajillion of these things. And I want to know how to compute the $n^{\textrm{th}}$ guy without doing the exhaust.  Backgound: This is for a parallel computing job where I need to farm out the search space of elements of a set.  Foreground: I own a copy of Knuth's 4th volume of "The Art of Computer Programming" and I think the answer is in there but I can't seem to find it. (It's like 900 pages).  I'm posting here in the hopes that someone has knowledge of this (obviously). Even if you can point me to a source, say the part in Knuth's book where he describes this problem I would be most grateful. When & how did Yoda come to know about the Rule of Two? I have a bunch of SD cards that do not have the little plastic switch for the read only setting. so Windows thinks it’s write protected or something. The card is not write protected by the software lock present on the SD card standard.  I’m using one with tape over the notch and it’s ugly. Also, the Thinkpad slot drags on the tape all the time so I’m afraid it will might loose in there eventually.  So, is there any way to tell Windows to ignore this lame write-protect feature?  I’m not interested on the SD card itself as it’s irrelevant for the issue at hand. Read this question as being about a 5.25” floppy disk drive instead of an SD card if you wish. I’m pretty sure the Windows settings are the same for both, really.  I’m  that there are 3 ways to secure an SD card. I’m talking about only the mechanical switch, which is the responsibility of the host to handle. Multi armed bandit for general reward distribution I'm working on a multi-armed bandit problem where we do not have any information about the reward distribution.   I have found many papers which guarantee regret bounds for a distribution with known bound, and for general distributions with support in [0,1].   I would like to find out if there is a way to perform well in an environment where the reward distribution does not have any guarantees about its support.  I'm trying to compute a nonparametric tolerance limit and using that number to scale the reward distribution so I can use the algorithm 2 specified on this paper (). Does anyone think this approach will work?  If not, can anyone point me to the right spot?  Thanks a bunch! What are the Undying Lands? I've heard a lot about the Undying Lands but I don't fully understand how they're different from Middle-earth and why only certain people/races are allowed to go there.  Can someone explain? What does // mean in a path? I was working in my terminal, when I misspelled while cd to root (/). Accidentally, I typed // and I got in terminal:  root@weblocalhost://#   When i type pwd, i get response // but when I type ls -s i got same list as in / directory.  When you type more than 2, i.e. /// you get:  root@weblocalhost:/#   Always 1 / except for 2. Is there any difference and what is // for? What is the name of the vertical bar in $(x^2+1)\vert_{x = 4}$ or $\left.\left(\frac{x^3}{3}+x+c\right) \right\vert_0^4$? I've always wanted to know what the name of the vertical bar in these examples was:  $f(x)=(x^2+1)\vert_{x = 4}$ (I know this means evaluate $x$ at $4$) $\int_0^4 (x^2+1) \,dx = \left.\left(\frac{x^3}{3}+x+c\right) \right\vert_0^4$ (and I know this means that you would then evaluate at $x=0$ and $x=4$, then subtract $F(4)-F(0)$ if finding the net signed area)  I know it seems trivial, but it's something I can't really seem to find when I go googling and the question came up in my calc class last night and no one seemed to know. Also, for bonus internets; What is the name of the horizontal bar in $\frac{x^3}{3}$? Is that called an obelus? Magic leaves "smudges" and a sorceress becomes a book I could use some help identifying a book I read some time in the last year or so. The book goes between two different stories:  1) A student of magic finds a book in a cave that turns out to be a person transformed into a book. The book talks to the student and they share thoughts. At some point, the student runs away, chase ensues, and at the very end of the book, he manages to travel to another plane.  2) A girl in a religious society where magic is forbidden. She is the daughter of painters. She discovers she can see magic. Falls in love with some random painter, risks performing magic to not be pregnant, does it again so she can, and is arrested and sent to some prison thing.  The common element between the stories is that magic use leaves behind a smudge of some kind that can be visible.  Any assistance is appreciated.