How should i handle dynamic cast with template classes?
What is object slicing?
Save an entire webpage, with all images and css, into just one folder and one file, with wget? New questions, Show Recommended, Sort Newest not working Select New questions, show Recommended and sort by Newest and the  in my list is from 2012:  EDIT The very old questions now appear to be gone (yay) but the ordering seems inconsistent (boo): Why are these estimates to the German tank problem different? Suppose that I observe $k=4$ tanks with serial numbers $2,6,7,14$.   What is the best estimate for the total number of tanks $n$?   I assume the observations are drawn from a discrete uniform distribution with the interval $[1,n]$. I know that for a $[0,1]$ interval the expected maximum draw $m$ for $k$ draws is  $1 - (1/(1+k))$. So I estimate $\frac {k}{k+1}$$(n-1)≈$ $m$, rearranged so $n≈$ $\frac {k+1 }{k}$$m+1$.  But the frequentist estimate from  is defined as:  $n ≈ m-1 + $$\frac {m}{k}$  I suspect there is some flaw in the way I have extrapolated from one interval to another, but I would welcome an explanation of why I have gone wrong! Showing $\left(1+\frac{1}{n}\right)^n$ is an increasing sequence by comparing the binomial expansions term by term So I know that showing $\left(1+\frac{1}{n}\right)^n$ is an increasing sequence has probably appeared on this site about 100 times, but my professor said he thinks the induction step is most easily seen if you expand this out and compare the summation term by term. I tried this and I did not what see why the inequality was obvious. Can somebody help me out here? Thanks! What is a word for a person who uses resources to the maximum? Is there a word (or words) for a person who uses all resources to the maximum; for example, a person who keeps on using pencils even if they are very small? Let $\,f : \mathbb{R} \rightarrow \mathbb{R}$ be a infinitely differentiable function that is  increasing and bounded. Then is it true that $\lim_{x\to \infty}f'(x)=0$? Hole-and-nail paradox in special relativity Yesterday we started relativity on our physics class, and my professor taught us a few concepts. We did some examples on how things changed by looking them from different reference systems, and a paradox came to my mind from an example he did on the blackboard:  Suppose that we have a bug inside a hole (and suppose that the height of the bug is $0$). This hole is $L$ meters deep. There's a man outside the hole that wants to kill the bug with a nail of length $l$, with $l&lt;L$. Obviously, it's not possible for him to kill the bug by trying to push the nail in the hole. However, if the nail moves really fast, from it's reference system the hole will have a height $L_n&lt;L$, and if it moves fast enough then it will happen that $L_n&lt;l$, so he finally could kill the bug. On the other hand, the bug knows that from his reference system, the nail will have a lenght $l_b&lt;l$, so it would never reach him.  Is it possible to quantify the problem? How is it possible that the nail reach the bug from it's reference system and from the bug's reference system it's even smaller than before? Consider the surface $S$ in $\mathbb{R}^3$ given by the graph of $f(x, y) = xy^2 − 2y^2 + e^x$ . Calculate the intersection point of the tangent planes to $S$ above $(x, y) = (0, 0), (0, 1)$, and $(0, 2)$.  Can someone guide me through solving this problem? I am confused on where to start because we didn't cover this in class. Thanks so much Shortcut to open Terminal and run some commands I am trying to work through Hartshorne's book and while working through one of the exercises, I need to show the following:  Let $k$ be an algebraically closed field. Let $Y \subseteq A^3$ be the set $Y=\{(t,t^2,t^3)\;|\;t \in k\}$. Show that $Y$ is an affine variety.  The rest of the problem I have completed. I'm just not sure how to show that this set is closed and irreducible. I assume that they intend for $A^3$ to have the Zariski topology. What does role db_owner allow I have been trying to troubleshoot a login that is not able to view certain tables in a SQL Server 2012 database. In doing so I find I don't quite understand what membership in the db_owner role allows. I can understand the other roles such as db_datareader and db_datawriter but I remain confused as to what db_owner allows. Rotating image / marker image on Google map V3 How do I turn off the Minecraft 1.7.2 Super Secret Settings? How do I turn off the Minecraft 1.7.2 super secret settings? I tried F3 and F4, hitting Esc repeatedly, all things mentioned on blogs – nothing is working. Extension fields isomorphic to fields of matrices Suppose $K \subset L$ is a finite field extension of degree $m$. Is it true that there exists some natural $n$ such that $L$ is isomorphic to a subfield of $M^{n\times n}(K)$, the ring of $n\times n$ matrices with entries in $K$? What is the smallest dimension (as a function of $m$) for which an isomorphism exists?  The example I had in mind was the 2-dimensional extension $\mathbb{R} \subset \mathbb{C}$ with $\mathbb{C}$ being isomorphic to $\{ \begin{pmatrix}a&amp;-b\\b&amp;a\end{pmatrix} : a, b \in \mathbb{R}\}$. How do you get \mathbb{1} to work (characteristic function of a set)? Disable three-letter pings from chat to save Oliver, Olivier and Olive from Oli's pings Ubuntu on 32-bit UEFI - optimal solution I have a computer (Asus T200TA) with 2G RAM and 32-bit UEFI [Yep, what a wonderful idea to put 32-bit UEFI!]. I have two options:   Install a 64-bit system, boot manually and install grub-efi-ia32. Drawback: 2G is not much, systems with such low RAM are said to run better on 32-bit systems. Install a 32-bit version. (but from my state of knowledge it's not trivial to boot)   Which option would be better? Find $\lim_{n \to \infty} \sqrt[n]{n!}$. I am playing around with the root/ratio test to practice with series. I just showed that $\sum \frac{1}{n!}$ converges by using the ratio test. I decided to see how things would go with the root test and I got stuck at something that I can't find on google. Right away while running the root test I encountered $\lim_{x \to +\infty}\left(\frac{1}{n!}\right)^\frac{1}{n}$. I have made the claim that $\left(n!\right)^\frac{1}{n}\geq 1 \hspace{3mm}\forall n\in \mathbb{N}.$ I have begun the proof and I think it is on the right track but some verification would be nice.  Proof: We can see that for n=1, this obviously holds, $\left(1!\right)^1\geq 1.$ Now suppose that this is the case for some $n=k$, then we have $\left((k+1)!\right)^{\frac{1}{k+1}}= \left((k+1)k!\right)^\frac{1}{k+1}$. It is at this point that I start to have a little trouble. Can somebody give me a push in the right direction? Thanks! How bad for TeX is omitting braces {}, even if the result is the same? Sometimes writing braces and omitting them produces the same result:  \tilde{\psi}  \mathrm{e}^{\mathrm{i} \pi}   vs  \tilde \psi   \mathrm e^{\mathrm i \pi}   Or (taken from Werner's comment below)   \frac{1}{2} vs \frac12   If that's the case, how bad for the quality of my code is omitting them? Of course, if one compiles a pair of formulas, there is no difference. But, since I ignore how TeX works, my point is: if one writes long codes with these habits,   doesn't TeX go somehow crazy because I'm not writing as it expects?   For instance, does it have any effect on how fast are long documents compiled? Any reason to keep them? Changing the homepage