Email and Password validation and recognizing email pattern
How to validate an email address using a regular expression?
The binomial sum   $$s_n=\binom{n+1}{0}+\binom{n}{1}+\binom{n-1}{2}+\cdots$$   satisfies the Fibonacci relation.   I failed to prove that $\binom{n-k+1}{k}=\binom{n-k}{k}+\binom{n-k-1}{k}$... Any hints or suggestions? The verb let means  “allow”, “permit”, “not prevent or forbid”, “pass, go or come”  and it's used with an object and the bare infinitive.         Are you going to let me drive or not?     Don't let him off the hook.     Before we let our children surf the Internet, they have to do their homework.     She lets the cats out before leaving.   He let us into the house.      The full form let us can be used similarly        Let us know as soon as possible.      Please, let us help you.   They will never let us forget.      None of the above can be contracted; however, when let us is used for making a suggestion; giving self-encouragement; expressing a consequence or plea,  it is often contracted to let's      Let's go out   Let's have a party   Let's see what happens   Let's stand together in this emergency   Let's not forget those who sacrificed their lives     Questions   I believe that let + us is the only instance where this type of contraction occurs. Is there an explanation as to why verbs such as (i) give + us, (ii) get + us or (iii) take + us were not similarly contracted? When was the apostrophe used to replace the omitted letter "u" in let us?  What is the origin of let's? The set of homotopy classes Linear regression with non-symmetric cost function? I want to predict some value $Y(x)$ and I am trying to get some prediction $\hat Y(x)$ that optimizes between being as low as possible, but still being larger than $Y(x)$. In other words: $$\text{cost}\left\{ Y(x) \gtrsim \hat Y(x) \right\}  &gt;&gt; \text{cost}\left\{ \hat Y(x) \gtrsim Y(x) \right\}  $$  I think a simple linear regression should do totally fine. So I somewhat know how to implement this manually, but I guess I'm not the first one with this kind of problem. Are there any packages/libraries (preferably python) out there doing what I want to do? What's the keyword I need to look for?  What if I knew a function $Y_0(x) &gt; 0$ where $Y(x) &gt; Y_0(x)$. What's the best way to implement these restrictions? How do I get an XBOX 360 controller working? I have a Microsoft XBOX 360 gamepad with the wireless adapter and I was wondering what I would have to install to use them with Ubuntu I do know that when using this on Windows I have to manually install the drivers for the wireless receiver (if that is relevant.) Restore console session after remote desktop disconnects? Why does my hard drive LED light blink every second? The light blinks faintly about once a second.   It is slowly driving me insane.  How do I find out which program is causing this, so I can disable it?  Acer 5274 laptop/core i3 Windows 7 Home Premium Hitachi HTS545050B9A300 hard drive Ligatures in figures and pdftex How can I calculate the R-squared of a regression with arima errors using R? If I have an arima object like a:  set.seed(100) x1 &lt;- cumsum(runif(100)) x2 &lt;- c(rnorm(25, 20), rep(0, 75)) x3 &lt;- x1 + x2  dummy = c(rep(1, 25), rep(0, 75))  a &lt;- arima(x3, order=c(0, 1, 0), xreg=dummy) print(a)   .  Series: x3  ARIMA(0,1,0)                      Call: arima(x = x3, order = c(0, 1, 0), xreg = dummy)   Coefficients:         dummy       17.7665 s.e.   1.1434  sigma^2 estimated as 1.307:  log likelihood = -153.74 AIC = 311.48   AICc = 311.6   BIC = 316.67   How do calculate the R squared of this regression? Infinite Series $\sum\limits_{k=1}^{\infty}\frac{k^n}{k!}$ Is the 64-Bit version of Ubuntu only compatible with AMD CPUs? How to locate a font in Ubuntu? Ubuntu desktop with 12.04 is about to crash.  Installed 13.04 on a new machine, want to transfer Book Antiqua font from old machine to the new one.  How do I find it on the old machine?  My /usr directory is empty. My fonts.conf file has these lines: &lt;!-- Font directory list --&gt; &lt;dir&gt;/usr/share/fonts&lt;/dir&gt; &lt;dir&gt;/usr/x11R6/lib/X11/fonts&lt;/dir&gt;  &lt;dir&gt;/usr/local/share/fonts&lt;/dir&gt; &lt;dir&gt;~/.fonts&lt;/dir&gt;  Don't know what this means, but my /usr directory has nothing in it. I remember that a couple of years ago a friend showed me and some other people the following expression:  $$\lim_{n\to \infty}\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}.$$  As shown below, I can prove that this limit exists by the monotone convergence theorem. I also remember that my friend gave a very dubious "proof" that the value of the limit is $\frac{1}{e-1}$. I cannot remember the details of the proof, but I am fairly certain that it made the common error of treating $n$ as a variable in some places at some times and as a constant in other places at other times. Nevertheless, numerical analysis suggests that the value my friend gave was correct, even if his methods were flawed. My question is then:  What is the value of this limit and how do we prove it rigorously?  (Also, for bonus points, What might my friend's original proof have been and what exactly was his error, if any?)  I give my convergence proof below in two parts. In both parts, I define the sequence $a_n$ by $a_n=\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}$ for all integers $n\ge 2$. First, I prove that $a_n$ is bounded above by $1$. Second, I prove that $a_n$ is increasing.   (1) The sequence $a_n$ satisfies $a_n&lt;1$ for all $n\ge 2$.  Note that $a_n&lt;1$ is equivalent to $1^n+2^n+\cdots+(n-1)^n&lt;n^n$. I prove this second statement by induction. Observe that $1^2=1&lt;4=2^2$. Now suppose that $1^n+2^n+\cdots+(n-1)^n&lt;n^n$ for some integer $n\ge 2$. Then  $$1^{n+1}+2^{n+1}+\cdots+(n-1)^{n+1}+n^{n+1}\le(n-1)(1^n+2^n+\cdots+(n-1)^n)+n^{n+1}&lt;(n-1)n^n+n^{n+1}&lt;(n+1)n^n+n^{n+1}\le n^{n+1}+(n+1)n^n+\binom{n+1}{2}n^{n-1}+\cdots+1=(n+1)^{n+1}.$$  (2) The sequence $a_n$ is increasing for all $n\ge 2$.  We must first prove the following preliminary proposition. (I'm not sure if "lemma" is appropriate for this.)  (2a) For all integers $n\ge 2$ and $2\le k\le n$, $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We observe that $k^2-1\le kn$, so upon division by $k(k^2-1)$, we get $\frac{1}{k}\le\frac{n}{k^2-1}$. By , we may find:  $$\frac{k+1}{k}\le 1+\frac{n}{k^2-1}\le\left(1+\frac{1}{k^2-1}\right)^n=\left(\frac{k^2}{k^2-1}\right)^n.$$  A little multiplication and we arrive at $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We may now first apply this to see that $\left(\frac{n-1}{n}\right)^n\le\left(\frac{n}{n+1}\right)^{n+1}$. Then we suppose that for some integer $2\le k\le n$, we have $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$. Then:  $$\left(\frac{k-1}{n}\right)^n=\left(\frac{k}{n}\right)^n\left(\frac{k-1}{k}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}\left(\frac{k}{k+1}\right)^{n+1}=\left(\frac{k}{n+1}\right)^{n+1}.$$  By backwards (finite) induction from $n$, we have that $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$ for all integers $1\le k\le n$, so:  $$a_n=\left(\frac{1}{n}\right)^n+\left(\frac{2}{n}\right)^n+\cdots+\left(\frac{n-1}{n}\right)^n\le\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}&lt;\left(\frac{1}{n+1}\right)^{n+1}+\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}=a_{n+1}.$$  (In fact, this proves that $a_n$ is strictly increasing.) By the monotone convergence theorem, $a_n$ converges.  I should note that I am not especially well-practiced in proving these sorts of inequalities, so I may have given a significantly more complicated proof than necessary. If this is the case, feel free to explain in a comment or in your answer. I'd love to get a better grip on these inequalities in addition to finding out what the limit is.  Thanks! Consider that we have two balls, one white and one black, and two distant observers A and B with closed eyes. We give the first ball to the observer A and the second ball to the observer B. The observers don't know the exact color (state) of their balls, they know only the probability of having one or another color, until they look at them (measure). If the observer A looks at his ball he will see its color, which is white, so he immediately knows the color of the second ball. Lets call this “classical entanglement”.  My question is: What is the difference between this “classical entanglement” and the quantum entanglement, for example, of two entangled electrons with opposite spins states? Can this analogy be used to explain the quantum entanglement? Is 'efficate' a word in English? I routinely hear the word "efficate" being used.  For example, "The most powerful way to efficate a change in the system is to participate."  I do not find entries for this word in common English dictionaries, but I do not have an unabridged dictionary.  I have checked the OED (I'm not sure if it is considered unabridged), and it has no entry for "efficate".  It does have an entry for "efficiate", which is used in the same way.  Wordnik has an  for "efficate" with over 1800 hits, thus providing some evidence for the frequency of use.  I personally like the word and find the meaning very clear and obvious when others use it.  If it's not currently an "officially documented" word, perhaps its continued use will result in it being better documented. Ratio of Boys and Girls In a country where everyone wants a boy, each family continues having babies till they have a boy. After some time, what is the proportion of boys to girls in the country? (Assuming probability of having a boy or a girl is the same) How to convert from one grading scheme to another? Fast way to find period-n points of a tent map? I need to find a period-3 orbit for a tent map defined by $$T(x)=\begin{cases}2x &amp; 0\le x\le0.5 \\[2ex] 2-2x &amp;0.5 &lt; x \le 1 \end{cases}$$  So, what is a fast and efficient way of finding it? I only know how to do it by guessing-and-checking. For example, I picked a random point, $x = \frac{2}{7}$ and found that $$T\left(\frac{2}{7}\right)=\frac{4}{7}\\[4ex]T\left(\frac{4}{7}\right)=\frac{6}{7}\\[4ex]T\left(\frac{6}{7}\right)=\frac{2}{7}$$ which is a period-3 orbit. Is there any better way of finding a period-3 orbit , more specifically, a period-3 point? How to apply a bevel modifier, so that it affects only specific edges? Command to italicize text with slanted numbers I often find myself adding a lot of \textsl{} around inside \emph{} or \textit{} blocks because I find italicized digits to look too "showoffy" and "baroque" and to hinder legibility (I'm using $$ when the number has a mathematical sense, but this situation occurs in less technical texts like CVs, and such.).  Could someone help me write a renewcommand to automate this, or better, a single low level command that makes \emph, \itshape, \textit and friends choose slanted over italic for numbers? I'm not too familiar with the low level latex font selection system nor with a way to detect digits from regular letters.  Edit: MWE of what I need and what I want to avoid  \documentclass{article} \begin{document} He thought: '\emph{Why 1234567890 apples?}' then he realized '\emph{ah yes, he has \textsl{1234567890} childs}' \end{document}   gives:   I find the italicized version (first one) of 2,3,4 and 7 to look especially bad.