I recently had a question that had two good answers, both of them were valid solutions to my problem. How do I decide which one to accept?
Possible Duplicate:          I got two answers for the same question from different users and both of them correct and working perfectly, but I am unable to accept both of them. Why? There may be some questions that can be answered in several ways, but I can't here in Stack Overflow. Why?
How to resolve Google "Indexed, though blocked by robots.txt" Why is it possible to answer a question twice? Prove that any conjugate of $a$ has the same order as $a$. I am trying to prove that any conjugate of $a$ has the same order as $a$.  Let $G$ be a group and let $a \in G$.  An element $b \in G$ is called a conjugate of $a$ if $b=xax^{-1}$.  My professor gave us a hint.  Prove $a^k=e$ iff $b^k=e$ for all $k \in \mathbb{Z}$ implies $o(a) = o(b)$.  My first move is to $b^k = (xax^{-1})^k = (x^{-1})^ka^kx^k = (x^{-1})^kex^k = (x^{-1})^kx^k=x^{-k+k}=x^0$  I am not sure that I am doing this correctly?  I am trying to get $b^k=e$.  However when I raise $(xax^{-1})^k$, I am not sure if I what I have done is correct?  I am kind of confused here. Consider the blow-up of the plane in one point. Let $E$ the exceptional divisor. We know that $(E,E)=-1$. What is the geometrical reason for which the auto-intersection of $E$ is $-1$? In general, what does it mean, geometrically, that a divisor has a negative self-intersection or that the "right" number of divisors gives rise to a negative intersection?  Thanks. Booting system without full network configuration I was trying to solve internet problems, and seem to have made things worse: Now when I start the computer it gets stuck on "Booting system without full network configuration".   Does anyone know how to make it unstuck?   Alternatively: It got messed up when I changed the contents of /etc/network/interfaces, so presumably would work again if I changed it back. How can I edit this file during boot?   I'm using Ubuntu 12.10. How to run applications as root? I am having some strange issue with Kate and Kwrite. When I click on Open File, it crashes with segmentation fault.   I am a complete newbie to Linux, and I think the issue is that I am not running the application as root.   How do I run applications as root in Ubuntu? Is it bad practice to do this? What is the purpose of the whole root thing, where even though we need to use root so frequently, it is not utilized as default? Electrostatic charge leakage What are the ways electrostatic charged objects leak charge in humid conditions?  Can airborne particles pick up charge by contact, then be repelled hence removing charge? If so would it be a significant factor? As a disclaimer, I must admit this may benefit me (I haven't checked), but probably not as significantly as most others. This issue is also something that has prevented me from answering questions by users with 1 rep in the past, especially if they are poorly fashioned. The Problem New users with a programming question find SO from various methods, such as google. They ask a question with haste, hoping for a quick answer -- which they usually receive. Many of these users have no interest in Stack Overflow itself, but are simply interested in getting the solution they require. As a result of this, they'll check the site regularly for the first day or two until a sufficient answer has been posted. Once they get what they need, they bail; without the required rep or understanding that they should up-vote and select a response as the answer. The Result A great many questions on SO are abandoned by users with no intention of ever coming back. The answer they require has been provided, but for one or more reasons they have neglected their duty of contributing back by way of awarding reputation. The Reach (Since Jeff loves Datum) Some queries on the data dump examine the reach of this 'problem'. The query I used is based on extensions of the following base query; SELECT p1.Id, p1.Score, p1.OwnerUserId, p2.OwnerUserId, p2.Score FROM posts p1  INNER JOIN posts p2 ON (p1.Id=p2.ParentId) LEFT JOIN users ON (p1.OwnerUserId=users.Id) WHERE p2.Score &gt;= 2  AND p2.Score = ( SELECT MAX(p3.Score) FROM posts p3 WHERE p3.ParentId=p1.Id ) AND users.Reputation &lt; 15 AND p1.PostTypeId = 1 AND p1.AcceptedAnswerId = 0  Result: 3,288 Questions by users with under 15 rep which have answers with 2+ up votes that have no accepted answer. Adding: AND (users.LastAccessDate-p1.LastActivityDate) &lt; 604800 // 1 week AND p1.CreationDate &lt; 1249084800 // 1249084800 is 1 week before latest dump data  to the where clause further reveals that 877 questions that have answers with 2+ up votes have no accepted answer, and the owner of the question has not returned since the week the question was asked. Modifying there where clause, and removing the left join: AND p1.OwnerUserId = 0    Reveals a staggering 3,675 questions with answers of 2+ votes by deleted users.  These are questions that were probably answered but the users who did the work can never be recognized. Building off the previous and using an even more restrictive WHERE clause WHERE p2.Score &gt;=5  Still 1,178 posts that can never have an accepted answer. How many posts are there with over 5 up votes that don't provide the correct answer? Modifying the where clause for Reputation to AND users.Reputation = 1  Still reveals 388 questions by users with 1 rep have been abandoned. Solution Similar to how bounty questions work, if a user has abandons the site (not active since x time after the question was asked) with a question that has answers with 2+ up votes, force the answer with the most up votes to be the selected answer. This will reduce the amount of questions that are unanswered, and also give users more of an incentive to answer questions by new users without extra hesitation.  Update Added more statistics for deleted users.  Please feel free to add/remove rules to make this a truly practical feature. chown -R root.root / So I was working and there was a directory that I was periodically changing to my user in  a root terminal so that I could open the files in text editors, but I accidentally pressed / instead of . and this was the command I put out:  chown -R emil.emil /   Then immediately panicked ^C and put in another command, as I thought I could always change back the files I needed to access:  chown -R root.root /   So now I can't do su from emil to even try to fix this, as I'm getting permission denied error. I'm on Ubuntu could someone tell me if there is a way I could fix this, without absolutely reinstalling the whole thing.  TIP  If you are trying to get root access, and are getting this permission denied error when using su try this command:  gksu gnome-terminal   It will prompt you for the root password and open a new root terminal for some reason this works and gives me root access, when su doesn't. Does MariaDB or MySQL implement the VALUES (expression) table value constructor? I am just wondering if MariaDB or MySQL implements the &lt;table value constructor&gt; in the SQL Spec. In  and ?  SELECT * FROM ( VALUES (1) ) AS t(x);  x  ---  1 (1 row)   (syntax from ). After the death of Lord Voldemort, Harry was taken to the Dursleys and became known as "The Boy Who Lived".  We know that the Wizarding World found out  that Voldemort was dead and undoubtedly it was Dumbledore that advised people that Harry had somehow survived the attack and caused Voldemort's death. According to Snape (in HP:HBP) there were even persistent rumours that Harry was a powerful Dark Wizard in the making until he turned up at Hogwarts a decade later.  My question is : Where did the Wizarding World think Harry was for the intervening 10 years? It has come to the point in my computing program now where I have 5 swinging pendulums that are all modified at once by slider values. These values are drawn onto the from and passed through the class pendulum. To change the values the update button is run, and their is a default option to use a setup that works. The values are also shown on screen through some simple labels. The zero button sets all values (except length) to zero.  The values for each pendulum drawn is:   String length angle Acceleration (angular) Angluar velocity Damping or friction Gravity   My calcuations for these values: (Bob = the weight at the end of the string, and there are X and Y Co-ordiantes for it.  bobX = originX + (Math.Sin(angle) * length);         bobY = originY +(Math.Cos(angle) * length);   Caclulate Acceleration:  Angular Acceleration = (-1 * gravity / length) * Math.Sin(angle);    Increment Velocity:          Angular Velocity += Angluar Acceleration;   Increment Angle          angle += AngularVelocity;   Friction action, pendulum eventually 0's          AngularVelocity*= damping;   Now my next task is to make the pendulums collide "realistically" and recreate a newtons cradle type effect. I've looked into elastic collision solutions on particle e.g. here is an excellent example:    I've also looked at the raw physics behind it  but my brain couldn't get to grips with the raw physics side of things.  So I'm wondering if anybody could help me figuring out the theory for the collisions.  My current idea is when the co-ordinates meet the velocity will simply change polarity e.g. +10 to -10 in the opposing pendulum. Am I correct here?  If you are into code I've posted the code on stack overflow How does the User Card popup work? We are experimenting with enhanced user card mouseover popups and have enabled them network wide. You can tell which users will trigger the popup because they have a 3-D drop shadowy look to their gravatar:    Hover your mouse over the gravatar and wait. Note that the user card mouseover popup will only be displayed if the following conditions are met:   Is the profile complete, and long enough? We enforce a minimum length requirement. The user's reputation must be >= 1k  If you have more links than are able to be displayed after truncation, those extra links will be shown in the bottom of the dialog. We order links at the bottom consistently -- if you include a twitter, google plus, linked in, or facebook those links are prioritized. It will be visible on a question and answer detail page, any page with a list of questions, and the /users list. It will not be shown when a question or answer is wiki'd. It will not be shown when excerpt summary is defined as &lt;!-- summary: &amp;nbsp; --&gt; we support explicitly specifying your user card excerpt summary using the following syntax:  &lt;!-- summary: This is my profile, there are others like it but this one is mine. --&gt;   The above example will result in:    This is now mostly complete.  The goal is allow people to show  off how awesome they are inline, without having to click through to the full user profile page. Windows 7 unidentified network (or limited access) after hibernate My windows 7 network will show limited access or unidentified network after coming up from hibernation.  In the office I normally use LAN connection, I turn-off my wireless card (DELL Latitude has on/off switch for the wireless card). When I back at home I will turn on the wireless card, but it will take about 15 seconds to detect my home WIFI and then show limited access. I will have to restart the notebook and it will be able to connect to my WIFI and internet.  The problem will be solved if I restart the notebook, but that defeats the purpose of hibernation doesn't it?  I have tried uninstalling the wireless card driver but still does not solve it. I also tried updating my network card driver but windows says I am using the latest driver. On support.dell.com also showing I am using the latest driver. Show rigorously that the sum of integrals of $f$ and of its inverse is $bf(b)-af(a)$ Prove $P(x,y)$: If $x$ and $y$ are odd integers, then the product  $xy$ must also be odd.   I need a direct proof of this.  I know that $ x $ and $y$ both have to equal to $2n+1$ in order for them to be odd. But that's all I have. Any help will be appreciated. If $|G| = pq$,  $p,q$ primes, $p \gt q, q \nmid p-1 $, then how do I prove $G$ is cyclic without using Sylow's theorems? Gdata signed request error: "Unknown authorization header" About integer factorization How can I show that $(n-1)!\equiv-1 \pmod{n}$ if and only if $n$ is prime? Thanks.