Why doesn't find work recursively with a wildcard over SSH?
'find' utility does not output all files when using wildcards
Convergence of sequence of real numbers and (sub)subsequence Let $(x_n)_{n\in \mathbb{N}}$ be a sequence of real numbers. A well known result is:     The sequence $(x_n)_{n\in \mathbb{N}}$ converges to $a\in \mathbb{R}$ if and only if every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ converges to $a\in \mathbb{R}$.   Now, I'm working on an exercise which essentialy asks to prove the following:     The sequence $(x_n)_{n\in \mathbb{N}}$ converges to $a\in \mathbb{R}$ if and only if for every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ there is a (sub)subsequence $(x_{n_{k_j}})_{j\in \mathbb{N}}$ which converges to $a$.   Now, one direction is trivial. If in fact $(x_n)_{n\in \mathbb{N}}$ converges to $a$, then by the result I've mentioned, every subsequence of $(x_{n})_{n\in \mathbb{N}}$ converges to $a$. Let then $(x_{n_k})_{k\in \mathbb{N}}$ be an arbitrary subsequence. In that case, we know that it is a subsequence of itself, and hence we've found a (sub)subsequence which converges to $a$.  The other way around seems quite complicated for me. The reason is as follows: I must assume that every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ has a (sub)subsequence which converges to $a$ and the proof that the original one converges to $a$.  My problem is exactly that "a". If it had all (sub)subsequences converging to $a$, then by the result i've mentionted, the subsequence $(x_{n_k})_{k\in \mathbb{N}}$ would converge to $a$. In that case, we would have every subsequence converging to $a$ and the result would follow.  My idea to prove the claim was then:  First remember that a subsequence is the restriction of the original one $x: \mathbb{N}\to \mathbb{R}$ to an infinite subset $\mathbb{N}'\subset \mathbb{N}$. In that case a (sub)subsequence is the restriction of $\tilde{x} = x|\mathbb{N}'$ to an infinite subset $\mathbb{N}''\subset \mathbb{N}$. But since $\tilde{x}$ is the restriction of $x$ to $\mathbb{N}'$ and since $\mathbb{N}''\subset \mathbb{N}'$, the restriction of $\tilde{x}$ to $\mathbb{N}''$ is itself the restriction of $x$ to $\mathbb{N}''$.  In other words, every (sub)subsequence can be viewed as a subsequence of the original one. Considering this, by hypothesis every subsequence has a (sub)subsequence which converges to $a$. But by this argument, this means that we can replace every subsequence with a convergent one. And then we can use the result I stated.  Is my idea correct? Is this really the way to prove the claim? My only doubt is that I need every subsequence converging to $a$ to use the result. In this case I can't see how I can argue that this implies every subsequence converges to $a$.  How can I finish this proof? In my laptop (a Lenovo y470 ) there are three USB ports. One of those is USB 3.0 others are USB 2.0 . I do not know which one is what. When I copy data from my External HDD it transfers at 38MB/s from all of the USB ports. (Which is a good speed for USB 2 transfers, but to low for USB 3).  I used the device manager to confirm that I have one USB 3.0 port.    Is there a way a can figure out which port is 3.0 ? How do I fork a process that doesn't die when shell exits? How can I find out the variable name in python? I know how I can find out the python command by clicking a button in the Blender interface, and then look in the info window:   For example, as can be seen, I added a cube, UV sphere, plane, camera, lamp, pressed A twice.  But how can I find out an object variable name, for example the y-rotation of an object. Because I can't find the y-rotation, when I point my mouse over it, I can only find the rotation: Adding Foreign Key Error Windows 7 USB install error I am trying to install Windows 7 Professional x64 from a bootable USB stick. I have used the Windows 7 USB DVD Download Tool to create the media from an ISO.  The machine boots from USB fine, and enters the Windows installation wizard but then I get an error stating:     A required CD/DVD drive device driver is missing. If you have a driver floppy disk, CD, DVD, or USB flash drive, please insert it now.   I have tried setting the SATA controller in the BIOS to both AHCI and ATA but neither appear make any difference.  I've also tried both the USB 3 and USB 2 ports with no difference.  I've also tried to use the files from an official Dell recovery CD as this is a Dell laptop but again, no dice.  All this because there's no optical drive in the machine!  Dell Vostro V131 / i5-2450M / BIOS A04  Can anyone offer any advice please? The gravitational force on your body, called your weight, pushes you down onto the floor. $$W=mg$$ So, what is the weight equation through general relativity? Simulate a uniform distribution on a disc I was attempting to simulate injection of random points within a circle, such that any part of the circle has the same probability of having a defect.  I expected the count per area of the resulting distribution to follow a Poisson distribution if I break up the circle into equal area rectangles.    Since it requires only placing points within a circular area, I injected two uniform random distributions in polar coordinates: $R$ (radius) and $\theta$ (polar angle).  But after doing this injection, I clearly get more points in the center of the circle compared to the edge.     What would be the correct way to perform this injection across the circle such that the points are randomly distributed across the cirlce? Prove that if the identity is written as the product of $r$ transpositions, then $r$ is an even number Theorem. If the identity is written as the product of $r$ transpositions, $id=τ_1τ_2\dots τ_r$, then $r$ is an even number. Proof. We will employ induction on $r$. A transposition cannot be the identity; hence, $r &gt; 1$. If $r = 2$, then we are done. Suppose that $r &gt; 2$. In this case the product of the last two transpositions, $τ_{r−1}τ_r$, must be one of the following cases: $(ab)(ab) = id\\ (bc)(ab) = (ac)(bc)\\ (cd)(ab) = (ab)(cd)\\ (ac)(ab) = (ab)(bc),$ where $a$, $b$, $c$, and $d$ are distinct. The first equation simply says that a transposition is its own inverse. If this case occurs, delete $τ_{r−1} τ_r$ from the product to obtain $id=τ_1τ_2···τ_{r−3}τ_{r−2}$. By induction $r − 2$ is even; hence, $r$ must be even. In each of the other three cases, we can replace $τ_{r−1} τ_r$ with the right-hand side of the corresponding equation to obtain a new product of $r$ transpositions for the identity. In this new product the last occurrence of $a$ will be in the next-to-the-last transposition. We can continue this process with $τ_{r−2} τ_{r−1}$ to obtain either a product of $r − 2$ transpositions or a new product of $r$ transpositions where the last occurrence of $a$ is in $τ_{r−2}$. If the identity is the product of $r − 2$ transpositions, then again we are done, by our induction hypothesis; otherwise, we will repeat the procedure with $τ_{r−3}τ_{r−2}$. At some point either we will have two adjacent, identical transpositions canceling each other out or $a$ will be shuffled so that it will appear only in the first transposition. However, the latter case cannot occur, because the identity would not fix $a$ in this instance. Therefore, the identity permutation must be the product of $r − 2$ transpositions and, again by our induction hypothesis, we are done. Question: That is the proof written in the book, but unfortunately after more than $10$ times reading I don't understand the last two paragraph (i.e., from &quot;In each of the other three cases&quot;). Is there another simpler proof or could someone please clarify what is going on? Thank you. Why is my crontab not working, and how can I troubleshoot it? This is a  about using cron &amp; crontab.   You have been directed here because the community is fairly sure that the answer to your question can be found below. If your question is not answered below then the answers will help you gather information that will help the community help you. This information should be edited into your original question.  The answer for 'Why is my crontab not working, and how can I troubleshoot it?' can be seen below.  This addresses the cron system with the crontab highlighted. Should I upgrade to the "mainline" kernels? How to efficiently count the number of keys/properties of an object in JavaScript? What's the fastest way to count the number of keys/properties of an object?  It it possible to do this without iterating over the object?  i.e. without doing  var count = 0; for (k in myobj) if (myobj.hasOwnProperty(k)) count++;   (Firefox did provide a magic __count__ property, but this was removed somewhere around version 4.) A skydiver jumps out of a plane from a height of $2200$m. The skydiver's height, $h$ meters above the ground, can be modeled by the function $$s = 2200 - 4.9t^2$$ How fast is the skydiver falling at $t = 4$s?  If the skydiver is approaching a height of $2200$m, I reasoned that I could use the following definition to find the solution $${f(x+h)-f(x)\over h}$$ I entered the function into this definition and got stuck when I got to this$$f'(x) = \lim_{x\to 0} {2200-4.9t^2-9.8th-4.9h^2\over h}$$ Where can I go from here? Can I continue with this method or did I make a mistake a few steps back? New Solution  How does this look? Alternating sum of binomial coefficients multiplied by (1/k+1) I'm trying to prove that  $$\sum_{k=0}^n {n \choose k} (-1)^k \frac{1}{k+1} = \frac{1}{n+1}$$  So far I've tried induction (which doesn't really work at all), using well known facts such as  $$\sum_{k=0}^n {n \choose k} (-1)^k = 0$$  and trying to apply identities like  $${n \choose k} = {n-1 \choose k-1} + {n-1 \choose k}$$  Would anyone be able to point me towards the right method? Should I be looking to apply an identity or is there a method I'm missing? Is it possible that your friends can join your Hamachi server when they don't have Hamachi? Does anyone know how to do that??!! Stack Overflow in ES, PT, RU, JP have mixed-language descriptions With biblatex, alphabetic style, I have     &lt;author&gt;. &lt;title&gt;   But I want to have a colon ":" instead of the period "." after the author:     &lt;author&gt;: &lt;title&gt;   What do I have to change? Can we show new/anonymous users more Q&A? With left nav, responsive design, and various new-user notices, this is what an anonymous user currently sees (browser window here is 1090px wide):    I realize that a lot of this content -- code of conduct, new-user intro, cookies notice -- is important.  And I get that the left nav is an important design element, and responsive design dictates the width of the right column.  But when you add it all up, Q&amp;A -- what the site is about -- gets a distressingly small portion of the screen.  Can we do better?   Maybe we can make that intro/mini-tour shorter? Maybe we can hide the right column for anonymous users? Maybe some things can wait until the user's viewed a few pages? Maybe other things I haven't thought of?   My concern is that anonymous users -- people coming from Google, people who were referred to a site by users hoping to recruit them, or others who find their way to us but aren't invested in us -- will turn away before seeing how rich and helpful our sites are.  Which would be a real shame, because our sites are awesome.  First impressions matter.  When I'm asking a rabbi to check out Mi Yodeya or a professional chef to check out Seasoned Advice or my vet to check out Pets (all of these have happened), I want to make a good impression.  I want the person to see more than 2.5 questions; I want to increase the chances the person will see something interesting or say "oh I can answer that!" and dig deeper.  Yes, the other stuff is important, but maybe not now?  Is there a better way to "stage" all this information for people we haven't yet hooked? Is there a way to access QGIS plugins in Python?   I'd like to write a script to do some geoprocessing, and I'd like to use the clip, regular points and convex hull tools in fTools, as well as the Road graph plugin. The latter is probably a different can of worms because it is a C++ rather than Python plugin. variable-sized "such that" pipe