I am stuck in grub rescue HELP
How to delete GRUB entirely from GRUB rescue and boot Windows only
Methane’s absorption bands are centered at 3.2 and 7.2 microns -- far off the peak of the Planck spectrum for a 290 K blackbody near 16 microns.  Moreover, its absorption bands overlap with the water absorption region.  So why is methane considered a stronger greenhouse gas than carbon dioxide, which has an absorption band at 15 microns? What are good strategies for booster drafts? I know that doing a booster draft can be somewhat complicated, because to really be good you need to know a lot about the set you're drafting (or be really good at evaluating cards quickly) and to pay attention to signal cards.    Besides going into the whole complicated strategies of knowing the set and paying attention to signal cards, what are some relatively simple/basic guidelines for drafting? This question is related to a couple of other questions ( and ) relating to some material that I teach in sampling theory.  Consider the critical points of the  defined as follows.  The value $t_{n-1, \alpha/2}$ is a function of $n$ defined by the implicit equation: $$\frac{\alpha}{2} = \frac{1}{\sqrt{(n-1) \pi}} \cdot \frac{\Gamma(\tfrac{n}{2})}{\Gamma(\tfrac{n-1}{2})} \int \limits_{t_{n-1, \alpha/2}}^\infty \Big( 1+ \frac{r^2}{n-1} \Big)^{-n/2} dr.$$ Normally we treat the input $n&gt;1$ as an integer, but it is possible to extend the treatment to consider it a real value (since the T-distribution is well-defined for non-integer degrees-of-freedom).  I'm trying to come up with a (relatively simple) proof that this critical point value is decreasing in $n$, but I seem to be making quite a mess.  Differentiation using Leibniz rule gets part way, but it quickly becomes a bit of a mess.  Consequently, I would like to solicit proofs of this result --- this simpler the better. Question: How do you prove that this critical point is strictly decreasing in $n$? Which close reason should I use for questions that do not demonstrate research effort? I regularily encounter questions on StackOverflow which are asked only because of the sole fact that the poster haven't made the effort to google for and the docs of a particular function/class/framework/whatever. My question is, to which category of the five proposed one should I vote when I vote to close the question? Is it: off-topic, not constructive, not a real question, exact dupe or too localized? I tend to be all for 'not a real question' - am I quite right? I'm running into this weird problem with Google spreadsheets: if the cells have comments on them and I sort the spreadsheet, the rows sort but the comments stay in the same position, and don't move with the cells they're attached to.  In other words, the cells look like this:  A C  &lt;-- comment on this cell B   and then I sort by this column:  A B  &lt;-- comment remains on this cell (stays in position) C  &lt;-- comment should have remained attached to this cell   This means that sorting is completely broken and I can't use it at all, because I clearly need the cell comments to stay with the cell they're attached to.  Is this a bad bug in Google Spreadsheets, or am I missing something here? I am wondering how to show that $\mathbb{Z}[\sqrt {10}]$ is not a UFD.    My only idea is to show that there are two factorizations of $10$, say, $ab, uv$ such that $a$ is not a unit times $u$ or $v$. In this ring $10=2\cdot5=\sqrt {10}\cdot \sqrt {10}$, so it suffices to show $2$ is not a unit times $\sqrt {10}$. Suppose $2=\sqrt {10}(a+b\sqrt{10})=a\sqrt{10}+10b$. Then $a=0$ since $\sqrt{10}$ is not rational. So $10b=2$, which has no integer solutions. So $\mathbb{Z}[\sqrt {10}]$ is not a UFD.  Is my reasoning correct? What are the flaws? Dealing with "java.lang.OutOfMemoryError: PermGen space" error What is the difference between "likelihood" and "probability"? The  claims that likelihood and probability are distinct concepts.     In non-technical parlance, "likelihood" is usually a synonym for "probability," but in statistical usage there is a clear distinction in perspective: the number that is the probability of some observed outcomes given a set of parameter values is regarded as the likelihood of the set of parameter values given the observed outcomes.    Can someone give a more down-to-earth description of what this means?  In addition, some examples of how "probability" and "likelihood" disagree would be nice. What is the best way to convert an array to a hash in Ruby In Ruby, given an array in one of the following forms...  [apple, 1, banana, 2] [[apple, 1], [banana, 2]]   ...what is the best way to convert this into a hash in the form of...  {apple =&gt; 1, banana =&gt; 2} In which cases would you say, "I am seeing" instead of "I see"? In which cases would you say, "I am seeing" instead of "I see"? Can one executable be both a console and GUI application? I want to make a  program that can be run as a CLI or GUI application depending on what flags are passed into it. Can this be done?  I have found these related questions, but they don't exactly cover my situation: Prove that a group is infinite and nonabelian. I'm trying to solve a question of Hungerford's Algebra:     Show that the group defined by generators $a,b$ and relations   $a^2=b^3=e$ is infinite and nonabelian.   I guess a good approach would be to find an infinite and nonabelian group with two generators satisfying the same conditions and let Van Dyck do all the work. I've been thinking about the group of permutations $S_{\mathbb N}$, some groups of matrices, but I couldn't get it. Could anyone give me a hint? Thanks in advance! Prove the map sending a matrix to it's inverse is continuous. Combinatorial proof of summation of $\sum\limits_{k = 0}^n {n \choose k}^2= {2n \choose n}$ 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$. Why does Property Set throw StackOverflow exception? I know java and would normally put in getter/setter methods. I am interested in doing it in C# with the following code, but it throws a StackOverflow exception. What am I doing wrong?  Calling Code  c.firstName = "a";   Property Code    public String firstName; {     get     {         return firstName;     }     set     {         firstName = value;     } } It was a useful answer. Recolor Artwork: single swatch to multiple swatches I have an Illustrator document with a lot of objects. All the objects are black, same swatch.  I have a swatch group with a few dozen coloured swatches. I wish to apply these swatches to all the many black objects. It doesn’t have to be in any particular order, but each object should be coloured individually—I don’t just want to change black into some other colour, but to dozens of other colours. What I really want to avoid is having to select each object individually and then applying a different swatch to each.  I’ve never quite managed to get my head properly around the Recolor Artwork feature in Illustrator, and I cannot for the life of me get it to do anything like this. The “New” box in the Recolor Artwork dialogue box appears to accept only one colour.  Is there some way to do this using the Recolor Artwork feature? Or using some other feature that I’m not aware of? Bonus points if there’s a way to control the order in which the colours are applied; e.g., specifying an order and then click on each object in turn to apply each swatch being ‘iterated’ through in that order.  (I would prefer to avoid having to script it, but I will if there’s no other way.) Url rewriting in Amazon S3 I have a webapp hosted in Amazon S3, the webapp is build with jQuery Mobile and I use changePage lo navigate between pages, I'm not using the hash operator(#) when I change the page.  I'm having problems when the user copy the url and paste it in a new tab  For example:    loads the page page1.html that is in amazon s3 with only the jquery page structure...  The behavior that I want is that load index.html and with js read the url, detect the page and load the correct page.  With Apache I solve this with URL Rewriting... but for Amazon S3 I didn't find any similar...  NOTE: I know that if I activate the hash operator (#) in my urls the problem is solved but I need clean urls without #. DateTime "null" value I've been searching a lot but couldn't find a solution. How do you deal with a DateTime that should be able to contain an uninitialized value (equivalent to null)? I have a class which might have a DateTime property value set or not. I was thinking of initializing the property holder to DateTime.MinValue, which then could easily be checked. I guess this is a quite common question, how do you do that? I am a US Green card holder with an Indian passport expiring in 4 months planning a short weekend trip by road to Canada next month.  Will I be allowed to enter Canada considering my passport won't meet the "valid passport" criteria of 6 months?