CMake/g++ Giving undefined reference error while linking
Why can templates only be implemented in the header file?
So I found this on the Wolfram website today:     So I was wondering about how one might be able to (if possible) solve those four problems by hand. Here are the problems, $\LaTeX$ed:    $ \lim_{x \to +\infty} \dfrac {\sqrt{x^3-x^2+3x}}{\sqrt{x^3}-\sqrt{x^2}+\sqrt{3x}} $ $ \displaystyle\sum_{k=1}^{\infty} \dfrac {(-1)^{k+1} k^2}{k^3+1} $  $ \dfrac {\mathrm{d}}{\mathrm{d}u} \left[ \dfrac {u^{n+1}}{(n+1)^2} \cdot \left[ (n+1) \ln u - 1 \right] \right] $  $ \displaystyle\int_0^{2\pi}\displaystyle\int_0^{\frac{\pi}{4}}\displaystyle\int_0^4 \left( \rho \cos \phi \right) \rho^2 \sin \phi \, \mathrm{d}\rho \mathrm{d}\phi \mathrm{d}\theta$     Ideas   The degree of the numerator is $\frac{3}{2}$. The degree of the denominator is $\frac{3}{2}$. The expression is of an indeterminate form, namely $\frac{\infty}{\infty}$, so we use l'Hoptial's Rule.  No ideas, really.  Derivatives are always pretty easy, although this one is a bit bashy. Basically bash Product and Chain Rules, etc.  Integration by Parts bash? The $\mathrm{d}\theta$ part is very trivial. I mean for the $\rho$ and $\phi$. Prove that if the identity is written as the product of $r$ transpositions, then $r$ is an even number Theorem. If the identity is written as the product of $r$ transpositions, $id=τ_1τ_2\dots τ_r$, then $r$ is an even number. Proof. We will employ induction on $r$. A transposition cannot be the identity; hence, $r &gt; 1$. If $r = 2$, then we are done. Suppose that $r &gt; 2$. In this case the product of the last two transpositions, $τ_{r−1}τ_r$, must be one of the following cases: $(ab)(ab) = id\\ (bc)(ab) = (ac)(bc)\\ (cd)(ab) = (ab)(cd)\\ (ac)(ab) = (ab)(bc),$ where $a$, $b$, $c$, and $d$ are distinct. The first equation simply says that a transposition is its own inverse. If this case occurs, delete $τ_{r−1} τ_r$ from the product to obtain $id=τ_1τ_2···τ_{r−3}τ_{r−2}$. By induction $r − 2$ is even; hence, $r$ must be even. In each of the other three cases, we can replace $τ_{r−1} τ_r$ with the right-hand side of the corresponding equation to obtain a new product of $r$ transpositions for the identity. In this new product the last occurrence of $a$ will be in the next-to-the-last transposition. We can continue this process with $τ_{r−2} τ_{r−1}$ to obtain either a product of $r − 2$ transpositions or a new product of $r$ transpositions where the last occurrence of $a$ is in $τ_{r−2}$. If the identity is the product of $r − 2$ transpositions, then again we are done, by our induction hypothesis; otherwise, we will repeat the procedure with $τ_{r−3}τ_{r−2}$. At some point either we will have two adjacent, identical transpositions canceling each other out or $a$ will be shuffled so that it will appear only in the first transposition. However, the latter case cannot occur, because the identity would not fix $a$ in this instance. Therefore, the identity permutation must be the product of $r − 2$ transpositions and, again by our induction hypothesis, we are done. Question: That is the proof written in the book, but unfortunately after more than $10$ times reading I don't understand the last two paragraph (i.e., from &quot;In each of the other three cases&quot;). Is there another simpler proof or could someone please clarify what is going on? Thank you. $\mathbb{R}$ with the lower limit topology is not second-countable I am trying to prove that $\mathbb{R}$ with the lower limit topology is not second-countable.  To do this, I'm trying to form an uncountable union $A$ of disjoint, half-open intervals of the form $[a, b)$, $a &lt; b$. Is this possible? I think this would imply the $A$ is open but no countable union of basis elements could coincide with $A$ therefore making the real numbers with the lower limit topology not second-countable.  I think there must exist something like $A$ described above but I am having trouble visualizing it and coming up with a formula to represent it.  Maybe there is some other way to show it is not second-countable. One of the answers in a reading exercise in my class today was:   100,000,000,000,000,000,000   ... which was the value of the highest denomination note ever issued. It was a 100,000,000,000,000,000,000 Pengo note, issued by Hungary in 1946. The students in my class wanted to know how they could say that last sentence in words in English. So I told them that I didn't know. They pointed out to me that if they wanted to read this bit of writing to someone they'd want to be able to use the words. Fair point.  Can anyone help?  [In case you're interested, a 100,000,000,000,000,000,000 Pengo note was worth about $0.20!] How does dark matter halo outside a galaxy help to explain galaxy rotation curve? How does a   outside a galaxy help to explain a ?  Suppose for simplicity we use a model of a star rotating about a more massive star in a fixed circular orbit. For another star at larger radius, the velocity should be smaller but observationally for spiral galaxies, the opposite happens (moves at even more speed or at least at the same speed as the closer star).  People hypothesize that dark matter halo may be present “surrounding” the system (i.e., halo exists outside the system) to account for such observation. I feel that exactly the opposite should be the case that is, dark matter halo should be inside the galaxy rather than outside. Reason being, if dark matter is outside the galaxy then the effective gravitational pull on the rotating star towards the center will be reduced due to outward attraction on the star exerted by dark matter existing outside. Thus, its speed of rotation should be reduced; but we observe the opposite. So how does dark matter halo "surrounding" a galaxy help to explain galaxy rotation curve? Where am I making mistake in argument? Including null values in unpivoted column Does Python support short-circuiting? I am working on the following problem asked in an examination: "What is the maximum number of cylindrical pencils of 0.5 cm diameter that can be stood in a square shaped stand of 5cm × 5cm inner cross section? 1. 99    2. 121   3. 100    4. 105." A simple calculation yielded me the answer 100.  But the answer in the key is 105. I don't how such an answer is possible. Any hint please.....Thanks in advance! Etymological origin of "deosil" and "widdershins" Why is asymmetric cryptography bad for huge data? I've been told that asymmetric cryptography requires that the message to be encrypted be smaller than its key length. Why is this?  I know about hybrid encryption, which . But I still want to know why public-key cryptography needs the data to be shorter than the key length. Let $R$ be a commutative ring and $I_1, \dots, I_n$ pairwise comaximal ideals in $R$, i.e., $I_i + I_j = R$ for $i \neq j$. Why are the ideals $I_1^{n_1}, ... , I_r^{n_r}$ (for any $n_1,...,n_r \in\mathbb N$) also comaximal? While CtrlX works fine in vim under windows, CtrlA selects all (duh).  Is there a way to increment a number with a keystroke under windows? Has there been any news from the maintainers of Ubuntu packaging of Ruby as to whether they'll be releasing a package for Ruby 2.0? If so, have they indicated whether they'll be releasing any packages for Ruby 2.0 on 12.04? What does \s! do? 1st example:  \starttypescript [\s!serif] [paratype]   \definefontsynonym [ParatypeSerif-Regular] [\s!name:PTSerif-Regular] [\s!features=\s!default]   \definefontsynonym [ParatypeSerif-Italic] [\s!name:PTSerif-Italic] [\s!features=\s!default]   \definefontsynonym [ParatypeSerif-Bold] [\s!name:PTSerif-Bold] [\s!features=\s!default]   \definefontsynonym [ParatypeSerif-BoldItalic] [\s!name:PTSerif-BoldItalic] [\s!features=\s!default] \stoptypescript   2nd example:  \definefont[SerifS][\s!file:GenBkBasR at \smallfontsize]   Is \s! only related to fonts? Should I use it in my typescript files? In our network the name of the network domain is also the domain of the organization's website (say, example.com). Externally, people can enter example.com to visit our website, but internally, this points to one of the several domain controllers, we have for Active Directory, some of which do not even run a webserver.   As a result of this, links to http://example.com don't work internally (only www.example.com does work internally).  How do we point http requests transparently to the web server, and what side effects does this have? Show that if $n>2$, then $(n!)^2>n^n$. How to extract pixel value counts from a raster in QGIS? Compute $E(X\mid X+Y)$ for independent random variables $X$ and $Y$ with standard exponential distributions Being $X$ and $Y$ independent random variables distributed as $\mathrm{Exponential}(1)$ and let $T=X+Y$ Calculate $E(X|T)$.  This is my attempt at solving this:  Being $Z=\sum_{i=1}^{n}P_{i}$ where $P_{i}$~$\mathrm{Exp}(\lambda)$ then using it's MFG you have that $$M_{P_i}(t)=\frac{\lambda}{\lambda-t}$$ then $$M_{Z}(t)=M_{\sum{P_{i}}}(t)=(M_{P_{1}})...(M_{P_{n}})=(\frac{\lambda}{\lambda-t})^n$$ with this being the MFG of a $\mathrm{Gamma}$ distribution with parameters $(n,\lambda)$  With this result is easy to see that $T$~$\mathrm{Gamma}(2,1)$  Now $E[X|T]=\int xf_{X|T}(x|t)dx$  Then using Bayes' theorem we can make $$f_{X|T}(x|t)=\frac{f_{T|X}(t|x)f_{X}(x)}{f_{T}(t)}$$ then $$f_{T|X}(t|x)=Pr(T=t|X=x)$$ $$=Pr(X+Y=t|X=x)$$ $$=Pr(x+Y=t|X=x)$$ $$=Pr(Y=t-x)=f_{Y}(t-x)$$  Using this result we can now rearrenge $$f_{X|T}(x|t)=\frac{f_{Y}(t-x)f_{X}(x)}{f_{T}(t)}$$ $$=\frac{e^{-(t-x)}.e^{-x}}{\frac{te^{-t}}{\Gamma(2)}}$$ $$=\frac{1}{t}$$ then $$E[X|T]=\int (x)(\frac{1}{t})dx$$  And this where I got stuck because $1_{x\epsilon(0,\infty})$, I made this explanation step-by-step hoping that someone can se easily check where I went wrong. I would aprecciate a step-by-step answer, thanks. Which airlines allow in-cabin pets on transatlantic flights? proof of functional completeness of logical operators