If my opponent makes me discard a card and I choose a creature card with the Bloodrush ability, can I pay the cost during the forced discard in order to activate the ability?
I'm starting on mono blue mill deck and I saw . I'm not sure about its ability.     {tap}: put a charge counter on Grindclock      {tap}: target player puts the top X cards of his or her library into his or her graveyard, where X is the number of charge counters on Grindclock.   If I just cast  and use its first ability, will the second ability take effect, or do I just put a charge counter on it? If there's already one charge counter on it and I use the first ability again, it will have two charge counters on it? Then the second ability will take effect with two cards being sent to graveyard?  If I use spells or ability to untap it after being used can I use its ability again on the same turn?
What is the proof that the universal constants ($G$, $\hbar$, $\ldots$) are really constant in time and space? I have some doubts regarding net run rate in the ongoing ICC world twenty 20 2014 event.It takes a while to read so please don't hesitate and give me a solution regarding this.    My doubt is that in match 12 of world twenty 20 2014(In Group Stage Last Match on march 21 2014) () Wesley Barresi of Netherlands hit a six when the team score was 187 while chasing Ireland score of 189, That take Netherlands score to 193.  If that is the case in match 17 between India and West Indies in match of super10 group (in ICC world twenty 20 2014 on march 23 2014) () while Suresh Raina (India) hit a four when the team score was 129 while chasing West Indies score of 129,That takes India Only To 130. why Only One run is added to the score in this match(match 17 on march 23 2014) while 6 runs are added to the score in match 12 on march 21 2014.  I don't understand the strategy behind this.Because if India's Score is taken as 133 then India's net run rate as of now(24 march 2014) will be 0.442(Runs Scored For 264 in 38.1 overs ) But Now it is only 0.383(Runs Scored For 261 in 38.1 overs ).As the net run rate plays an important role in the tournaments like this i am not very happy with this.  As being an Indian Fan now a days I look a lot in to net run rate as it has eliminated India in many tournaments including last ICC world twenty 20 2012.  Is There Any One who can clarify my doubts regarding the net run rate as i want to be sure of what was happening? A friend asked me last week how to enumerate or list all variables within a program/function/etc. for the purposes of debugging (essentially getting a snapshot of everything so you can see what variables are set to, or if they are set at all). I looked around a bit and found a relatively good way for Python:   #!/usr/bin/python                                                                                                                                                                                                                            foo1 = "Hello world" foo2 = "bar" foo3 = {"1":"a",         "2":"b"} foo4 = "1+1"  for name in dir():     myvalue = eval(name)     print name, "is", type(name), "and is equal to ", myvalue   which will output something like:   __builtins__ is &lt;type 'str'&gt; and is equal to  &lt;module '__builtin__' (built-in)&gt; __doc__ is &lt;type 'str'&gt; and is equal to  None __file__ is &lt;type 'str'&gt; and is equal to  ./foo.py __name__ is &lt;type 'str'&gt; and is equal to  __main__ foo1 is &lt;type 'str'&gt; and is equal to  Hello world foo2 is &lt;type 'str'&gt; and is equal to  bar foo3 is &lt;type 'str'&gt; and is equal to  {'1': 'a', '2': 'b'} foo4 is &lt;type 'str'&gt; and is equal to  1+1   I have so far found a partial way in PHP (courtesy of ) but it only lists all variables and their types, not the contents:   &lt;?php // create a few variables $bar = 'foo'; $foo ='bar'; // create a new array object $arrayObj = new ArrayObject(get_defined_vars()); // loop over the array object and echo variables and values for($iterator = $arrayObj-&gt;getIterator(); $iterator-&gt;valid(); $iterator-&gt;next())         {         echo $iterator-&gt;key() . ' =&gt; ' . $iterator-&gt;current() . '&lt;br /&gt;';         } ?&gt;   So I put it to you: how do you list all variables and their contents in your favorite language?    Edit by : I propose this question follows the spirit of a little "". If you do not agree, just edit and remove the tag and the link. Remove last character from line I want to remove last character from a line:  [root@ozzesh ~]#df -h | awk  '{ print $5 }' Use% 22% 1% 1% 59% 51% 63% 5%  Expected result:  Use 22 1 1 59 51 63 5 What are the differences between a multidimensional array and an array of arrays in C#? Proving inequality $(a+\frac{1}{a})^2 + (b+\frac{1}{b})^2 \geq \frac{25}{2}$ for $a+b=1$ It's not clear to me how to choose Spells Known when creating a new character at a higher level.  Let's take the Bard as a working example first:  Bard level 2:   Spells Known: 5 Slots per Spell level: 1st &times; 3   Bard level 3:   Spells Known: 6 Slots per Spell level: 1st &times; 4, 2nd &times; 2   I'm interpreting this to mean that, if an existing 2nd-level Bard gains a new level (level 3), he's gaining 1 (one) new spell known. He can then choose the new spell known to be either 1st or 2nd, correct?  What I don't understand then, is the case of creating a new character starting at a higher level; say, creating a new Bard at level 3.  In that case you're forced to choose 6 spells, which must be from the list of 1st- and 2nd-level spells, correct?  When making this 3rd-level Bard from scratch, though, can I select 2nd level spells for all 6 spells known?  As another example, say you're creating a very high level Bard from scratch, starting at level 15. The book says your Spells Known is 19, and your spell slots are 1st × 4, 2nd × 3, 3rd × 3, 4th × 3, 5th × 2, 6th × 1, 7th × 1, and 8th × 1.  So, for those 19 Spells Known, you can choose any spells from 1st through 8th spell level. Am I free then to select as many spells as I can at 8th spell level (5 in number), working backwards, and in the end ignoring the 1st, 2nd, 3rd level spells entirely?  As another example, the Ranger doesn't know any spells at 1st level, nor have any spell slots, but the book says “You know two 1st-level spells of your choice from the ranger spell list.” Does it mean at 2nd level and above?  Long story short: When choosing Spells Known for a spellcasting character created above 1st level, am I allowed to choose my Spells Known at whatever spell level I like, just so long as I have at least one spell slot of that level?  I'm working on a D&amp;D 5e character generator and need to clarify this. So I need to find the Convergence Radius and Convergence Domain of the complex power series: $\sum\limits_{n=0}^\infty \frac{1}{2^{n}} z^{2^n}$  I've tried looking at the individual parts of the series and rewriting it somehow but couldn't find a way.  It can probably be solved, after a step or two, by the formula $R=\frac{1}{\displaystyle\limsup_{n\rightarrow \infty}\sqrt[n]{|a_n|}}$ .  Thanks. Upgrading straight handlebars to drop handlebars I have a two-and-a-half year old  (with a road-bike-like frame and thin tires; it's somewhere in the loosely-defined "hybrid" range) that I use to commute to work, twenty-five miles round-trip, once or twice a week. The bike has straight handlebars, and having gotten used to the idea of commuting via bike, I'm interested in upgrading to drop handlebars. It looks like I'd need new break/shift levers to go with the handlebars; the whole upgrade looks like it'd run a couple hundred dollars. This is a sizable fraction of the original cost of the bike, which leads me to wonder if I'm better off saving my money for a new bike that's a little better adapted to my use.  Is upgrading my bike's handlebars a reasonable investment? I want to determine $$\lim\limits_{(x,y) \to (0,0)} \frac{x^2·y^3}{x^4+y^6}$$  I'm sure the limit exists, it's zero because I tried to find other different limits in line and parabola points ($(x,mx)$ and $(x,mx^2)$) but every time I got zero. So, I have to use the definition or sequences to confirm. I'm learning how to use the mirror modifier and I am having some trouble.  When I apply the modifier to my object I don't see a mirrored version of it.  What am I doing wrong? Last month, I was travelling on a backpacking trip across Russia and the Baltic states (Schengen zone). I'm an Indian by nationality. So I had to get the respective single entry visa for Russia and Schengen Europe.  At the border crossing into Estonia by road (at Ivangorod-Narva), I exited the Russian border with an exit stamp (so now I can't go back to Russia since I had a single entry visa). When I was at the immigration checkpoint of Estonia, I was heavily questioned on the intent of my travel to Europe while entering Estonia by road.   Though I finally got into Europe, It got me wondering - what happens if a foreign national is denied entry into a country not at the airport but by land between 2 countries he cannot go into ?  Generally, if you are denied entry at the airport the airline has the obligation to fly you back to your country. But what happens when you are stuck between two countries and you cant get into either ? What happens to you then ? Addons: Only some .zips will install Is there a way to get the path for the assembly in which the current code resides?  I do not want the path of the calling assembly, just the one containing the code.   Basically my unit test needs to read some xml test files which are located relative to the  dll.  I want the path to always resolve correctly regardless of whether the testing dll is run from TestDriven.NET, the MbUnit GUI or something else.  Edit: People seem to be misunderstanding what I'm asking.  My test library is located in say      C:\projects\myapplication\daotests\bin\Debug\daotests.dll   and I would like to get this path:     C:\projects\myapplication\daotests\bin\Debug\   The three suggestions so far fail me when I run from the MbUnit Gui:   Environment.CurrentDirectory gives c:\Program Files\MbUnit System.Reflection.Assembly.GetAssembly(typeof(DaoTests)).Location gives C:\Documents and Settings\george\Local Settings\Temp\ ....\DaoTests.dll System.Reflection.Assembly.GetExecutingAssembly().Location gives the same as the previous. What is the ideal data type to use when storing latitude / longitude in a MySQL database? Bearing in mind that I'll be performing calculations on lat / long pairs, what datatype is best suited for use with a MySQL database? How does Ubiquity determine the required disk space before installation? This question intends to demystify  the desktop installer for Ubuntu, on how the required disk space before installation is being determined.  From this dated post :     [When installing] Ubuntu 12.04 alongside with Windows 7 using the Ubuntu installer, [the user] wasn't able to give Ubuntu less than 32 GB [...] and as the guide states, "Ubuntu needs about 4.5 GB to install, so add a few extra GB to allow for your files".   The required disk space was previously about 5 GB (Ubuntu 12.04), 8 GB (Ubuntu 16.04), and has since increased to 25 GB (Ubuntu 18.04), as per . In practice, the absolute minimum for required disk space may differ by installation media and machine.  The design spec via  describes the installer mockup and nothing else about how the required disk space is determined (top half screenshot).    I have clarified that Ubuntu 16.04 will require at least 8 GB disk space only on a physical machine, but the minimum changes to 8.3 GB when installing to a virtual machine (bottom half screenshot).  So how does Ubiquity determine the required disk space? Martingale formulation of Bellman's Optimality Principle From David Williams' Probability with Martingales     Related question:   What I tried: For no 2, if $\ln Z_n - n \alpha$ is a supermartingale, then for $m &lt; n$, $$E[\ln Z_n - n \alpha | \mathscr F_m] \le \ln Z_m - m \alpha$$ $$ \to E[\ln Z_N - N \alpha | \mathscr F_0] \le \ln Z_0 - 0 \alpha$$ $$ \to E[\ln Z_N - N \alpha] \le \ln Z_0$$ $$ \to E[\ln \frac{Z_N}{Z_0}] \le N \alpha$$ Is that right?  For no 1, for $m &lt; n$, $$E[\ln Z_n - n \alpha | \mathscr F_m] = E[\ln Z_n | \mathscr F_m] - n \alpha$$ $$ = E[\ln \frac{Z_n}{Z_0} | \mathscr F_m] - n \alpha + \ln Z_0$$ $$ = E[\ln \frac{Z_n}{Z_{n-1}} | \mathscr F_m] + ... + E[\ln \frac{Z_{m+1}}{Z_{m}} | \mathscr F_m]$$ $$+ \ln \frac{Z_m}{Z_{m-1}} + ... + \ln \frac{Z_{1}}{Z_{0}} - n \alpha + \ln Z_0$$ Note that $$Z_n - Z_{n-1} \le |Z_n - Z_{n-1}| \le C_n |\epsilon_n - \epsilon_{n-1}| \le 2C_n \le 2Z_{n-1}$$ Also, I think $$\ln \frac{Z_n}{Z_{n-1}} \le |Z_n - Z_{n-1}|$$ Hence we have $$E[\ln \frac{Z_n}{Z_{n-1}} | \mathscr F_m] + ... + E[\ln \frac{Z_{m+1}}{Z_{m}} | \mathscr F_m]$$ $$+ \ln Z_m - n \alpha$$ $$\le E[2Z_{n-1} | \mathscr F_m] + ... + E[2Z_{m} | \mathscr F_m]$$ $$+ \ln Z_m - n \alpha$$ $$= 2(E[Z_{n-1} | \mathscr F_m] + ... + E[Z_{m} | \mathscr F_m])$$ $$+ \ln Z_m - n \alpha$$ One thing to do would be to show that $$2E[Z_{n-1} | \mathscr F_m] + ... + 2E[Z_{m} | \mathscr F_m] \le (n-m) \alpha$$ possibly by showing that $2E[Z_{\{\cdot\}} | \mathscr F_m] \le \alpha$ How would I do that? Something else: $$E[\ln \frac{Z_n}{Z_m} | \mathscr F_m] + \ln Z_m - n \alpha$$ $$ \le E[|Z_n - Z_m| | \mathscr F_m] + \ln Z_m - n \alpha$$ $$ \le E[2Z_m | \mathscr F_m] + \ln Z_m - n \alpha$$ $$ \le 2Z_m + \ln Z_m - n \alpha$$ Now $2Z_m \le (n-m) \alpha?$ We have $$2Z_m = 2\sum_{k=1}^{m} C_k(\epsilon_k - \epsilon_{k-1})$$ $$\le 2\sum_{k=1}^{m} Z_{k-1}$$ I'm not quite sure how to show that $$2\sum_{k=1}^{m} Z_{k-1} \le (n-m)\alpha$$ if that's even true. How can/else can I approach this problem?  For no 3, no idea. Any hints? I think it has something to do with a stopping time. Might we have to use the ff lemma (red box):    ? Data recovery from an accidental format on ext4 partition When I was installing Mint Debian edition unlike the classic edition, the installation automatically formated my home partition when I did not specify to format.  So the formatting previously was ext4 as is now. I believe the data is still there as it was a quick format.   I have now booted the computer up on a live USB to prevent writing on it.  Ran testDisk. Is there anyway to recover to a previous superblock so i can recover my data? Prove that the Gaussian Integer's ring is a Euclidean domain Simpler proof - Non atomic measures Suppose that $(X,\mathcal{E},\mu)$ is a non-atomic finite measure space (i.e. for every $E \in \mathcal{E}$ with $\mu(E)&gt;0$ there exists $F \subset E$ measurable such that $0&lt;\mu(F) &lt;\mu(E)$.)  a) Prove that for every $ \varepsilon &gt;0$ there is a finite partition of $X$ in measurable subsets $X_1,..,X_n$ such that $\mu(X_i)\leq \varepsilon$.  b) Prove that for every $\alpha \in [0,\mu(X)]$ there exists $E \in \mathcal{E}$ with $\mu(E)=\alpha$.    I guess that a) is given to prove b) more easily. I have the following idea of solution for a) (inspired from , which proves b)  )  Denote  $$ \Gamma = \{ (X_1,..,X_n) : n &gt;&gt; \mu(X)/\varepsilon, X_i \text{ are disjoint }, \mu(X_i)\leq \varepsilon \}$$ ordered by componentwise inclusion. Totally ordered parts $(Y_\alpha)$ of $\Gamma$ have an upper bound element $(\bigcup Y_\alpha^i)_{i=1}^n$ which is still in $\Gamma$.   By Zorn's lemma $\Gamma$ has maximal elements. If a maximal $(X_1..X_n)$ element is not a partition, then we can replace it with something better, of the form $(X_1,..,X_n\cup A)$ where $A \subset X \setminus (X_1 \cup..\cup X_n)$ and $\mu(A)&gt;0$.     My questions are:  1) Is my solution of a) correct? I feel that the part with the upper bound element may not work, since there might be noncountable unions.  2) What is a simpler solution of a)?