I know what is the meaning of this.      I know what the meaning of this is.   If the first sentence is considered correct, can someone please explain the reasoning?  Edit:  The answer of the "Changing Subject and Verb" post illustrates my question, not the answer. Another example:     To know whether you are dealing with the main clause or an embedded clause, you have to think about what is the main verb of the whole sentence.   Compared to:     To know whether you are dealing with the main clause or an embedded clause, you have to think about what the main verb of the whole sentence is.
We always change subject and verb positions in whenever we want to ask a question such as "What is your name?". But when it comes to statements like the following, which form is correct?        I don't understand what are you talking about.   I don't understand what you are talking about.      Another example        Do you know what time is it?   Do you know what time it is?      Another example        Do you care how do I feel about this?   Do you care how I feel about this?
Do users get notifications when @ was edited in I always wondered if users get notified about comments were their name was edited in afterwards.  Example:  I write a comment     See this link here   then I edit it to     @someuser: See this link here   Does the user get notified now? What is the difference between [0-9]+ and [0-9]++? Getting a stack overflow exception when declaring a large array The following code is generating a stack overflow error for me  int main(int argc, char* argv[]) {     int sieve[2000000];     return 0; }   How do I get around this? I am using Turbo C++ but would like to keep my code in C  EDIT:  Thanks for the advice.  The code above was only for example, I actually declare the array in a function and not in sub main.  Also, I needed the array to be initialized to zeros, so when I googled malloc, I discovered that calloc was perfect for my purposes.  Malloc/calloc also has the advantage over allocating on the stack of allowing me to declare the size using a variable. CSS z-index causes part of tags to show through notifications on webmasters, web applications, gaming, gamedev, and their meta sites When you vote 35 times in a day and you only have five votes left, you start getting a warning popup that you are almost at your limit.  When this warning appears in the same place as the tags, part of the tags shows through it.        This screen shot was taken on webmasters.    This is also a problem on Web Applications: :        and :        This also happens on  as described .  Here is a .  It is also happening on the meta sites associated with the sites that have the problem.   For example, here is web apps meta site:    This a minor annoyance that has been around for at least a couple years. How do I show a function on 2-adic units is continuous (using the 2-adic metric)?   I'd be happy to learn the general rule or definition. But in particular I need to show that $f(x)=\dfrac{3x+1}{2^{v_2(3x+1)}}$ is continuous at all odd numbers.  Since the function is isometric in $\lvert\cdot\rvert_2$, i.e. since $\lvert f(x)\rvert_2=\lvert x\rvert_2$ every orbit of the function is duplicated, multiplied by any power of $2$.  This can therefore be formulated in various ways; as a function though the odd numbers, through the dyadic rationals, but the following seems good to work with.  If we let $n$ be a positive integer and $k$ be the power of $2$ we can define:  $f(2^k(2n+1))=(3(2n+1)+1)\cdot2^k\cdot\lvert3(2n+1)+1\rvert_2$  So $f(2^k(2n+1)=(3n+2)\times2^k\times\lvert3n+2\rvert_2$  Here is what I have so far:  I think to prove continuity in the 2-adic metric I need $\lvert x_n-x\rvert_2=0\implies\lvert f(x_n)-f(x)\rvert_2=0$  I think $k$ and $n$ are independent so I think I can examine them independently.  Taking $k$ to infinity brings both $x$ and $f(x)$ to zero so that seems to satisfies the continuity requirement.  Moving on to $n$; this seems to be an exercise in proving convergence within odd integers which are in a sense a subset of the 2-adic units.  I know all Cauchy sequences in these converge to 2-adic units but not much more than that.  However I do have a little insight into this particular function.  For example if we examine the inputs $x$ which map to any given output of $f(x)$, it can fairly easily be shown that these $x$'s take the form of a set $\left\{4^mp+\dfrac{4^m-1}{3}:m,n\in\mathbb{N}\right\}$ so, at least for any given output $f(x)$ the inputs always converge to $x=\frac{-1}{3}$ as the intervals between them become large powers of $2$.  In fact the orbit of the function $a(2^kx)=2^k(4x+1)$ on variation of $x$ and holding $k$ fixed is in a sense orthogonal to $f(x)$; which is a restatement of the above except not in closed form. Ubuntu 14.04, Intel Chromebook, no sound Cannot install Ubuntu in VirtualBox due to "this kernel requires an x86-64 CPU, but only detects an i686 CPU, unable to boot" error I was trying to install Ubuntu 12.04 in VirtualBox 4.2.12r84980. I see    this kernel requires an x86-64 CPU, but only detects an i686 CPU, unable to boot   But I am using a 64 bit Windows 8, and trying same .iso for trying Ubuntu. Then what is the problem? Recently, I read this  about how they have some of their infrastructure laid out. I was curious to know, does Stack Exchange use caching (both at the application layer and/or database layer) and if so, how? Did Dumbledore know that Harry would have to sacrifice himself from the very beginning? Based on the following interchange between Harry and Dumbledore in the pivotal &quot;King's Cross&quot; chapter of Deathly Hallows, I was wondering when exactly Dumbledore put together that Harry would have to die in order to bring about Voldemort's ultimate demise:  &quot;And you knew this? You knew--all along?&quot; &quot;I guessed. But my guesses have usually been good,&quot; said Dumbledore (Deathly Hallows, 599, hardcover).  The conversation that spurred Harry's question includes material dating back to Halloween '81, but also specifically mentions the events of the graveyard from GoF. So, &quot;knowing all along&quot; could refer to everything (i.e., Harry must die, Voldemort ignorantly tethered him to life, etc.) or just that Voldemort tethered him to life. Other important information pertaining to this question can be found in OOTP, when Dumbledore confirms (if he didn't already know) that Harry contains part of Voldemort's soul. He uses the silver instrument to find out that Harry is just like Nagini, having the ability to share mind and soul with Voldemort. He also says the following:  &quot;I guessed, nearly fifteen years ago,&quot; said Dumbledore, &quot;when I saw the scar upon your forehead, what it might mean. I guessed that it might be the sign of a connection forged between you and Voldemort&quot; (Order of the Phoenix, 826-827, hardcover).  While confirming that he guessed that Harry might share a connection with Voldemort from the very beginning, Dumbledore does not confirm with this statement that he knew Harry would ultimately have to give up his life. In Philosopher's Stone, when Dumbledore drops off Harry on the Dursley's doorstep, we know he is not entirely truthful with McGonagall.  McGonagall asks: &quot;How in the name of heaven did Harry survive?&quot; &quot;We can only guess,&quot; said Dumbledore (Philosopher's Stone, 12, hardcover).  Of course, this was a lie. Dumbledore already knew how Harry survived, otherwise he wouldn't be delivering Harry to Lily's sister to extend the blood sacrifice. By proxy, he also knows that Voldemort will return b/c of Horcruxes, otherwise he wouldn't be so worried about Harry. Finally, when asked in the same scene if he could remove the scar, Dumbledore says:  &quot;Even if I could, I wouldn't. Scars can come in handy&quot; (Philosopher's Stone, 15, hardcover).  So, did Dumbledore know at this very moment that Harry would have to die? Did he at least guess it to be true during this scene? We know he gains perfect confirmation in OOTP, but did he know it &quot;all along,&quot; as a particular reading of the King's Cross interchange in DH would have us believe? Proving a limit of a trigonometric function: $\lim_{x \to 2/\pi}\lfloor \sin \frac{1}{x} \rfloor=0$ $$\lim_{x \to \frac{2}{\pi}}\lfloor \sin \frac{1}{x} \rfloor=0$$    I need to prove the limit of this using the $\epsilon - \delta $ way but I don't know how to find $\delta$ when I'm given a trigonometric function I know only how to do it with polynomial functions Where do I report people for deleting their questions on purpose after they get an answer Today I was looking at the question of this . The question was pretty simple, he was looking for the eval function in  not knowing of it's existence. He received a comment and while I was finishing reading the question, I saw him commenting      Thanks, eval() is what I was looking for.   and then he deleted his question. In my opinion, such behavior isn't appropriate. So, should I just ignore this or can I do something about it? Natbib In-Text Citation displays (author?) I'm sorry if this seems a bit too basic, but I guess I'm just looking to confirm understanding here. I get the sense I'd have to do this in two steps, and I've started trying to grok correlation matrices, but it's just starting to seem really involved. I'm looking for a concise explanation (ideally with hints towards a pseudocode solution) of a good, ideally quick way to generate correlated random numbers.   Given two pseudorandom variables height and weight with known means and variances, and a given correlation, I think I'm basically trying to understand what this second step should look like:     height = gaussianPdf(height.mean, height.variance)    weight = gaussianPdf(correlated_mean(height.mean, correlation_coefficient),                          correlated_variance(height.variance,                          correlation_coefficient))    How do I calculate the correlated mean and variance? But I want to confirm that's really the relevant problem here.  Do I need to resort to matrix manipulation? Or do I have something else very wrong in my basic approach to this problem? How do suggested edits work? When clicking &quot;edit&quot; I see:  Your edit will be placed in a queue until it is peer reviewed. We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.  Like:     Likewise, when I am not logged in, clicking &quot;improve this question&quot; or &quot;improve this answer&quot; shows:  You are not . Your edit will be placed in a queue until it is .  And when I click 'Save', I get:  Thanks for submitting an edit. It is only visible to you until it's been approved by trusted community members  Like:     Who can suggest an edit? Where do suggested edits go? Who can vote on a suggested edit? How do suggested edits get reviewed? Can I earn reputation? What about abuse or bad edits? Sometimes the Community user approves or rejects my edit. Why is that? When can I not suggest an edit? Is there a minimum change requirement for a suggested edit? How do I check my suggested edit history? I disagree with the reasons why my suggested edit was rejected. What can I do? How do I know whether there are edits waiting for review? Someone suggested an edit to my own post, and the reviewers took the wrong action. What can I do? Are tag wikis included in this scheme? What do the &quot;Improve Edit&quot; and &quot;Reject and Edit&quot; buttons do? Why are apparently valid links to rejected edits resulting in 404 errors?   For more information about editing, see &quot;&quot; in the . What are the consequences of using a low-wattage USB-C power supply with a MacBook Pro? I have $a,b,c\in\mathbb{Q}$ not all zero. ($a^2+b^2+c^2\ne 0$), I want to show that the following determinant is then non-zero. I failed to arrive at an appropriate form of the polynomial. Help please. $$\left|\begin{bmatrix} a &amp; 2c &amp; 2b\\b &amp; a &amp; 2c\\ c &amp; b &amp; a\end{bmatrix}\right| = a^3+2 b^3-6 a b c+4 c^3$$    Second question, what is the easiest way to argue that $\{1,\sqrt[3]{2},(\sqrt[3]{2})^2\}$ is linearly independent in $\mathbb{Q}$?    Motivation: Prove that $\mathbb{Q}[\sqrt[3]{2}] = \{a+b\sqrt[3]{2}+c(\sqrt[3]{2})^2\;|\;a,b,c\in\mathbb{Q}\}$ forms a field.   Proof: Since $\mathbb{Q}[\sqrt[3]{2}] \subset \mathbb{R}$, we prove $\mathbb{Q}[\sqrt[3]{2}]$ is a subfield of $(\mathbb{R},+,\cdot)$    $\forall (a+b\sqrt[3]{2}+c(\sqrt[3]{2})^2)\in \mathbb{Q}[\sqrt[3]{2}]\backslash\{0\}.$ We want to find $(a+b\sqrt[3]{2}+c(\sqrt[3]{2})^2)$ such that    $(a+b\sqrt[3]{2}+c(\sqrt[3]{2})^2)(d+e\sqrt[3]{2}+f(\sqrt[3]{2})^2) =$ $ (ad+2ec+2bf)+(ae+bd+2cf)\sqrt[3]{2}+(af+cd+be)(\sqrt[3]{2})^2 = 1$    Since $\{1,\sqrt[3]{2},(\sqrt[3]{2})^2\}$ is linearly independent (?) over $\mathbb{Q}$, we show there is unique solution to: $$\begin{bmatrix} a &amp; 2c &amp; 2b\\b &amp; a &amp; 2c\\ c &amp; b &amp; a\end{bmatrix} \cdot \left[\begin{array}{l l} d\\e\\f \end{array}\right] = \left[\begin{array}{l l} 1\\0\\0 \end{array}\right] $$ Which is equivalent in showing the determinant is non-zero $$\left|\begin{bmatrix} a &amp; 2c &amp; 2b\\b &amp; a &amp; 2c\\ c &amp; b &amp; a\end{bmatrix}\right| = a^3+2 b^3-6 a b c+4 c^3=(?)$$    By subfield test, 1)2)3)4) is enough to say that $(\mathbb{Q}[\sqrt[3]{2}],+,\cdot)$ is a subfield of $(\mathbb{R},+,\cdot)$ therefore a field.  EDIT: If you have shorter way that prove the proposition without touching my 2 questions, that is even better. Can Reduce *really* not solve for x here? Is $\mathbb{Z}[x]/(x^2+1)$ isomorphic to $\mathbb{Z}[i]$? iMac with 8GB RAM -- memory always almost full I have a 27'' iMac (Late 2012, OS X 10.9.2) with 8GB RAM. The usage of memory is always above 7GB, even though I don't think I am running that much stuff. This leads to the occasional hanging of a program and occasional feeling of the computer being lagged.  The heaviest thing I am running is a Parallels virtualization of a defunct Windows laptop (for my Windows-only programs; work-related). Then I mostly surf with Chrome (10-20 tabs, some with youtube videos). Of course I have other things opened, like Mail, Evernote and a few more. But I don't think a 8GB RAM computer should be overwhelmed by that. I could be wrong.  I am willing to provide an export of processes from the Activity Monitor. I tried looking into it, of course, and I am running A LOT of small processes (unknown to me) -- system stuff I presume. I am a long-time PC user and I know my way around process management in PCs, but not on Mac.  What do you think? Do I just need more RAM or it doesn't feel like it?  Regards, Proof of $\int_0^\infty \left(\frac{\sin x}{x}\right)^2 \mathrm dx=\frac{\pi}{2}.$