Let $(a_n)_{n\in \mathbb{N}}$ and $(b_n)_{n\in \mathbb{N}}$ be two real sequences that satisfy $a_n\geq b_n, \forall n \in \mathbb{N}$ and converge to some $a,b$, respectively.  Is it always true that $a \geq b$?
I'm stuck with the proof of the following:  Suppose that $(s_n)$ converges to $s$, $(t_n)$ converges to $t$, and $s_n \leq t_n \: \forall \: n$. Prove that $s \leq t$.   I've tried starting with $s_n \leq t_n \: \forall : n$ and the definitions of each limit (i.e. $|s_n - s| \leq \epsilon \: \forall \: n &gt; N_1$), but I'm not really getting very far. Any help is appreciated!
How to create a shortcut that executes an xdotool command to simulate a key press? I'm trying to simulate a media key press using a custom shortcut.  So far, I've been able to achieve the simulation I need using the command:  xdotool key XF86AudioPlay   It works perfectly, it pauses or starts the music player every time it is run.  The problem comes when trying to run it as a shortcut.  First I tried to run an alias with a custom shortcut, but it did not work.  As explained on :     The commands run by keyboard bindings are not parsed via a shell. Your best bet is to create a directory bin in your homedir.   Next I created the suggested script and named it simplay:  #!/bin/sh xdotool key XF86AudioPlay   It is located inside a bin folder which is part of the PATH, this works fine and can be run from any location.  When trying to create the Custom Shortcut, I was unable to get it to execute, the configuration is the following:  Name: test Command: simplay  Shortcut: Ctrl+Alt+R   After searching a bit more I found another way to execute the shortcut:  gnome-terminal -e simplay   I tried it on a terminal and noticed that when executing it it would rapidly open a new terminal window, execute the child process, pausing the music and immediately close the window.  I changed the command on the shortcut and when hitting it I noticed the same behavior opening a terminal and immediately being closed but this time the child process did not pause the music, which makes me think that the script has been called on all my previous attempts but it is somehow not being able to execute.  How can I solve this problem according to your knowledge? Prove that $\lambda = 0$ is an eigenvalue if and only if A is singular. I'm trying to prove that statement: Prove that $\lambda = 0$ is an eigenvalue if and only if $A$ is singular.  I'm not sure if my proof is totally correct:  Suppose that $\lambda = 0$ if det(A) = $\lambda_1 \cdot \lambda_2 . . .\lambda_n = 0$ then A is singular.  If anyone could show me a better proof that would help. How to stop a script from running if it's not root (and echo "Not running as root! Exiting...") It is well known that compactness implies pseudocompactness; this follows from . I know that the converse does not hold, but what is a counterexample?  (A  is a topological space $S = \langle X,{\mathfrak I}\rangle$ such that every continuous function $f:S\to\Bbb R$ has bounded range.) Is it possible to 'fly to location' in Leaflet in the same way as  example? What should I do, as my submitted paper is still under review after 1 year? So from what I remember it was on cable TV. The main hero was a TV actor zapped to a alien planet. It had a evil overlord with a virgin priestesses. She wants to get laid but he refuses because the next priestesses is only three. Regardless it's a parody things include a man who was maimed by the evil overlord wants revenge the hero eventually screws the virgin priestesses it cuts to scenes of a train going into a tunnel and a volcano erupting. Maximal ideal in the ring of continuous functions from $\mathbb{R} \to \mathbb{R}$ Well, the problem I'm trying to solve is this:      Let $A$ be the ring of all continuous functions from $\mathbb{R} \to \mathbb{R}$. Show that $M = \{f \in A: f(0)=0\}$ is a maximal ideal of $A$.   I tried to show that if $J$ is an ideal of A that properly contains M, so $J = A$: we know that there is a function $g \in J$ with $g(0) \neq 0$. So, we have that $$J \supseteq \langle g, M\rangle=\{ag+f;a \in A, f\in M\}$$   I tried to show that 1 $\in$ $\langle g,M\rangle$. However I'd have to find some function $h(x)\in A$ such that $h(x)(ag+f) = 1$, but this function $h$ has to be different from 0 for all x $\in \mathbb{R}$, so I don't know how to find this function.  My second idea to solve this problem was prove that the quocient $A/M$ is a field. We have that $$A/M = \{h(x) + M; h(x) \in A\},$$ but again I have the problem to show that all elements of $A/M$ are units.  If someone could help, I would be really grateful (: I have a Canon 550D which I've been using for around a year now. I really love it and have learned a great deal with this and the 18 - 135mm kit lens. But now with experience I feel the need to get some better glass. I won't be buying a new body any time soon because I figure investing in some good glass is more important.   As I have looked around, I see quite a few good used L lenses I can get in ebay for good bargain prices. But I know that the EF lenses don't have the same focal length in the cropped sensors. Is it a wise decision to buy these EF lenses or buy the cropped sensor alternatives?  I have the following lenses in mind that I am looking to buy down the line from the canon range over the next several months.  16-35mm f/2.8L, 24-70mm f/2.8L, 70-200 f/4L.  Are these apt choices for cropped sensors? I know most pros with FFs use these but I am a bit skeptic that they will serve the same purpose for me. If so what are the alternatives for this that have almost as good image quality? How should I print types like off_t and size_t? Sample query/DDL for producing page locks on a clustered index in SQL Server (without hints) We currently have some indexes where ALLOW_PAGELOCKS is set to off. This presumably was done in order to reduce deadlocks. However I doubt that it would really had an effect back then.   Now I am trying to understand WHEN SQL Server actually chooses to start locking pages rather than keys in a clustered index. I asked Jonathan Keyhaisas recently and he told me that this could happen if I am touching rows on several subsequent pages. However I didn't manage to get any exclusive page locks by updating rows in a clustered index with a sample query.   Could you help me understand page locks better with a sample query and table? I am running SQL Server 2008 SP4.  Thanks in advance  Martin In the Phone app (iPhone 5, iOS 6.1.2), I click on a contact's number, the call is initiated and starts ringing.   For a brief moment at this point, the label of the number (home / work / etc…) is displayed alongside the contact's name, but it quickly is removed and replaced with the call timer counting up and only the name (and picture of the contact) are shown.      How can I see the number that is being called during a phone call? Inexact measurement and wavefunction collapse As is usually said, measurement of an observable $q$ leads to collapse of wavefunction to an eigenstate of the corresponding operator $\hat q$. That is, now the wavefunction in $q$ representation is $\psi(q)=\delta(q-q_0)$ where $q_0$ is result of measurement.  Now, in reality measurements are never exact, so the wavefunction should not have that sharp peak. Instead it should be broadened depending on precision of measurement. In this case, can we still introduce an operator, an eigenstate of which would the new wavefunction appear? Is it useful in any way? Or does the new wavefunction depend too much on the way it was measured so that each instrument would have its own operator? How would such opeartor look e.g. for a single-slit experiment? Why do we say that the Earth moves around the Sun? Every finite group is isomorphic to some Galois group for some finite normal extension of some field. Verification the integral identity $\int_0^\pi \ln(1+\alpha\cos(x))dx=\pi\ln\left(\frac{1+\sqrt{1-\alpha^2}}{2}\right)$. I have to verify that     $$\int_0^\pi \ln(1+\alpha\cos(x))dx=\pi\ln\left(\frac{1+\sqrt{1-\alpha^2}}{2}\right)$$   with $|\alpha|&lt;1$. It is my homework and don't know where to begin. Using ECDSA keys for encryption I know that ECDSA is used for signature only, but I wonder if I can use the public/private Elliptic Curve keys for encryption too.  I have ECDSA SSH public keys and I wonder if I can use them to encrypt data that only the matching machine could decrypt, writing the proper software.  Pointers welcomed. Sum of real numbers that multiply to 1 I've seen a question in my math book with this explanation above it: "If the product of n positive real numbers is 1, then the sum of these numbers must be more than n". I was wondering if this is correct, and if it is, could someone give an explanation or a proof for it? Does entropy increase or decrease as our Universe is expanding? Scientists say that entropy of our universe is increasing as it is expanding and our universe is cooling down gradually from the time of its birth. If something is getting cooler and cooler, then how can it become more random (entropy increase) with the passage of time? According to laws of thermodynamics, at absolute zero temperature, the entropy is zero. That means as we go down and down to the temperature scale entropy must decrease, but why is it not happening in the case of our universe? I've often come across posts on forums or other websites where you see people joking in such a manner about running/logging in as root as if it's something awful and everyone ought to know about it. However, there isn't much that a search reveals on the matter.   It may be widely known to Linux experts, but I really don't know why. I remember always running as root when I first tried Linux years ago (Redhat and Mandrake) and don't remember running into any problems because of that.   There are actually some distros that have a bright red background with alert signs all over it as wallpaper for the root user (SuSe?). I still use the "Administrator" account for regular use on my Windows installation and haven't ever run into any problems there either.