Help! I had a dual-boot of Ubuntu and Windows 8.1 on my computer. Last night I decided to "uninstall" Ubuntu. Rather than re-install the Windows MBR I decided to just edit GRUB to timeout at 0, with the default choice as Windows. I restarted my computer and it boot just fine into Windows. I removed all the Ubuntu partitions from Disk Management (being careful not to remove the partition with mount point /boot/efi) and reclaimed the unallocated space.  Today I turned on my computer and a black GRUB screen came up with the line "Minimal BASH-like line editing is supported. For the first word, TAB lists possible command completions. Anywhere else TAB lists possible device or file completions"  How do I boot in to Windows 8?!
I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.
Is it OK to add [Solved] to the title of a question? I was confused when I saw this Question with [Solved] in its title where I couldn't find a solution: .  Then I found out that the "[Solved]" part was put there by someone else through editing like these:       I was feeling that this was not how it's supposed to be done and searched meta to find, that it is indeed discouraged to do so:        But on the other hand, the user who did the edits has a whole lot of reputation so I might me missing something here. So what's the correct thing to do? Should those edits be reverted? How to auto close LWC quick action from JavaScript? Suppose $X,Y$ and $Z$ are multivariate normal with means and full covariance matrix. The conditional expectation $E(X | Y)$ is well know. What is the conditional expectation of $E(X | Y,Z)$ if $Y$ and $Z$ (and $X$) are correlated? Standard textbooks only seem to cover the case when $Y$ and $Z$ are uncorrelated. Does untapping an attacker stop its attack? How does Stack Overflow save and show tags? I am a user on Stack&nbsp;Overflow, and I think every page that shows questions, display all tags and the questions. Are the tags saved in a tags table or are they included together with the questions table? "[somebody]'s theme" vs "[somebody] theme" — Saxon genitive dillema When is it required to use 's in phrases like below (examples taken from Wikipedia)?   James Bond theme 007 theme Boba Fett motif Droids motif Yoda's theme ...   Are there any rules for eliding Saxon genitive?  How does the situation change if we have something instead of somebody? Number of pairs of strings satisfying the given condition We are provided with a string A (may contain repeated characters as well ). One needs to make all possible permutations of A , and find out how many pairs of strings chosen from these permutations are not similar.  Two strings are similar if we can make both of them exactly same by carrying out at most 1 swap in each of them .  Example :- if we are provided with string abcd  , then for permutation abcd , the permutations which are not similar to it are bcda , bdac , cadb , cdba , dabc , dcab . Similar is the case for other permuations as well. So overall number of desired pairs are 24*6=144 .  I tried solving it for each possible pair by approach mentioned here     But as the permutations can be large enough , I need a better approach of solving this. Is it possible to make armour that can survive /kill? /kill is said to be infinity damage but I have a question can you really survive it in Java edition. However, it is possible that you can pretty much survive this if you are on Minecraft Java Edition in 1.8 or lower and you can just have resistance 5 and you will survive this but can you make armour that helps you survive in 1.16 and in java-edition. Customizing the output of Compass sprites How do you prevent oatmeal from overflowing? Whenever I cook oatmeal (whether steel cut oats in a rice cooker or pan, or rolled oats in the microwave), it always overflows. How do you prevent this?   Do you just use a bigger container? Do you just take the pan off the heat or bowl off the microwave when it's about to overflow? I've also heard that if you put dried fruit or something like that along with the oatmeal while cooking, that helps prevent it from overflowing -- is this true? Standard formula for quick calculation of scores I have three datasets as follows:   Dataset A can have a maximum score of 30. (Individual scores can be from 1 to 30) Dataset B can have a maximum score of 45. (Individual scores can be from 1 to 45) Dataset C can have a maximum score of 25. (Individual scores can be from 1 to 25)   The three datasets contribute equally to a final score, hence it is 33.33% each. i.e. (33.33% for dataset A + 33.33% for dataset B + 33.33% for dataset C) = 100% (final score)  I have the following scores in each dataset:   Dataset A: 22 Dataset B: 15 Dataset C: 10   Is there a quick formula that I can use to work out the final score, based on the above datapoints?   (This is not a homework question.) In how many ways can $500$ indistinguishable students select books from $10$ titles if no more than $20$ copies of one particular text are selected? Assume that there are an arbitrarily large number of copies of ten diﬀerent discrete math books (which we will call titles) for cmsc250. Each student must choose one title as the course text book. Assume that the ﬁve hundred students taking the course are indistiguishable.  How many diﬀerent ways can the students choose titles, if Epp must be chosen by at most twenty students?   I understand that this is a stars and bars problem where the formula would be ${n+r-1}\choose{r-1}$, but whats throwing me off is the "at most" parameter of the problem. My answer is ${480+9-1}\choose{9-1}$ My reasoning was that we now have one less "bar", and that should be shown by lowering $r$ by 1  Am I approaching this the right way? What is this colored fiber in my chicken? I smoked a whole chicken. When I cut into the breast I found this:    What is it and is my chicken ruined? I'm seeking for a proof of the following:     Let $A$ be an invertible matrix. Then the determinant of $A^{-1}$ equals:   $$\left|A^{-1}\right|=|A|^{-1} $$   I don't know where to begin the proof. Any suggestions? I'm a computer student, learning math just for fun. Today I was  that I found something strange! I noticed that that wired function ${x^{x^{\cdot^{\cdot^{x}}}}}$ in zero, seems to converge to 1 when there are even powers and to 0 when there are odd powers! Then I attempt to prove it but I failed.  Then I did a little research and I found the  article on Wikipedia. This article says that my guess was right but without any proof. So I'm here to ask you about it.     If we define ${x^{x^{\cdot^{\cdot^{x}}}}}$ as ${^{n}x} :=\begin{cases} 1 &amp;\text{if }n=0 \\ x^{\left(^{(n-1)}x\right)} &amp;\text{if }n&gt;0 \end{cases}$      then prove:      $$\lim_{x\rightarrow0} {}^{n}x = \begin{cases}   1, &amp; n \text{ even} \\  0, &amp; n \text{ odd} \end{cases}$$ DRAM Frequency showing 800 instead of 1600 I am running a Core i7 CPU originally at 3Ghz overclocked to 4Ghz using a multiplier of x20 and a Bus Speed of 200 Mhz  My memory is 1600 Mhz OCZ.  I installed CPU-Z to see what is going on - but it shows me (under the "Memory" Tab):  DRAM Frequency 800 Mhz  Channel Triple - NB Frequency 3800.2 Mhz  So what is the actual frequency its running on then? I am slightly confused. Is it possible to log back into a Pokemon Go account? So I had 20+ Pokemon on my account and today when I tapped on the app, it brought me back to the original screen when you first start playing. My friend who signed up tested using my username when she first started and my username was unavailable, meaning the account still exists. I don't have the password for the account, but I do have the email. So I wanted to know if it was possible to log back into an account? Scatterplot with too many points Without appealing to the axiom of choice, it can be shown that (Proposition:) if $X$ is well-orderable, then $2^X$ is totally-orderable.  Question: can we show the stronger result that if $X$ is well-orderable, then so too is $2^X$?  Proof of Proposition. Pick any well-ordering of $X$. Then the lexicographic order totally orders $2^X$.  More explicitly: for any two $f,g \in 2^X$, define $f &lt; g$ iff   there exists $x \in X$ such that $f(x) \neq g(x)$, and if $x \in X$ is minimal such that $f(x) \neq g(x)$, then $f(x)=0$ and $g(x)=1$.   It can be shown that $&lt;$ totally-orders $2^X$. Structure of groups of order $pq$, where $p,q$ are distinct primes. I don't know about the Sylow Theorems.  But I have been wondering about a proof of the fact that a group or order $pq$ where $p$ and $q$ are distinct primes must be cyclic. I can't quite work out the details, but here is the general idea. I would like help with filling in details. I assume that it is already known that $G$ has subgroup(s) of order $p$ and subgroup(s) of order $q$.  If $G$ is a group of order $pq$ ($p\neq q$), then I know that $G$ has a subgroup $H$ of order $p$ and a subgroup $K$ of order $q$. Then $H\simeq \mathbb{Z}_p$ and $K\simeq \mathbb{Z}_q$.   But then $H\oplus K \simeq \mathbb{Z}_{pq}$, so I would think that $H\oplus K \simeq G$. I guess one could do an internal direct product instead of an external direct product, but I don't know that $H$ and $K$ are normal subgroups.  I am asking for help completing this argument.  Edit: I see from the comments below that I might need to assume that the smaller prime does not divide the larger prime minus $1$. Or maybe it is enough to assume that the primes are greater than or equal to $3$ (Still distinct).