Installing Mods for 1.5.2
How to install mods for the new Minecraft launcher
I am looking for an option to require a passcode to power off my iPhone. That way, if the phone is lost, the person who finds it cannot simply turn it off, rendering Find My iPhone useless. Is there a way to accomplish this? Extended Euclidean Algorithm: backward vs. forward Suppose Player 1 has a Dragon on the table and  in hand, while Player 2 has two Spiders on the table.  Player 1 chooses to attack with the Dragon and Player 2 chooses to block with one of the Spiders.  Before combat damage is to be dealt, Player 1 uses Unsummon on the blocking Spider.    Does Player 2 take any life damage from the attacking Dragon? I'm looking to find out if there's any easy way to calculate the number of ways to tile a $3 \times 2n$ rectangle with dominoes. I was able to do it with the two codependent recurrences  f(0) = g(0) = 1 f(n) = f(n-1) + 2g(n-1) g(n) = f(n) + g(n-1)   where $f(n)$ is the actual answer and $g(n)$ is a helper function that represents the number of ways to tile a $3 \times 2n$ rectangle with two extra squares on the end (the same as a $3 \times 2n+1$ rectangle missing one square).  By combining these and doing some algebra, I was able to reduce this to  f(n) = 4f(n-1) - f(n-2)   which shows up as sequence , confirming that this is the correct recurrence.  The number of ways to tile a $2 \times n$ rectangle is the Fibonacci numbers because every rectangle ends with either a verticle domino or two horizontal ones, which gives the exact recurrence that Fibonacci numbers do. My question is, is there a similar simple explanation for this recurrence for tiling a $3 \times 2n$ rectangle? Fibonacci Sequence and series limits 1) Let $F_1 = 1$, $F_2 = 1$, and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 3$.   How do you prove that  $$\sum_{n=2}^\infty \frac1{F_{n-1} F_{n+1}} = 1$$   $$\sum_{n=2}^\infty \frac{F_n}{F_{n-1} F_{n+1}} = 1$$   Do you even use the formula $n(n+1)/2$?   I tried using $F_{n-1} = F_n - F_{n-2}$ and $F_{n+1} = F_n + F_{n-1}$ and then trying to figure out how to substitute those, but I've been going around in circles. How would you solve this? What tips can you give me to solve this? Is there any website that teaches this? I tried searching google and youtube but none were helpful.   2) Let $s_x = \tan(2/x)$. Where does this become nonincreasing? While using monotonic limits to establish there is a limit.   I was guessing you need to use upperbound and lowerbound but doesn't it go to infinity? Skype window problem in Ubuntu 14.04 Prove that if $f$ is a real continuous function such that $|f|\le 1$ then $|\int_{|z|=1} f(z)dz| \le 4$ I've encountered the following problem in complex analysis:  Prove that if $f$ is a real continuous function such that $|f|\le 1$ then $|\int_{|z|=1} f(z)dz| \le 4$.  I've decomposed $f$ to it's real and imaginary parts and got that it's enough to prove that:  $(\int_0^{2\pi}cos(\theta)g(\theta)d\theta)^2 +(\int_0^{2\pi}sin(\theta)g(\theta)d\theta)^2 \le 16$   Where $g(\theta)=f(e^{i\theta})$.   But now I'm stuck. Any ideas?  Thanks I have two NTFS partitions, and I don't want to mount them manually every-time I start Ubuntu.   How can I do this?  Is there a tool or a code to use?   If so, is it safe to automount? specially when they are being used by another OS? How do I get timestamp from e.g. 22-09-2008? Bullied boy given immense powers by an alien race who destroys the human race Looking to identify a short story I read in a sci-fi anthology as a child, about an angry, bullied somewhat misanthropic boy who is given immense near-omnipotent powers by an alien intelligence. I read this in English, sometime in the late 1990s/early 2000s. He goes on to use this power to destroy the human race, which causes him to age terribly in a very short amount of time. At the end of the story he is a lonely old man stripped of the powers he held briefly, and is alone on an isolated Earth. The aliens then proceed to invade Earth. What is "Best Practice" For Comparing Two Instances of a Reference Type? I came across this recently, up until now I have been happily overriding the equality operator (==) and/or Equals method in order to see if two references types actually contained the same data (i.e. two different instances that look the same). I have been using this even more since I have been getting more in to automated testing (comparing reference/expected data against that returned). While looking over some of the  I came across an  that advises against it. Now I understand why the article is saying this (because they are not the same instance) but it does not answer the question:  What is the best way to compare two reference types? Should we implement ? (I have also seen mention that this should be reserved for value types only). Is there some interface I don't know about? Should we just roll our own?!  Many Thanks ^_^ Update Looks like I had mis-read some of the documentation (it's been a long day) and overriding  may be the way to go..  If you are implementing reference types, you should consider overriding the Equals method on a reference type if your type looks like a base type such as a Point, String, BigNumber, and so on. Most reference types should not overload the equality operator, even if they override Equals. However, if you are implementing a reference type that is intended to have value semantics, such as a complex number type, you should override the equality operator. Why does (insert favorite search engine here) get better search results than SO, SF, or SU's own search function? I've lost count of the number of times I've either asked a question or been answering a question only to have it closed as an exact duplicate. But searching for the question turns up  a list of seemly unrelated results using the sites builtin search. Then if I switch to a general web search engine and limit its scope to just SO, SF or SU I find the question within the first two or three results.  Why is this?  I'm pretty sure this isn't an exact duplicate of another question though I did find some that were at least somewhat related (using google).  Update:  I also have gotten (somewhat) better results by simply typing a question and browsing the generated list of related questions. Still a search feature that doesn't return good results isn't going to be used by most people.  Common sense would suggest (though common sense isn't always the best indicator) that a targeted solution to a specific problem domain should be superior to a generalized solution. In most cases this appears to hold true. Square root of 1 is (not) -1 Possible Duplicate:          I was thinking on the following line of thoughts: $1 =  \sqrt{1} = \sqrt{-1 \cdot -1} = \sqrt{-1} \cdot \sqrt{-1} = i^2 = -1$  Of course this is not true, but I was wondering which step in this 'line of thoughts' is forbidden to make?   Thanks for the explanation. How can I subdivide this plane into even squares? I need to find a bottleneck and need to accurately as possible measure time.  Is the following code snippet the best way to measure the performance?  DateTime startTime = DateTime.Now;  // Some execution process  DateTime endTime = DateTime.Now; TimeSpan totalTimeTaken = endTime.Subtract(startTime); How to make unit selection circles merge? Radius of Convergence of a given Power series Why doesn't a block rotate due to friction? What is the purpose of the EBP frame pointer register? How to completely uninstall gnome-shell and all extensions?