Every now and then an answer is (fully or partially) based on a myth.  Myth, as in: there is literally zero evidence that supports it, yet many swear it is true  This of course leads to a certain amount of agreement and upvotes. Depending on the popularity of the myth and the amount of good counter-evidence, the amount of upvotes can be much higher than downvotes.  What can we do in such cases when the "myth believers" are in majority?   Write a comment that there is no evidence for the claim? Edit the answer? (remove the false claim? or maybe leave it and note that it is a common misconception?) Ask for supporting evidence? (this is basically same as 1) Something else? (give up and let the myth grow, as SE is a quite popular source of information?)   An example of a myth, for the sake of argument:     pigs can fly   Zero evidence for it (also, I hope, nobody really believes this).  I'm not giving an actual example for the reason to avoid responses like "hey, but that is actually true!"  I am referring to technical discussions, like on Super&nbsp;User, Server&nbsp;Fault and Stack&nbsp;Overflow.
These 2 questions have clearly wrong answers with upvotes. And they're still getting votes.  The log file one especially could be tried out, it would fail, but someone still voted it up. A downvote and comment has no effect.  Like we have "vote to close", what about a "vote to delete" for answers. I'd suggest a fairly high rep limit. Or badge ownership realting to the question tags (eg SQL Server)   (SF)   (SO)  Could be similar to this meta question:
Irreducible conics An algebraic set (not necessairly a variety) $X \subseteq \mathbb{A}^2$ defined by a polynomial of degree $2$ is called a conic.  The problem is:     Show that any irreducible conic is isomorphic either to $Z(y-x^2)$ or to $Z(xy-1)$ after an affine change of coordinates in $\mathbb{A}^2$.   However, with this definition of conic, I only can conclude that if the polynomial is irreducible, then the conic is irreducible (because $f$ irreducible $\Rightarrow Z(f)=X$ is irreducible)     What can I do to prove that if a conic is irreducible, then the polynomial that defines the conic is irreducible?   And for the main problem, how can I do the affine change of coordinates?  Thanks How to disable notifications for a single mailbox in Mail? When managing multiple mailboxes, is it possible to disable the notifications for certain mailboxes? I need to create a request for a web page delivered to our web sites, but I need to be able to set the host header information too.  I have tried this using HttpWebRequest, but the Header information is read only (Or at least the Host part of it is).  I need to do this because we want to perform the initial request for a page before the user can.  We have 10 web server which are load balanced, so we need to request the file from each of the web servers.    I have tried the following:  HttpWebRequest request = (HttpWebRequest)WebRequest.Create("http://192.168.1.5/filename.htm"); request.Headers.Set("Host", "www.mywebsite.com"); WebResponse response = request.GetResponse();   Obviously this does not work, as I can't update the header, and I don't know if this is indeed the right way to do it. Showing a compact metric space has a countable dense subset I know that this is separable, but that has not been covered by the text at this point. I believe my proof (below) to be correct, but not very rigorous. Assuming that it actually is correct, could someone please help me make it more formal? (If it's not correct, please help with the proof). Thanks.  Proof: Let $X$ be a compact metric space. Let $B_n = \{B(x,\frac1{n}) : x\in X\}$. be the collection of open balls centered at $x$. Let $\{x\}^{(n)}$ be the set of centers for some particular $n$. Then by compactness of $X$, there are also a finite number of centers for a particular $n$ (corresponding to each open ball).   [This is where I have trouble properly saying what's on my mind:]  Consider $B(x,r_0)$, where $r_0 = \frac{1}{n_0}$. When we decrease the magnitude of $r_0$ to $r_1$, we must still be able to cover $X$. Meaning some open ball(s) must be "formed" where $B(x,r_0)$ was once "covering". So by adding open balls, we also add to our collection of centers. This means at $B(x,r_0)$, there was originally a point $y \in B(x,r_0)$ s.t. $B(y,r') \subset B(x,r_0)$ for some $r'$. That is, $B(x,r_0)$ contained another point of $X$. Thus, by definition, $X$ contains a countable dense subset. Can I change my flight dates after I get my Schengen visa? I am an Indian student in the UK. If I already had a single entry Schengen visa and I apply again to the French embassy, will I be issued with multiple-entry?  If I get the visa, but due to a problem, I cannot travel on the intended dates(ones I mentioned on visa form) and decide to travel a month later, will it cause a problem when I travel next. And if I dont exactly follow the itenary that I submitted with my visa application?  As far as dates are concerned. I mean this: Suppose my visa is valid for May-August. When I applied for this visa, my itenary and hotel bookings were for June. But now I decide to travel instead in July. Will there be a problem if I did not take the journey for which I initially applied the visa and take a different journey later instead Searching through ODT documents without opening them? Let's say I have 2000 .ODT files. Their names are random numbers. How do I go about searching for, let's say, "pricing list"? How do I find the document I need without opening all of them one by one and checking to see if it's the right one?  Is there some program to search through the words in the documents without opening them? Is there an easy way to tell if a graph can be embedded on a Möbius strip (with no edges crossing)?  A specific version of this: if a simple graph with an odd number of vertices has all vertices of degree 4, can it be embedded on a Möbius strip?    Answer summary:   There are  for the Möbius strip that are   and drawn on . There are  for the Möbius strip, they are , and even better there are only .   I have not yet answered the second question, but Jim Belk's excellent explanation has given me good ideas. Can I see why a package is installed? For a specific package, can I find out why it is installed?  So, can I see or it's manually installed, or that it is installed as a dependency of another package? Or that it is installed as part of the distro? How do I add a launcher for .sh applications? I have installed ubuntu (11.04).  I installed phpstorm which is simply an archive for you to extract and shove in your /opt directory.  To run it you would use /opt/PhpStorm-103.243/bin/PhpStorm.sh  In unity I had created a launcher on my desktop.  Now I have installed gnome-3(gnome-shell),  And I have nothing in my desktop.  So how do I run phpstorm quickly? Can I get it to show up in "applications"? Why does the base of this slinky not fall immediately to gravity? My guess is tension in the springs is a force > mass*gravity but even then it is dumbfounding. Proper display of fractions How can I remove duplicate icons for "launched" java programs in the launcher? When launching java programs (like IntelliJ IDEA and Crashplan) in Natty's Unity launcher, duplicate icons are shown (see image).  For IntelliJ I created the .desktop file, for Crashplan the .desktop file is supplied with the application.  Is there something that can be changed in the .desktop files (or somewhere else) that can prevent this from occurring?  I couldn't find a bug report for unity itself but programs like Gnome-Do/Docky have   and had to make internal changes to their applications to prevent this.   In this image the 1st icon is the one created from the .desktop file and the second icon is after launching it.  Second icon disappears when closing the application.  Custom IntelliJ .desktop file  #!/usr/bin/env xdg-open [Desktop Entry] Version=1.0 Type=Application Terminal=false Icon[en_US]=/opt/idea/bin/idea128.png Name[en_US]=IntelliJ IDEA Exec=/opt/idea/bin/idea.sh Name=IntelliJ IDEA Icon=/opt/idea/bin/idea128.png StartupNotify=true   Crashplan provide .desktop file  [Desktop Entry] Version=1.0 Encoding=UTF-8 Name=CrashPlan Categories=; Comment=CrashPlan Desktop UI Comment[en_CA]=CrashPlan Desktop UI Exec=/usr/local/crashplan/bin/CrashPlanDesktop Icon=/usr/local/crashplan/skin/icon_app_64x64.png Hidden=false Terminal=false Type=Application GenericName[en_CA]= I am getting the following error frequently. (Example: when running zenity,firefox etc. commands / applications.)  Fontconfig warning: "/etc/fonts/conf.d/90-fonts-unfonts-core.conf", line 11: Having multiple values in &lt;test&gt; isn't supported and may not work as expected   Here is contents of file /etc/fonts/conf.d/90-fonts-unfonts-core.conf:  &lt;?xml version="1.0"?&gt; &lt;!DOCTYPE fontconfig SYSTEM "fonts.dtd"&gt; &lt;fontconfig&gt;     &lt;match target="font"&gt;         &lt;test name="family" qual="any"&gt;             &lt;string&gt;은 바탕&lt;/string&gt;&lt;string&gt;UnBatang&lt;/string&gt;                 &lt;string&gt;은 돋움&lt;/string&gt;&lt;string&gt;UnDotum&lt;/string&gt;                 &lt;string&gt;은 궁서&lt;/string&gt;&lt;string&gt;UnGungseo&lt;/string&gt;                 &lt;string&gt;은 필기&lt;/string&gt;&lt;string&gt;UnPilgi&lt;/string&gt;                 &lt;string&gt;은 그래픽&lt;/string&gt;&lt;string&gt;UnGraphic&lt;/string&gt;         &lt;/test&gt;          &lt;edit name="antialias" mode="assign" binding="strong"&gt;&lt;bool&gt;true&lt;/bool&gt;&lt;/edit&gt;         &lt;edit name="hinting"   mode="assign" binding="strong"&gt;&lt;bool&gt;false&lt;/bool&gt;&lt;/edit&gt;         &lt;edit name="autohint"  mode="assign" binding="strong"&gt;&lt;bool&gt;true&lt;/bool&gt;&lt;/edit&gt;         &lt;edit name="hintstyle" mode="assign" binding="strong"&gt;&lt;const&gt;hintslight&lt;/const&gt;&lt;/edit&gt;     &lt;/match&gt; &lt;/fontconfig&gt;   How to solve it? Why $(a+d)(b+c)$ equals $-16$? If $a,b,c$ and $d$ satisfy the equations:$$a+7b+3c+5d=0$$$$8a+4b+6c+2d=-16$$$$2a+6b+4c+8d=16$$$$5a+3b+7c+d=-16$$ then $(a+d)(b+c)$ equals $-16$.   I can't understand why $(a+d)(b+c)$ equals $-16$? nameref (hyperref) evaluating counter instead of section name What's the proper way to reference a section with a counter in the title? The TOC generates correctly, but the cross references aren't so lucky.  MWE:  \documentclass[letterpaper, 12pt, twoside]{exam}  \usepackage{hyperref}  \newcounter{KSRLessonNumberCounter} \setcounter{KSRLessonNumberCounter}{1} \newcommand{\KSRSection}[2][\value{KSRLessonNumberCounter}]{         \setcounter{KSRLessonNumberCounter}{#1}         \section*{Lesson \arabic{KSRLessonNumberCounter}: #2}         \addcontentsline{toc}{section}{Lesson \arabic{KSRLessonNumberCounter}: {#2}}         \stepcounter{KSRLessonNumberCounter} } \newcommand{\KSRSubsection}[1]{         \subsection*{#1}         \addcontentsline{toc}{subsection}{#1} } \newcommand{\KSRLessonNumber}{ }  \begin{document}  \KSRSection{Sample}  This is the first lesson. The second lesson is \nameref{sec:blah}.  \KSRSection{Blah} \label{sec:blah}  This is the second section  \KSRSection{Lorem Ipsum}  Dollars are Set in \nameref{sec:blah}.  \end{document} What is a 'Closure'? I asked a question about Currying and closures were mentioned. What is a closure? How does it relate to currying? Consider the group $\mathbb{Q}$ under addition of rational numbers. If $H$ is a subgroup of $\mathbb{Q}$ with finite index, then $H = \mathbb{Q}$.  I just saw this on our exam earlier and was stumped on how to show this. Any ideas? Please provide me with the guidance to install oracle 11gr2 on Ubuntu 14.04. Name of short sci-fi story involving a musician who is punished for listening to Bach How to use find command with wildcard when current directory contains a match? Possible Duplicate:          I'm having some confusion with the find command.  If I type:  find . -name *.xml   or   find ./ -name *.xml   I receive a list of all the xml files in subdirectories of the current directory, UNLESS the current directory contains an xml file, in which case I get:  find: paths must precede expression: foo.xml Usage: find [-H] [-L] [-P] [-Olevel] [-D help|tree|search|stat|rates|opt|exec] [path...] [expression]   What is the correct way to search for files with wildcard when the current directory may contain a match?