Is there any command that mimics the double tab list in bash?
How to output string completions to stdout?
Why can't you use the keyword 'this' in a static method in .Net? Any way to change my review of suggested edit? I goofed and rejected a suggested edit, a vote that was actually directed at the previous edit that I was reviewing. As this is unfair to the user who posted the suggested edit in question, is there any way in which to change/cancel my reject? A riddle about guessing hat colours (which is not among the commonly known ones) This is a riddle I heard recently, and my question is if someone happens to know the solution. I'm asking this out of curiosity more than anything else.  So here it is. The riddle is one of the countless variations of the "prisoners have to guess their hat colour" puzzle. $n$ prisoners are put a hat on top of their head, which can be red or blue. The colours are chosen at random by $n$ independent fair coin tosses. Then each prisoner can guess their own hat colour (red or blue) or pass. The prisoners can see each other, but not hear each other's calls and of course they have no other means of communication. This means that each call can only depend on the other prisoners' hat colours. However, before the distributing of hats begins, the prisoners are told the rules and can agree on a strategy. The prisoners win iff no prisoner guesses wrong and at least one prisoner guesses right. Which strategy should the prisoners use so that the winning probability becomes maximal?  Some remarks:   A simple strategy is that one player just guesses and all other players pass, so that the maximal probabilty is at least 1/2. For $n=2$ this strategy is optimal. For $n=3$, there is a strategy that wins in 6 out of 8 cases: When a player sees (red,red) he guesses blue, for (blue,blue) he guesses red, and otherwise he passes. More generally this shows that the maximal probability is at least 3/4 for $n\ge 3$. It's possible to show that any strategy fails for at least 2 hat colour configurations (unless $n=1$), which shows that the above strategy is optimal for $n=3$. For $n=4$ there are more than $10^{15}$ strategies, and for $n=5$ it's about $10^{38}$ strategies, making it quite infeasible to just use a brute-force computer program (maybe for $n=4$ it's possible when exploiting the obvious symmetries). When changing the rules slightly by forbidding players to pass, then the maximal winning probability is always 1/2. This is a nice little exercise.   Actually I heard the riddle only for $n=3$ and then thought about the general $n$. So it's entirely possible that there is no nice solution. Whenever I startup from the LinuxLive USB, and try to install Ubuntu 12.04, it only gives me two options instead of the usual 3 or 4. My options are "Replace Windows 7 with Ubuntu" and "Something Else". Whenever I go into "Something else", it looks extremely confusing. How do I install it side-by-side while using the "Something else" section? These are my partitions.   /dev/sda /dev/sda1 ntfs (104Mb, System Required Partition) /dev/sda2 ntfs (1000097Mb, Windows 7 Partition)   Or should I try reinstalling my installer on a CD rather than USB and maybe then it will have the "Install alongside" function? $|e^a-e^b| \leq |a-b|$ for complex numbers with non-positive real parts The swarms of dead men fighting for the good side always seemed wrong to me. I know they did it to be released from their plight, but.... It's one thing to curse somebody, it's quite another to back it up. How did Isildur back up his curse on the oath breaking men of Dunharrow? Text won't appear in interface? There is one problem, it seems that text won't appear on my program. The three images show the errors and also my laptop specs (I believe I just have very small amount of laptop power that makes Blender glitch).  Everything else works fine (zooming, panning, rotating, etc.) and the buttons are still there and do what they're supposed to do, but the text just won't appear.  Might anybody know how to fix this?        The drive update didn't help either. I know a way around it though, does anybody know a page which shows screenshots of more or less the buttons on blender I installed Oneiric as a guest OS in VirtualBox using the Mini CD. I installed the ubuntu-desktop package and everything seems to work fine - well, except for a font issue with the terminal:    As you can see, some of the letters overlap and it's difficult to read. I checked the settings and it the checkbox "Use the system fixed width font" is checked with "Monospace | 12" selected underneath it.    Edit: running the commands mentioned in the comments:  $ fc-match "Monospace" DejaVuSansMono.ttf: "DejaVu Sans Mono" "Book" $ gconftool --get /desktop/gnome/interface/monospace_font_name Monospace 10 $ debsums ttf-dejavu-core /usr/share/doc/ttf-dejavu-core/AUTHORS                                        OK /usr/share/doc/ttf-dejavu-core/BUGS                                           OK /usr/share/doc/ttf-dejavu-core/NEWS.gz                                        OK /usr/share/doc/ttf-dejavu-core/README                                         OK /usr/share/doc/ttf-dejavu-core/changelog.Debian.gz                            OK /usr/share/doc/ttf-dejavu-core/copyright                                      OK /usr/share/doc/ttf-dejavu-core/langcover.txt.gz                               OK /usr/share/doc/ttf-dejavu-core/status.txt.gz                                  OK /usr/share/doc/ttf-dejavu-core/unicover.txt.gz                                OK /usr/share/fonts/truetype/ttf-dejavu/DejaVuSans-Bold.ttf                      OK /usr/share/fonts/truetype/ttf-dejavu/DejaVuSans.ttf                           OK /usr/share/fonts/truetype/ttf-dejavu/DejaVuSansMono-Bold.ttf                  OK /usr/share/fonts/truetype/ttf-dejavu/DejaVuSansMono.ttf                       OK /usr/share/fonts/truetype/ttf-dejavu/DejaVuSerif-Bold.ttf                     OK /usr/share/fonts/truetype/ttf-dejavu/DejaVuSerif.ttf                          OK How does Ubuntu partition the disk when we choose "Erase disk and install Ubuntu" during installation? List of PDOStatement::bindParam data_type parameters How can I write a spiral symbol? How can I get a spiral like    There seems to be a spiral-like unicode codepoint:   I tried  \documentclass[varwidth=true, border=2pt]{standalone} \usepackage[ngerman]{babel}  \usepackage[utf8]{inputenc} % Color \usepackage{color} \definecolor{lightgray}{gray}{0.95}  \DeclareUnicodeCharacter{43612}{\spiral}  %document \begin{document}{\textcolor{lightgray}{a}}\spiral{\textcolor{lightgray}{b}} \end{document}   but I got  ! Undefined control sequence. l.13 ...document}{\textcolor{lightgray}{a}}\spiral                                               {\textcolor{lightgray}{b}}   edit: I know . None of the answers gave me a spiral symbol. Charging Li-ion batteries in parallel I wanted some opinion on my set up here, just to make sure I got the basics right.  I have a Li-ion battery charging circuit based on the MCP73113. This is designed to be a single-cell battery charger.   The battery itself (3.7V, 650mAh) comes with its own PCB with Schottky diode and current regulators as protection. EDIT: Not a Schottky diode. Current limiter and a Protection IC.  By design, they work together just fine.  I have more batteries from the same manufacturer and wanted to make higher capacity packs by putting two cells in parallel. The two cells come with their own PCB, but I only kept one of them, as I soldered their leads together. It seems to work and they are charged and discharged just like regular batteries (3.7V, now 1300 mAh).  However, not all the packs I made work smoothly and I get a failure rate of 2 in every 10 packs. They all start out normally, but occasionally when the batteries are not charged for some time, or are used up, they tend to not work anymore. So far, in only 1 pack I found the voltage to be different (both now below 2V, aka dead).  I assume my method is not the right approach to ensure 100% success rate, so I was wondering how can this be solved. All the controllers I looked into was designed for multiple cells in series, not parallel. Am I fundamentally missing something here? Mastering Telekinetic Discipline? The book says about mastering a psychic discipline:   Once a psyker has purchased 8 psychic techniques from a single Discipline, he has attained mastery of that Discipline, and the Psy Rating for all Fettered Psychic Strength uses of techniques from that Discipline gain a +1 bonus. This has no additional effect on the Unfettered or Push Psy Rating of the psyker.  But the Telekinetic discipline only has 7 techniques, then how can you attain mastery of that discipline? (Telepathy has 9 techniques, and Divination 8) I looked "$\divideontimes$" up on Google and now I know that it's Unicode U+22c7 but when would it be used?  I am guessing that $5 \divideontimes 5 = 25$ and $1$...? Real world use cases of bitwise operators Consider the IVP $$y'(t)=f(y(t)), \ \ \ \ y(0)=a \in \mathbb{R}$$ $$f : \mathbb{R} \rightarrow \mathbb{R}$$ Which of the following is/are true $(A)$  There exists a continuous function $f : \mathbb{R} \rightarrow \mathbb{R}$ and $a \in \mathbb{R}$ such that the above problem does not have a solution in any nbd of $0$. $(B)$  The problem has unique solution for every $a \in \mathbb{R}$ when $f$ is Lipschitz continuous $(C)$ When $f$ is twice continuously differentiable the maximal interval of existence for the above IVP is $\mathbb{R}$ $(D)$ The maximum interval of existence  for the IVP is $\mathbb{R}$ when $f$ is bounded and continuously differentiable.  It is obvious to me that $A \ \&amp; \ B$ are false from traditional existance and uniqueness theorems (viz Picards Theorem). I am not sure about $C \ \&amp; \ D$ and this is really bugging me. Please could anyone shed light on this. PS: Multiple correct options are allowed. What goes wrong if we add a mass term for gauge bosons without the Higgs mechanism? normal subgroups of Alternating group Klein's $4$ group, $\{1\}$ and $A_4$ are three normal subgroups of $A_4$. I want to know about any other normal subgroups of $A_4$. Do these exist? Where is the .Trash folder? Convert .mov to .mp4 I want to convert .mov to .mp4! I saved the video from iMovie but it is in .mov format! How do I convert it to .mp4?  I'm using a MacBook and I want to share it to my phone, but my phone can't open .mov format video.