In the new mobile view, I noticed that the OP's name is no longer highlighted in comments.    Browser is Chrome 50.0.2661.89 running on Android 6.0.0.  Not sure if this is a bug or an intentional design decision, but we can see the OP's name highlighted again?
On main and in the old mobile site (iirc) the username of the OP is highlighted in the comments.  This is no longer the case after the new design/theme was rolled out yesterday.  Can we get this back?
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? When GMing a game, how much should you prepare in advance? Obviously you need to have some high level idea of what's going on in the world around the players, and where you are heading with the story, but in an ongoing game at some point players will be players and will head off in a different direction to what you planned.  How far ahead should you be planning to minimise or eliminate being caught off guard, but also try to minimise the amount of 'wasted content' you come up with but never gets used? Keyboard shortcut for switching between different keyboard layouts in Ubuntu Mate Is there a pre-assigned keyboard shortcut for switching between different keyboard layouts in Ubuntu Mate? Is $\mathbb{Z}[x]/(x^2+1)$ isomorphic to $\mathbb{Z}[i]$? Fastest Square Root Algorithm What is the fastest algorithm for finding the square root of a number?  I created one that can find the square root of "$987654321$" to $16$ decimal places in just $20$ iterations   I've now tried Newton's method as well as my own method (Newtons code as seen below)  What is the fastest known algorithm for taking the second root of a number?  My code for Newton's Method (*Edit: there was an error in my code, it is fixed in the comments below):        a=2   //2nd root     b=97654321   //base     n=1   //initial guess     c=0   //current iteration (this is a changing variable)     r=500000   //total number of iterations to run     while (c&lt;r)      {         m = n-(((n^a)-b)/(a*b))  //Newton's algorithm         n=m         c++;         trace(m + "  &lt;--guess   ...   iteration--&gt;  " + c)     } What was the issue solved by the new "using" syntax for template typedefs? There are numerous (, , ) questions concerning this problem. I realize this is a borderline duplicate, but I'll re-iterate the futility of this particular filter and why it should be outright removed from Stack Overflow.  Do you know how effective this is in preventing users who just don't care from posting questions with bad titles? 100% ineffective. What do these users do?   Replace it with a synonym: "issue," "trouble," "predicament," "botheration" or what have you. Or worse, they simply work around the filter by deliberately misspelling the word or inserting space or punctuation:    () ?    and the coup de grâce:      I mean, even Jeff . This adds zero value to the title. In fact, it looks worse. Why, oh why are people  to scrap a bad feature? All this does is:   Prevent people who have a  to use the word "problem" in the title from posting questions with an appropriate title. Break the search feature because of workarounds or the need to use less descriptive titles than the error itself   This is an extraordinarily useless (and harmful) feature. Please, for the love of Cthulhu,  remove, eliminate, abolish, eradicate, extirpate this "feature" from Stack Overflow.    Bonus:     So I can't mention the Halting Problem in the title? – Keith Thompson Nov 1 at 19:05      @KeithThompson Maybe it's a "Halting Issue". Or "Need help with Halting". Or the "Halting thing in Computability Theory". – slhck Nov 1 at 19:14 How do I efficiently filter computed values within a Python list comprehension? The Python list comprehension syntax makes it easy to filter values within a comprehension.  For example:  result = [x**2 for x in mylist if type(x) is int]   Will return a list of the squares of integers in mylist.  However, what if the test involves some (costly) computation and you want to filter on the result?  One option is:  result = [expensive(x) for x in mylist if expensive(x)]   This will result in a list of non-"false" expensive(x) values, however expensive() is called twice for each x.  Is there a comprehension syntax that allows you to do this test while only calling expensive once per x? Show that if $n$, $a$, $b$, and $c$ are positive integers with $\gcd(a, b) = 1$ and $ab = c^n$, then there are positive integers $d$, and $e$ such that $a = d^n$ and $b = e^n$.   I know that (by Bezout) $\gcd\left(a,b\right) = 1$ implies $ax + by = 1$ for some integers $x$ and $y$, and also that $\gcd\left(a^n,b^n\right) = 1$, but this does not help me. Is there a contraction for "I was"?    There are contractions for "I am" (I'm), "I will" (I'll), "I have" (I've), "I would" (I'd), and yet the simple past tense seems conspicuously missing. Why is that? Does that reasoning apply to "I did" and "I had" as well? Dual Canadian and British citizen - healthcare coverage in the UK? I am trying to run the following model:         I(week^2):mutation_status +         (week + I(week^2) | subject_id) ,          data = sim_dat)  This is the output I get from this model. The correlation between week and I(week)^2 is rather high (-0.95) and I was curious to know how I can change my data simulation code to lower that value. I am also having issues with convergence and would love to get thoughts on how to avoid issues regarding convergence. Thank you! Linear mixed model fit by REML. t-tests use Satterthwaite's method [lmerModLmerTest]  Formula: fetal_weight ~ week + mutation_status + week:mutation_status + I(week^2) +  I(week^2):mutation_status + (week + I(week^2) | subject_id) Data: sim_dat  REML criterion at convergence: 114  Scaled residuals:      Min      1Q  Median      3Q     Max  -1.9343 -0.3980 -0.0075  0.4168  1.9928   Random effects:  Groups     Name        Variance  Std.Dev. Corr         subject_id (Intercept)   1.51524  1.2309                          week         61.01832  7.8114   0.16                   I(week^2)   496.20236 22.2756  -0.19 -0.95  Residual                 0.05892  0.2427              Number of obs: 100, groups:  subject_id, 20  Fixed effects:                            Estimate Std. Error       df t value       Pr(&gt;|t|)     (Intercept)                  3.1331     0.4226  17.9961   7.413 0.000000713699 *** week                        -1.2465     3.5210  18.0053  -0.354          0.727     mutation_statusY             0.5061     0.5977  17.9961   0.847          0.408     I(week^2)                   34.5706    10.8146  18.0084   3.197          0.005 **  week:mutation_statusY       -1.0697     4.9795  18.0053  -0.215          0.832     mutation_statusY:I(week^2) 202.5521    15.2942  18.0084  13.244 0.000000000101 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  Correlation of Fixed Effects:             (Intr) week   mttn_Y I(w^2) wk:m_Y week        -0.160                             muttn_sttsY -0.707  0.113                      I(week^2)    0.145 -0.966 -0.103               wk:mttn_stY  0.113 -0.707 -0.160  0.683        mtt_Y:I(^2) -0.103  0.683  0.145 -0.707 -0.966  Code for data simulation: set.seed(123)  # set the seed J &lt;- 20  # number of individuals (clusters) cs &lt;- 5  # number of time points (cluster size) gam &lt;- c(0, 0.75, 1.34)  # fixed effects G &lt;- matrix(c(1.75, 0, 0,               0, 0.0125, 0,               0,0,0.0625),              nrow = 3)  # random effect variances (G-matrix) sigma2 &lt;- 0.08  mutation_status &lt;- rep(0:1, each = 5) mutation_status &lt;- rep(mutation_status, times = 10)  X &lt;- cbind(1, seq_len(cs),             (seq_len(cs))^2)  # for each individual X &lt;- X[rep(seq_len(cs), J), ]  X &lt;- X[rep(seq_len(cs), J), ]  X[,2] &lt;- X[,2]*0.05 X[,3] &lt;- X[,3]*0.05  # repeat each row cs times pid &lt;- seq_len(J)  # individual id pid &lt;- rep(pid, each = cs)   # Generate person-level (lv-2) random effects uj &lt;- lmf::rmnorm(J, mean = rep(0, 2), varcov = G)  # Generate repeated-measure-level (lv-1) error term eij &lt;- rnorm(J * cs, sd = sqrt(sigma2))  # Compute beta_j's betaj &lt;- matrix(gam, nrow = J, ncol = 3, byrow = TRUE) + uj  # Compute outcome: y &lt;- rowSums(X * betaj[pid, ]) + eij + mutation_status*X[ , 3]*10 + 3  # Form a data frame sim_dat &lt;- tibble(y, time = X[ , 2], pid, mutation_status) sim_dat &lt;- sim_dat[,c(3,2,4,1)] colnames(sim_dat) &lt;- c(&quot;subject_id&quot;, &quot;week&quot;, &quot;mutation_status&quot;, &quot;fetal_weight&quot;) sim_dat$week_2 &lt;-sim_dat$week*5 + 15  sim_dat$mutation_status &lt;- as.factor(ifelse(sim_dat$mutation_status == 0, &quot;N&quot;, &quot;Y&quot;)) sim_dat$subject_id &lt;- as.factor(sim_dat$subject_id ) #Model Building Let $a_1,a_2,a_3,\ldots$ be reals. Prove that if $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$.   For this I have shown the case for when $ a_n^{2} \le\frac {|a_n|}{n}$ $\Rightarrow$ $ |a_n|\le\frac {1}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le \frac{1}{n^{2}}$ and we know that $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges and hence $\sum_{n=1}^{\infty}\frac {a_n}{n}$ converges by the comparison test. Now considering $ a_n^{2} \ge\frac {|a_n|}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le a_n^{2}$ $\rightarrow$ combining the two cases for any n we have: $\frac {|a_n|}{n}\le\frac{1}{n^{2}}+a_n^{2}$ Hence using the comparion test again we know that $\sum_{n=1}^{\infty} a_n^{2}$ converges and $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges hence the sum converges so we can conclude that $\sum_{n=1}^{\infty} \frac {a_n}{n}$ is absoluetly convergent $\Rightarrow$ convergent.  Not to sure if this is correct, any help would be much appreciated, many thanks. How to create a Geometric Polygonal Art portrait I've been interested in creating Geometric Polygonal art illustrations, i.e. making polygons and shapes with different color shading represent a face, or an object, see  set of .  How are they achieved? Is there some script for Illustrator which alters the image adding the shapes according to the colors or shades? How would I transform a normal image of Marilyn Monroe for example, to a polygonal illustration of her? Why was a fox able to think about the hobbits on the road to Rivendell? Want to install VirtualBox Guest Additions on CentOS 7 but get a header mismatch Google Spreadsheets: IF not working I have problems with my IF command in Google Sheets. If gives #ERROR! all the time. See this simple test:    Not even if I put in the number directly and avoid references:    Am I using the IF wrong? Or what could such a problem be? This example is from a new document. What is the difference between would and will in the following examples?        How would you use this word in a sentence?     How will you use this word in a sentence? I wanted to use my android phone as a proxy server, meaning that I wanted to be able to use the IP on the phone as a proxy, so all request and response are received on the phone and forwarded back to the original requestor. How do I do this? Could anyone provide an example of a nonempty subset $U$ of $R^2$ such that $U$ is closed under scalar multiplication, but $U$ is not a subspace of $R^2$