I don't care for him so much. But SHE, I care a great deal for
Is there a sentence that begins with “them”?
Let $G$ be a group and $\{H_i\}_{i\in I}$ a family of subgroups. I would like to find a condition that will imply that $\cup_{i\in I} H_i$ is a subgroup. I know that it's not true in general, I need help to find this condition.  Any help is welcome.  Thanks a lot. What is the volatile keyword useful for? At work today, I came across the volatile keyword in Java. Not being very familiar with it, I found . Given the detail in which that article explains the keyword in question, do you ever use it or could you ever see a case in which you could use this keyword in the correct manner? How do I debug Node.js applications? Why did the First Order do this at the cantina? In The Force Awakens, after the First Order are alerted to BB-8, Rey, and Finn's presence at the cantina, an aerial bombardment of the compound begins. They also deploy ground troops.  Wouldn't it have been better to not have an aerial bombardment and simply have the troops surround the cantina, keeping as many people as possible bottled up inside it while they searched both the interior and surrounding area for BB-8?  Instead of a surgical extraction, the strategy that they chose seemed to create chaos and even risked destroying BB-8.  Perhaps this was a sign of the inexperience and emotionally-charged state of Kylo Ren, but General Hux seemed to have more direct authority over the deployment of troops and fighters.  So what was the strategy behind these tactics? Modulus with a negative number I'm training a neural network and the training loss decreases, but the validation loss doesn't, or it decreases much less than what I would expect, based on references or experiments with very similar architectures and data. How can I fix this?    As for question        to which this question is inspired, the question is intentionally left general so that other questions about how to reduce the generalization error of a neural network down to a level which has been proved to be attainable, can be closed as duplicates of this one.  See also dedicated thread on Meta: Send authors an inbox message if their question is closed How to resolve merge conflicts in Git repository? Pigeonhole-principle with two choices I am able to solve this sort of problem pretty easily.     An arm wrestler is the champion for a period of 75 hours. The arm   wrestler had at least one match an hour, but no more than 125 total   matches. Show that there is a period of consecutive hours during which   the arm wrestler had exactly 24 matches.   However this homework problem I can't seem to figure out.     Tyler has five weeks to prepare for his driver’s test. His mother   volunteers to ride with him for either 15 minutes or one half hour   every day until the test but not for more than 15 hours in all. Show   that during some period of consecutive days, Tyler and his mother will   drive for exactly 8.75 hours.   If I try doing it the same way as the first problem. I get $70$ pigeons and $95$ pigeon holes. I honestly don't know where to start with this problem. I thought that maybe I could assume that they only drove $.25$ hours on each day and prove that there is a period of consecutive days where they drove for exactly $8.75$ hours. Then I could say that we assume there is one day that they drove for $.5$ hours and work my way up, but I can't seem to get that to work either. Full file date (without GNU utilities) Show that $\mathbb{E}(T) = \sum\limits^\infty_{k=1}\mathbb{P}(T \geq k)$ for $T$ nonnegative integer valued and $E[T] < \infty$ Let T be a non-negative integer-valued random variable with $\mathbb{E}(T) &lt; \infty $. Prove that $\mathbb{E}(T) = \sum^\infty_{k=1}\mathbb{P}(T \geq k)$.  Had a few attempts, haven't really got anywhere. I'm wondering as I'm typing this if proof by induction is a good way to go.  Edit: One major thing I forgot to add, am I correct in thinking that also, $\mathbb{E}(T) = \sum^\infty_{k=1}k\mathbb{P}(T = k)$? Closed formula for the sums $\sum\limits_{1 \le i_1 < i_2 < \dots < i_k \le n} i_1 i_2 \cdots i_k $? I've worked out a few summation formulas, and I am hoping to find a pattern. Unless I have made a mistake somewhere, we have the following identities:  $$\sum_{1 \le i \le n} i = \frac{(n+1)n}{2} $$  $$\sum_{1 \le i &lt; j \le n} ij = \frac{(3n+2)(n+1) \, n \, ( n-1)}{24}$$   $$\sum_{1 \le i &lt; j &lt; k \le n} ijk = \frac{(n+1)^2 \, n^2 \, (n-1)(n-2) }{48}$$   It seems clear that $$p_k(n)= \sum_{1 \le i_1 &lt; i_2 &lt; \dots &lt; i_k \le n} i_1 i_2 \cdots i_k $$ is a polynomial in $n$ of degree $2k$. But is there a nice closed-form formula for it? Maybe in terms of its factorization?  Comment: I realize that what I am looking for is the coefficient of $t^k$ in the expansion $$(1+t)(1+2t) \dots (1+nt),$$ so maybe generating function techniques could be helpful. But the main way I know to extract the coefficient of $t^k$ is to take derivatives $k-1$ times and on the surface of things that looks like a huge mess. I dont know how to sort a list of SObject Case.  I have a List&lt;Case&gt; newCases which i iterate over in for cycle, where i save Cases to my new List&lt;Case&gt; casesList.  for (Case newCase : newCases) {             if(newCase.Case_Content__c == '111' &amp;&amp; newCase.Status == '24'){                 String cuid = newCase.CUID__c;                 cuidSet.add(cuid);                 casesList.add(newCase);                 casesList.sort(); //TODO sorting by CUID__c             }         }   What i need to do is, to sort this new list by field CUID__c. So the Cases with same CUID are together.  Thank you for any help :) Is there a rational number between any two irrationals? Suppose $i_1$ and $i_2$ are distinct irrational numbers with $i_1 &lt; i_2$.  Is it necessarily the case that there is a rational number $r$ in the interval $[i_1, i_2]$?  How would you construct such a rational number?  [I posted this only so that the useful answers at  could be merged here before that question was deleted.] It is written everywhere that gravity is curvature of spacetime caused by the mass of the objects or something to the same effect. This raises a question with me: why isn't spacetime curved due to other forces or aspects of bodies?  Why isn't it that there are curvatures related to the charge of a body or the spin of particles or any other characteristics? ASP.NET MVC: Weird characters in error page Let $a$ and $b$ be two integers such that $\left(a,b\right) = 1$. Prove that $\left(a+b, ab\right) = 1$.   $(a,b)=1$ means $a$ and $b$ have no prime factors in common  $ab$ is simply the product of factors of $a$ and factors of $b$.  Let's say $k\mid a+b$ where $k$ is some factor of $a$.  Then $ka=a+b$ and $ka-a=b$ and $a(k-l)=b$.  So $a(k-l)=b, \  a\mid a(k-1)$ [$a$ divides the left hand side] therefore $a\mid b$ [the right hand side].  But $(a,b)=1$ so $a$ cannot divide $b$.  We have a similar argument for $b$.  So $a+b$ is not divisible by any factors of $ab$.  Therefore, $(a+b, ab)=1$.  Would this be correct? Am I missing anything? "Activity" tab for the Community user's network profile sometimes leads to a server error Z-axis issue with the floating review info panel, permits various elements to flow over it Question  The test scores of three groups of people are saved as separate vectors in R.  set.seed(1) group1 &lt;- rnorm(100, mean = 75, sd = 10) group2 &lt;- rnorm(100, mean = 85, sd = 10) group3 &lt;- rnorm(100, mean = 95, sd = 10)   I want to know if there is a significant difference in the medians between these groups. I know that I could test group 1 versus group 2 using the Wilcoxon test, like so.  wilcox.test(group1, group2)   However, this compares only two groups at a time, and I would like to compare all three simultaneously. I would like a statistical test that yields a p value at the 0.05 significance level. Could someone please help?  Edit #1 - Mood's median test  Following user Hibernating's suggested answer, I tried Mood's median test.  median.test &lt;- function(x, y){     z &lt;- c(x, y)     g &lt;- rep(1:2, c(length(x), length(y)))     m &lt;- median(z)     fisher.test(z &lt; m, g)$p.value }  median.test(group1, group2)   However, this approach allows me to test for a significant difference between the medians of only two groups at a time. I am not sure of how to use it to compare the medians of all three simultaneously.  Edit #2 - Kruskal-Wallis test  User dmartin's suggested answer appears to be more or less what I need, and allows me to test all three groups simultaneously.  kruskal.test(list(group1, group2, group3))   Edit #3  User Greg Snow helpfully notes in his answer that the Kruskal-Wallis test is appropriate as long as it makes strict assumptions that make it also a test of means.