Problem with "touch sensitivity" on iPhone calendar
Calendar month view is unresponsive on iOS 9
Formula for the $n$th term of $1, 2, 2, 3, 3, 3, 4, 4 ,4, 4, 5, ...$ Can I have two Schengen visas in one passport? Solving the Kolmogorov forward equation for transition probabilities Let $\lambda \mu &gt; 0$ and let $X$ be a Markov chain on $\{1,2\}$ with generators  $$ Q = \begin{pmatrix} -\mu &amp; \mu \\ \lambda &amp; -\lambda \end{pmatrix}$$  Write down the forward equations and solve them fro the transition probabilities, $p_{i,j}(t), i,j = 1, 2$.  The answers say:  "We have that   $$p_{11}' = -\mu p_{11} + \lambda p_{12}, \, \, \, p_{22}' = -\lambda p_{22} + \mu p_{21}$$  where $p_{12} = 1 - p_{11}$ and $p_{21} = 1 - p_{22}$. Solve these subject to $p_{ij}(t) = \delta_{ij}$, the Kronecker delta, to obtain that the matrix $P_t = \{p_{ij}(t)\}$."  The bits I don't understand are these  1) How do they get those equations in the first place? For example, why have they added $\lambda p_{12}$ when the coefficient for $p_{12} = \mu$?  2) How do you solve these equations? What do you do with that Kronecker delta to solve them? Ball swung in a horizontal circle, can the string ever by exactly horizontal to the ground? You swing a ball on the end of a lightweight string in a horizontal circle at constant speed.  Can the string ever by truly horizontal?  If not, would it slope above the horizontal or below the horizontal?  Why? Prove if $(a,p)=1$, then $\{a,2a,3a,...,pa\}$ is a complete residue system modulo $p$. let $p$ be a prime and let $a$ be an integer not divisible by $p$, that is $(a,p)=1$. Then $\{a,2a,3a,...,pa\}$ is a complete residue system modulo $p$.  Since $p\nmid a$, $p\nmid\{a,2a,3a,...,(p-1)a\}$ Since $p|p$, $p|\{pa\}$ which is exactly one element in the set and is therefore a complete residue system.   Wondering if this is an acceptable proof to this theorem. How should I cite a website URL? How to check if windows has automatic updates waiting from the command line? If a Windows server (2k3/2k8) is set to "download but not install" updates, is there a way to check from the command line.. perhaps a log file or something I can check with powershell, to see if there are any updates actually waiting to be installed? I'm trying to prevent having to manually log on to each server to check, even though they want the "trigger" pulled manually. We have an automation system in place I can use (CA Autosys) - just not sure what to have it look for. I need my pre-installed version of Windows 7 (or any other version of Windows), how could I install Ubuntu without erasing it? Why can't Discovery's Data Core be separated from the ship? What's the difference between "these" and "those"? First of all, I'm not a native English speaker, but in school I learned that these is used if referring to something near, and those is used when referring to something far away (temporally or locally). But now I'm sometimes watching English movies and notice sentences like "Have you seen those boots?" while the boots were only centimeters away. Is this just not correct, or have I learned the wrong rules?  Another question is, what if I'm referring to something abstract such as ideas or thoughts so that I can't say if they are far away or not. Should I use those or these?  Edit  So it can't be really wrong in any case if I use these respectively those? MPI Get Processor with Minimum value According to , the SE chat sites may have individual Easter eggs, depending on the site. If you find them, please post. Because it's so easy to make this stuff up, a screenshot as proof would be nice. (Although Photoshop isn't that hard either...) In a multiple regression, the regression coefficient of the two subsamples is opposite to that of the full sample. Both coefficients are significant. The sum of the number of obs in the two subsamples is equal to that of the full sample. Is this normal? What are the possible causes? Thanks. I'm trying to make a command block that spawns an item in front of you if you are holding an item with a specific name. I've got these two working scripts;  /testfor @p[r=10] {Inventory:[{tag:{display:{Name:"Item Name"}}}]}  /testfor @p[r=10] {SelectedItemSlot:0,Inventory:[{Slot:0b,­id:"minecraft:diamond_sword"}]­}   but I can't get them together. The block should only look for an item in the active slot. 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? Layover at Tokyo Narita airport: can I travel outside, and what kind of visa would I need? I am travelling from Singapore to San Francisco and the airline has a layover of 7.5 hours at Tokyo Airport (NRT). I am wondering if I would be allowed to go out to experience the city for a while in some form a visitor visa.  I know Singapore has such facilities, but does anyone know if I can do it in Tokyo? Any suggestions or pointers are welcome. Note - I do not have a visa for Japan yet, but I am hoping that 1 day visitor visa could be possible at airport. I believe there are several ways to prove that $\sum\limits^{\infty}_{n=1}\left(1-\frac{1}{\sqrt{n}}\right)^n$ converges. Can you, please, post yours so that we can learn from you?  HERE IS ONE   Let $n\in\Bbb{N}$ be fixed such that $a_n=\left(1-\frac{1}{\sqrt{n}}\right)^n.$ Then, \begin{align} a_n&amp;=\left(1-\frac{1}{\sqrt{n}}\right)^n \\&amp;=\exp\ln\left(1-\frac{1}{\sqrt{n}}\right)^n\\&amp;=\exp \left[n\ln\left(1-\frac{1}{\sqrt{n}}\right)\right] \\&amp;=\exp\left[ -n\sum^{\infty}_{k=1}\frac{1}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right]\\&amp;=\exp\left[ -n\left(\frac{1}{\sqrt{n}}+\frac{1}{2n}+\sum^{\infty}_{k=3}\frac{1}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right)\right]\\&amp;=\exp \left[-\sqrt{n}-\frac{1}{2}-\sum^{\infty}_{k=3}\frac{n}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right]\\&amp;\equiv\exp \left(-\sqrt{n}\right)\exp \left(-\frac{1}{2}\right)\end{align} Choose $b_n=\exp \left(-\sqrt{n}\right)$, so that  \begin{align} \dfrac{a_n}{b_n}\to\exp \left(-\frac{1}{2}\right).\end{align} Since $b_n \to 0$, there exists $N$ such that for all $n\geq N,$ \begin{align} \exp \left(-\sqrt{n}\right)&lt;\dfrac{1}{n^2}.\end{align} Hence, \begin{align}\sum^{\infty}_{n=N}b_n= \sum^{\infty}_{n=N}\exp \left(-\sqrt{n}\right)\leq \sum^{\infty}_{n=N}\dfrac{1}{n^2}&lt;\infty,\end{align} and so, $\sum^{\infty}_{n=1}b_n&lt;\infty\implies \sum^{\infty}_{n=1}a_n&lt;\infty$ by Limit comparison test. What is the difference between: Rooting, Jailbreak, ROM, Mod, etc.? If $f(x)$ is differentiable at x, I need to prove that $\lim_{h\to0}\frac{f(x+h)-f(x-h)}{2h}$ exist and is finite.  so if $f(x)$ is differentiable at a $x$, the difference quotient exist for this point, and also $f(x)$ must be continuous at x as well  so that mean that:  $\lim_{h\to0^+}\frac{f(x+h)-f(x)}{h} =  \lim_{h\to0^-}\frac{f(x+h)-f(x)}{h}$  and that: $\lim_{x\to x_0^+}=\lim_{x\to x_0^-}=f(x_0)$  I know I should probably use arithmetic limit laws to prove this but I can't see how what I figured out could help me. any help with that?  Thanks! Where is the Layers panel in Blender 2.8?