kotlin list binarySearch
How do I write a correct micro-benchmark in Java?
Let $G$ be a finite abelian group s.t. it contains a subgroup $H_{0} \neq (e)$ which lies in every subgroup $H \neq (e) $. Prove that $G$ must be cyclic.   Also what can be said about $o(G)$ ?    I'm clueless about this problem from Herstein. I tried to think $G$ might be a solvable group and its subgroups are all normal (as $G$ is abelian) . But I'm unable to get further. "Communicate over" vs. "communicate through" Also schemas can communicate over database links to schemas in other remote databases.    Could one replace the preposition over with through? Will it change the meaning, and if so, when should we use over instead of through? What GUI applications are there to assist in generating graphics for TeX? I found  to be a useful tool to help generate code for graphs. I suppose there must be other tools to help draw diagrams such as Sets/Venn Diagrams or Electrical Circuits (Logic Gates). Which ones would you suggest? Lenovo Yoga 13 Realtek wireless driver Why are some actors uncredited in certain films? Eli Wallach  in Mystic River. Olivia Williams  in X-Men: The Last Stand. However, neither of them (according to IMDb) is credited in the movie. These two instances are simply examples.  Why are some actors, who are oftentimes quite well known, not credited in certain features? Dynamic LINQ OrderBy on IEnumerable / IQueryable I found an example in the  for Dynamic LINQ that allows you to use a sql-like string (e.g. OrderBy("Name, Age DESC")) for ordering. Unfortunately, the method included only works on IQueryable&lt;T&gt;. Is there any way to get this functionality on IEnumerable&lt;T&gt;? Find $\lim\limits_{n \to \infty} \frac{\sqrt 1 + \sqrt 2 + \dots + \sqrt{n}}{n\sqrt{n}}$. $$\lim_{n \to \infty} \dfrac{\sqrt 1 + \sqrt 2 + \dots + \sqrt{n}}{n\sqrt{n}}$$   $$\lim_{n \to \infty} \dfrac{\sqrt 1 + \sqrt 2 + \dots + \sqrt{n}}{n\sqrt{n}} =\lim_{n\to \infty} \dfrac1{n}\sum^{n}_{k = 1} \sqrt{\dfrac k n} $$  While searching this question I found, .   Like in the accepted answer I first compared my series to LRAM,    $$\int_a^b f(x)\,dx=\lim_{n\to\infty}\frac 1n\sum_{i=1}^n f\left(a+\frac{b-a}n i \right)$$  I got $a = 0$, $b = 1$ and $f(x) =\sqrt{x}$ so,  $$\int_0^1 \sqrt{x}\ dx = \dfrac2 3$$ should be the answer.  Is there any simpler method to do this sum ? I have not learnt this method to do infinite sums so I can't use it. Let $A \in {M_n}$ is nonsingular and each eigenvalue of $A$ is either $+1$ or $-1$.Why $A$ is similar to ${A^{ - 1}}$? Two load icons simultaneously appearing in Android app This  confirms that the Android app is using two different loaders since last year, but just today I've noted that, at the questions page, it is using them simultaneously. I've never noted this, so I believe this bug was recently created.  I hope the following gif is clear enough to show the issue. Also, note that the bigger loader is "freezing".    SE Android App Version: 1.0.60 My Android OS Version: 5.0.2  Still observed in version 1.0.89 Opening Raster stored in Esri Geodatabase using QGIS Is there a way to open a raster that is stored in ESRI V10.0 Geodatabase in QGIS V2.4?    I can open the vector layer, but there does not seems to be a way to open a raster. Is there an integer $N>0$ such that $\varphi(n) = N$ has infinitely many solutions? Let $\varphi: \mathbb{N} \to \mathbb{N}$ be the totient function.   Is there an integer $N &gt; 0$ such that there are infinitely many integers $n &gt; 0$ such that $$\varphi(n) = N?$$ Let $M$ be a positive, continuous martingale that converges a.s. to zero as $t$ tends to infinity. I now want to prove that for every $x&gt;0$ $$ P\left( \sup_{t \geq 0 } M_t &gt; x \mid \mathcal{F}_0 \right) = 1 \wedge \frac{M_0}{x}. $$ My approach: I thought that rewriting the conditional probability to an expectation would help so we obtain that we must prove: $$ \mathbb{E} \left[ 1_{\sup_{t \geq 0 } M_t &gt; x}  \mid \mathcal{F}_0 \right] = 1 \wedge \frac{M_0}{x}.$$ A hint to me was given that I should consider stopping the process when it gets above $x$. Thus a stopping time that would do this is $\tau = \inf\{t\geq 0 : M_t&gt;x\}$. But now I'm stuck as I want to apply optional sampling results but we have an indicator which complicates things. How could I proceed from this? Any help is appreciated! Is the claim that functions of independent random variables are themselves independent, true?   I have seen that result often used implicitly in some proofs, for example in the proof of independence between the sample mean and the sample variance of a normal distribution, but I have not been able to find justification for it. It seems that some authors take it as given but I am not certain that this is always the case. creating variable using variable value as part of new variable name I'm trying to create a new variable using the value of an existing variable as part of the variable name.  filemsg"$word1"=" "   I've also tried   filemsg$word1=" "  filemsg${word1}=" "   on all attempts I get the following when that line executes,  cicserrors.sh[45]: filemsgCICS= : not found [No such file or directory] How do I grep for all non-ASCII characters? Has anyone had any success using twitters typeahead.js within visualforce pages? Auto-run scripts security options Minimal polynomials and cyclic subspaces I'm trying to make my way through two problems in Curtis's Linear Algebra, chapter 25.  One of the two problems is this one, #5:     Prove that $V$ is cyclic relative to a linear transformation $T \in \mathcal{L}(V)$ if and only if the minimal polynomial of $T$ is equal to the characteristic polynomial.   Part of the issue is that I'm not really sure what it's asking. The statement that $V$ is cyclic seems to suggest that the entire vector space (say it has dimension $n$) is generated by some vector $v \in V$, along with $Tv, T^2v, \ldots T^{n-1}v$; Curtis's definition of a cyclic subspace (as opposed to a space, though I can't see why there should be a difference) seems to reinforce this:     A $T$-invariant subspace $V_1$ of $V$ is called cyclic relative to $T$ if $V_1 \neq 0$ and there exists a vector $v_1 \in V_1$ such that $V_1$ is generated by $\{ v_1, Tv_1, T^2v_1, \ldots T^kv_1 \}$ for some $k$.   However, I've seen several examples that seem to directly contradict this interpretation. For example, we recently had a take-home midterm that required we find elementary divisors, rational canonical form, etc., of a $6\times 6$ matrix; a classmate who received a perfect score on her test found that her matrix's characteristic polynomial was equal to its minimal polynomial &#151; it was $(x+8)^2 (x+14)^2 (x^2+61x+80)$ &#151; and yet the vector space could be written as $\left&lt; v_6 \right&gt; \oplus \left&lt; v_4 \right&gt; \oplus \left&lt; -v_2+v_3+v_6 \right&gt;$ &#151; i.e., as the direct sum of three cyclic subspaces, not as one cyclic subspace.  So that suggests that "$V$ is cyclic" might mean the direct sum of cyclic subspaces. However, while working on the exercise that follows (#6), I came across this:  $$S= \left(\begin{array}{ccc} -1 &amp; 0 &amp; 0 &amp; 0\\ 0 &amp; 1 &amp; 0 &amp; 0\\ 0 &amp; 0 &amp; 1 &amp; 0\\ 0 &amp; 0 &amp; 0 &amp; 2 \end{array}\right)$$  Here, the characteristic polynomial is not equal to the minimal polynomial, which is $m(x) = (x-1)(x+1)(x+2)$. The eigenspace associated with $\lambda = 1$ has dimension $2$. And so it seems as though, if $V$ has basis $\{ v_1, v_2, v_3, v_4 \}$, we can write $V = \left&lt; v_1 \right&gt; \oplus \left&lt; v_2 \right&gt; \oplus \left&lt; v_3 \right&gt; \oplus \left&lt; v_4 \right&gt; $. This would seem to contradict my second interpretation of the original question.  Obviously I'm missing something. Could someone fill me in on what it might be? (I've tried to be thorough, but I'm also trying not to make this ridiculously long; if I've left out necessary information, I'll be happy to append it.) Is it true that: $a+bi$ is prime in $\mathbb{Z}[i]$ if and only if $a^2+b^2$ is prime in $\mathbb{Z}$ Replace dynamic content in XML file