Failure on bootmgfw.efi after restoring GRUB EFI
Unable to boot into Windows after installing Ubuntu, how to fix?
How do I create files using the lines in a .txt file? For example I have a file called fileNames.txt.  cat &gt;fileNames returns  abet  able  abacus   How do I use fileNames to create abet, able, and abacus as .txt files?  I tried using pipes with cat and touch. 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? How can I get the current working directory? I want to have a script that takes the current working directory to a variable. The section that needs the directory is like this dir = pwd. It just prints pwd how do I get the current working directory into a variable? Can you reuse marinade used with raw chicken? I marinated chicken a couple weeks ago, and stored the marinade afterwards in a jar. Can it be reused, or is that dangerous? I've been told conflicting stories here. The marinade is mostly teriyaki if that makes a difference.   Intended use of used marinade: Marinate chicken which will then be cooked in the oven. It will not be used with anything that won't be cooked (like a sauce). What's a word like "disregard" or "bypass" that means "hides"? Batch files: How to read a file? $\mathbb Z[1/2]$ is not finitely generated ?   Maybe I misunderstood, what finitely generated means.  it says, we need finitely many elements and I think $1$ and $1/2$ suffices as generators.  But , at the end of Proposition $5.1.4$, from the fact that $\mathbb Z[1/2]$ is not finitely generated it is concluded that $1/2$ is not integral. Let $N$ be a normal subgroup of $G$. Let $G/N = \{gN : g \in G \}$. Show that the $(G/N, \circ, 1_{G/N})$ is a group, where:  $\circ : G/N \times G/N \rightarrow G/N$ is defined by $(gN \circ hN) = ghN$ and $1_{G/N} = 1*N$.  Thanks for your help. How to open the default webbrowser using java How do you empty the buffers and cache on a Linux system? Prior to doing some benchmarking work how would one free up the memory (RAM) that the Linux Kernel is consuming for its buffers and cache?    Note that this is mostly useful for benchmarking. Emptying the buffers and cache reduces performance! If you're here because you thought that freeing buffers and cache was a positive thing, go and read . The short story: free memory is unused memory is wasted memory. How to merge partitions? I have two partitions, one of them has a file system and the other is unallocated.  How to merge two partitions? Layover at Dusseldorf and Frankfurt, category A or B visa? I am a Indian citizen in the United States on a F-1 visa.  For the summer break, I am traveling (round-trip) from Chicago to New Delhi via Dusseldorf-Frankfurt by Lufthansa airlines. My onward Journey would be on July - 8 and return Journey on Aug - 11.  My layover will be of 1 hour 10 mins in Frankfurt and 3 hours in Dusseldorf.  I would like to know if I require Category A or Category B Visa. If not, what type of visa do I require for the Schengen visa for my transit. How I can apply for the same?  I tried to find slots in German consulate but all slots are full before my departure date. If I don't get the Schengen visa, I cannot travel and will loose all the fare (since my ticket is a non-refundable ticket). Is there any other way I can tackle this situation. Finding sharing settings OWD In an urn there are $n$ red balls and $m$ blue balls. I extract them without replacement. Let $X$=time of first blue. What is $E(X)$?  I found PMF of $X$ and it is, if $k &gt; n+1$  $$P(X=k) =\frac{n(n-1) \dots (n-k+1)m}{(m+n)(m+n-1) \dots (n+m-k+1)}$$  How could I evaluate $E(X)$?  Edit: I'm looking for an explicit form of $E(X)$ Proof Verification: Converse of Intermediate Value Theorem A function $f$ is increasing on $A$ if $f(x)\leq f(y)$ for all $x&lt;y$ in $A$. Show that the Intermediate Value Theorem does have a converse if we assume $f$ is increasing on $[a,b]$.  The converse of IVT along with the additional hypothesis would look like this: Lef $f:[a,b] \rightarrow \mathbb{R}$ be an increasing function on $[a,b]$ which satisfies: if $L$ is a real number such that $f(a)&lt;L&lt;f(b)$ (or $f(a)&gt;L&gt;f(b)$), then there exists a point $c\in (a,b)$ where $f(c)=L.$ If the preceding conditions are met, then $f$ is continuous on $[a,b]$.  The proof (if it's correct) I'm going to show is only for the $c \in (a,b)$, but I think for end points ($a$ or $b$), the method should be similar.  We want to show that given $c \in (a,b)$, for all $\epsilon&gt;0$, there exists a $\delta&gt;0$ such that $|x-c|&lt;\delta \implies |f(x)-f(c)|&lt;\epsilon$.  Since $f$ is increasing, we know that $f(a)\leq f(c)$. If $f(c)-\epsilon&lt;f(a)$, then set $x_1=a$, if $f(c)-\epsilon\geq f(a)$, then we know by hypothesis that a $x_1&lt;c$ exists such that $f(x_1)=f(c)-\epsilon.$ In either case, we have for $x \in (x_1,c]$ $$ f(c)-\epsilon \leq f(x_1) \leq f(x) \leq f(c) .$$  In a similar way, since we know that $f(c)\leq f(b)$, we can deduce that a $x_2&gt;c$ exists such that, for $x \in [c,x_2)$ $$f(c)\leq f(x)\leq f(x_2)\leq f(c)+\epsilon .$$  Pick $\delta = \min \{c-x_1,x_2-c \}$, we then have $$|x-c|&lt;\delta \implies |f(x)-f(c)|&lt;\epsilon .$$  Is this correct? In the proof that I saw, they originally used $\frac{\epsilon}{2}$, instead of just $\epsilon$, but I think this one works just as well, what do you guys think? Can you make an opportunity attack against a moving object? Is it legal to dribble above shoulder height? I heard that while dribbling the ball, if the ball rises above shoulder level then it is a turnover. I don't have any idea about this rule. Best method for short time-series I have a question related to modeling short time-series. It is not a question , but how. What method would you recommend for modeling (very) short time-series (say of length $T \leq 20$)? By "best" I mean here the most robust one, that is the least prone to errors due the fact of limited numbers of observations. With short series single observations could influence the forecast, so the method should provide a cautious estimate of errors and possible variability connected to the forecast. I am generally interested in univariate time-series but it would be also interesting to know about other methods. I am wondering if my proof is correct? Thank you for whoever willing to take a look at it for me.     Proof $\liminf E_k \subset \limsup E_k $   If $\{E_k\}_{k=1}^\infty$ is a sequence of sets, we define \begin{align*} \limsup E_k &amp; = \bigcap_{j=1}^\infty\left(\bigcup_{k=j}^\infty E_k\right)\\ &amp;= \bigcap_{j=1}^\infty(E_j \cup E_{j+1} \cup \cdots)\\ &amp;= (E_1 \cup E_2 \cup \cdots) \cap (E_2 \cup E_3 \cup \cdots) \cap \cdots. \end{align*}  Therefore, $\limsup E_k$ consists of those points in $\mathbb{R}^n$ which belong to infinitely many $E_k$. \begin{align*} \liminf E_k &amp; = \bigcup_{j=1}^\infty\left(\bigcap_{k=j}^\infty E_k\right)\\ &amp;= \bigcup_{j=1}^\infty(E_j \cap E_{j+1} \cap \cdots)\\ &amp;= (E_1 \cap E_2 \cap \cdots) \cup (E_2 \cap E_3 \cap \cdots) \cup \cdots. \end{align*} Therefore, $\liminf E_k$ consists of those points in $\mathbb{R}^n$ which belong to all $E_k$ for $k \geq k_0$.  Now consider $x \in \liminf E_k$, then $x \in E_1 \cap E_2 \cap \cdots$, or $x \in E_2 \cap E_3 \cap \cdots$ and so on, that is to say, $x \in E_{k_0} \cup E_{k_0+1} \cup \dots$ for some $k_0$. More specifically, $x \in E_k \forall k \geq k_0$. Therefore, $x \in (E_1 \cup E_2 \cup \cdots) \cap (E_2 \cup E_3 \cup \cdots) \cap \cdots$, so we showed $x \in \limsup E_k$. How can a path animation be used as an action in the game engine? I animated a rollercoaster using a Bezier Curve and a Follow Path Constraint affecting the vehicle.  Then I tried to use the automatically created action in the game engine but the Action Actuator has no effect .    How can this action be used in the BGE? Can the Path Animation alternatively be converted into keyframes?