Pygame program that can get keyboard input with caps
Pygame: Is there any easy way to find the letter/number of ANY alphanumeric pressed?
Why is Python running my module when I import it, and how do I stop it? I need to remove all files with .gif extension except one file with name say "filename.gif". What is the optimal way to go about doing this in terminal?  The command rm *.gif removes all gif files including the file filename.gif. Split-like environment inside cases environment How do I merge 2 VMware disks in to a single one? I have installed an Ubuntu server on a VMWare workstation with a space of 20GB storage as seen below:    After the installation I've attached another 40GB worth storage to the existing Ubuntu server installation (seen below):    Now I want to add this 40GB to my / (root) directory it mean's  I want that my / directory became to 60G , like it will be resize from 20G to 60G (20G + 40G), i don't know what should i do, can any body help me ?  , my df -h result shows;  root@Userver:~# df -h Filesystem      Size  Used Avail Use% Mounted on /dev/sda1        18G  900M   16G   6% / udev            990M  4.0K  990M   1% /dev tmpfs           400M  308K  399M   1% /run none            5.0M     0  5.0M   0% /run/lock none            999M     0  999M   0% /run/shm none            100M     0  100M   0% /run/user root@Userver:~#   it must be 60G !  i have no graphic mode, then i can't use Gparted tools, i'm just have ssh access ! Prove  that the function $\displaystyle f(x)=\frac{x}{x^2+1}$ is continuous at $x=-1$. You should give a proof that is directly based on the  definition of continuity.   I saw many similar questions on this website, but none of them gave me a satisfactory answer. I more or less understand how epsilon-delta proofs work but my problem lies more in the algebraic manipulations probably. So here's my "attempt".  Definition of continuity; for $f:A \to \mathbb{R}$     $$\forall \varepsilon &gt;0 \ \exists\delta&gt;0\ \forall x \forall x_0 \in A:|x-x_0|&lt;\delta \Rightarrow |f(x)-f(x_0)|&lt;\varepsilon$$   So from what I understand, the procedure for epsilon-delta proofs are as follows: 1. Plug the point of interest $x_0$ into $|f(x)-f(x_0)|&lt;\varepsilon$ 2. Write $x$ in terms of $\varepsilon$ 3. Then plug $x$ into $|x-x_0|&lt;\delta$ 4. Find $\delta$ in terms of $\varepsilon$. Done    At step 1, we have $\left|\dfrac{x}{x^2+1}+\dfrac{1}{2}\right|&lt;\varepsilon$. Step 2 is where I'm stuck because of the 2nd degree polynomial in the denominator. First, I did this: $\left|\dfrac{x}{x^2+1}\right|&lt;\left|\dfrac{x}{x^2+1}+\dfrac{1}{2}\right|&lt;\varepsilon$. Then, I wasn't too sure about what to do, I thought about getting rid of the "$1$", but that would screw up my inequality. I thought about factoring $x^2+1$, but it doesn't have any real roots. I tried inverting the fraction, but that led me to nowhere. And I've already exhausted the tools I have. How do I proceed?  Apparently, epsilon-delta proofs are the most basic building blocks of analysis. And I'm already failing, this is both embarrassing and depressing... can I reflectively instantiate a generic type in java? Is it possible to reflectively instantiate a generic type in Java? Using the technique described  I get an error because class tokens cannot be generic. Take the example below. I want to instantiate some subclass of Creator that implements Creator. The actual class name is passed in as a command line argument. The idea is to be able to specify an implementation of Creator at runtime. Is there another way to accomplish what I'm trying to do here?  public interface Creator&lt;T&gt; {     T create(); } public class StringCreator implements Creator&lt;String&gt; {     public String create() { return new String(); } } public class FancyStringCreator implements Creator&lt;String&gt; {     public String create() { return new StringBuffer().toString(); } } public static void main(String[] args) throws Exception {     Class&lt;?&gt; someClass = Class.forName(args[0]);     /*ERROR*/Class&lt;? extends Creator&lt;String&gt;&gt; creatorClass = someClass.asSubclass(Creator.class);     Constructor&lt;? extends Creator&lt;String&gt;&gt; creatorCtor = creatorClass.getConstructor((Class&lt;?&gt;[]) null);     Creator&lt;String&gt; creator = creatorCtor.newInstance((Object[]) null); }   Edit: I like Marcus' approach as being the most simple and pragmatic without circumventing the whole generics thing. I can use it in my situation because I can specify that the class passed must be a subclass of StringCreator. But as Ericson pointed out the generic information is still there at the type level, just not at the runtime level so it is still possible to reflectively examine whether a given class implements the correct generic type. Carmichael number square free Show that if $n$ is a , then $n$ is a square-free.  I did this: Let $n= (p^t)(m)$  where $t &gt;1$. Then by modular property,  $$b^p= b \mod n , \,\, b^m= b \mod n$$ Above two equations are also true in$\mod p$, $\mod p^t$. But in$\mod m$, just $b^n=b \mod m$.  And I tried to use CRT But I couldn't.  I think that I've chosen wrong way Dividing an equilateral triangle into N equal (possibly non-connected) parts It’s easy to divide an equilateral triangle into $n^2$, $2n^2$, $3n^2$ or $6n^2$ equal triangles. But can you divide an equilateral triangle into 5 congruent parts? Recently M. Patrakeev  an awesome way to do it — see the picture below (note that the parts are non-connected — but indeed are congruent, not merely having the same area). So an equilateral triangle can also be divided into $5n^2$ and $10n^2$ congruent parts.  Question. Are there any other ways to divide an equilateral triangle into congruent parts? (For example, can it be divided into 7 congruent parts?) Or in the opposite direction: can you prove that an equilateral triangle can’t be divided into $N$ congruent parts for some $N$?                                               (Naturally, I’ve tried to find something in the spirit of the example above for some time — but to no avail. Maybe someone can find an example using computer search?..) I’d prefer to use finite unions of polygons as ‘parts’ and different parts are allowed to have common boundary points. But if you have an example with more general ‘parts’ — that also would be interesting. How can I get the HTML source of a given web address in C#? How to filter a list by hour Solving linear congruences by hand: modular fractions and inverses When I am faced with a simple linear congruence such as  $$9x \equiv 7 \pmod{13}$$ and I am working without any calculating aid handy, I tend to do something like the following:  "Notice" that adding $13$ on the right and subtracting $13x$ on the left gives: $$-4x \equiv 20 \pmod{13}$$  so that $$x \equiv -5 \equiv 8 \pmod{13}.$$  Clearly this process works and is easy to justify (apart from not having an algorithm for "noticing"), but my question is this: I have a vague recollection of reading somewhere this sort of process was the preferred method of C. F. Gauss, but I cannot find any evidence for this now, so does anyone know anything about this, or could provide a reference? (Or have I just imagined it all?)  I would also be interested to hear if anyone else does anything similar. What is $P(X > 0 \mid X + Y > 0)$ given that $X, Y$ are i.i.d standard normal? Soundness of a rule of a proof system with respect to the truth tables? I have the following question: "Explain the concept of the soundness of a rule of a proof system with respect to the truth tables"  Would it be correct to state the following:  "A rule of a proof system is sound with respect to the truth tables iff the conditions of the rules (requirements of the rule) ensure that the final formula will behave according to it's intended truth table."?  This is a question in a practice exam, and I can not find a specific mentioning so far, by scanning Google and Proof Wiki.  What would the correct answer be?  Thank you. Equality holds in triangle inequality iff both numbers are positive, both are negative or one is zero How do we show that equality holds in the triangle inequality $|a+b|=|a|+|b|$ iff both numbers are positive, both are negative or one is zero? I already showed that equality holds when one of the three conditions happens. How to convert Strings to and from UTF8 byte arrays in Java In Java, I have a String and I want to encode it as a byte array (in UTF8, or some other encoding). Alternately, I have a byte array (in some known encoding) and I want to convert it into a Java String. How do I do these conversions? For example:     Ever wish you could share information broadly   Could it be rewritten to:     Ever wish you could broadly share information   Are there any rules for the position of the adverbs. I'm currently reading a little deeper into the Axiom of Choice, and I'm pleasantly surprised to find it makes the arithmetic of infinite cardinals seem easy. With AC follows the Absorption Law of Cardinal Arithmetic, which states that for $\kappa$ and $\lambda$ cardinal numbers, the larger infinite and the smaller nonzero, then $\kappa+\lambda=\kappa\cdot\lambda=\max(\kappa,\lambda)$.  I was playing around with the equation $k+\aleph_0=\mathfrak{c}$ for some cardinal $k$. From the above, it follows that $\mathfrak{c}=k+\aleph_0=\max(k,\aleph_0)$, which implies $k=\mathfrak{c}$.  I'm curious, can we still show $k=\mathfrak{c}$ without the Axiom of Choice? Is it maybe possible to bound $\mathfrak{c}-\aleph_0$ above and below by $\mathfrak{c}$? But then I'm not quite sure such algebraic manipulations even mean anything, or work like that here. Certainly normal arithmetic does not! Thanks. Impact of changing instances' passwords As part of a security policy, the company I work for has given me the task of changing the sa's and SQL Server Agent service accounts' passwords for several instances.  What's the possible impact of doing this? Is there anything in particular I should watch out for? Is there any whitepaper, guide or even blog post about this kind of task? What kind of 'backup' plan should I have in place in case anything goes wrong?  Any guidance is appreciated. Process substitution and pipe I was wondering how to understand the following:     Piping the stdout of a command into the stdin of another is a powerful   technique. But, what if you need to pipe the stdout of multiple   commands? This is where process substitution comes in.   In other words, can process substitution  do whatever pipe can do?   What can process substitution do, but pipe cannot? How do you use the Dungeon Defender's Portal Gun? The topic pretty much sums up my question. I have not yet figured out how the gun operates aside from the fact that it creates Portal portals. The weapon description indicates that it deals 250+ base damage, but how is that damage applied to the monsters?