I tried reading online articles about this but I'm still not understanding when it is correct.   The sentence:         "Logic is not for people like you and me."      Is this accurate and in which context could this change to "you and I"?  If the word "logic" was replaced by an adjective would that change anything?
When the phrase is used as an object, why so many native speakers are saying "you and I" instead of "you and me"? I'm not a native speaker but I thought "you and me" is correct. Not sure if this falls into the same category, but "Just between you and me" sounds more natural than "Just between you and I".
Quick question about curly braces not showing up Ii am writing a short code, so I doubt anything else in the code is causing the problem. This is the problematic line of code:  \[ M_R := \max {|f(z)|: |z - z_0| = R }\le M\]   It doesn't show the curly braces. I've tried using \left{ and \right} but to no avail.  What should I do?  Thank you How can I manipulate field-based data from the commandline? For example   How can I print only lines whose Nth field is foo? How can I print only lines whose Nth field isn't foo? How can I print only lines whose Nth field matches foo? How can I change field N to foo?   Is there a standard approach or toolset that facilitates manipulating field-based data on *nix systems? How to add "Refresh" option to right click menu in Lubuntu? I have many users at the place I work, expressing the notion of switching to Ubuntu.  Most of them, for whatever weird reason wanting to know if its possible to have refresh added when you right click on the desktop.   Is that possible? Show that a connected metric space is $\epsilon$-chainable for $\epsilon>0$ Show a connected metric space (X,d) is $\epsilon$-chainable for $\epsilon &gt;0$       $\epsilon$-chainable Definition      (X,d) is $\epsilon$-chainable if given any two points $a,b \in X$, $\exists$ a finite set $\{ x_0,x_1,...,x_n\}$ of points in X with $x_0 = a$, $x_n=b$ and $d(x_{n-1},x_n)&lt;\epsilon$, $\forall$ n      Clopen Definition      A set is clopen $iff$ its boundary is empty      Connected Metric Definition      Let $(X,d)$ be a metric space. It is connected $iff$ it has no proper subsets which are clopen      The following are equivalent:         $X$ is connected   The only subsets of $X$ that are clopen are $\emptyset$ and $X$   $\nexists$ non-empty, disjoint, open sets $A$ and $B$ such that $X=A\bigcup B$   $\nexists$ non-empty, disjoint, closed sets $A$ and $B$ such that $X=A\bigcup B$         Theorem      Let $(X,d)$ be a metric space, and let $S$ be any subset of $X$. Then $S$ is closed $iff$ $S^c$ is open.     So how would someone show this exactly?  Let the set $A$ be the set of all elements in $(X,d)$ that can be reached from $a\in X$ in a finite number of steps with length less than $\epsilon$.  Does this mean that there should be no isolated points? (an isolated point would be at distance infinity from any other point, or distance zero from itself, since $\epsilon &gt;0$ we don't want this?)  Knowing that $X$ is connected $\implies$the only subsets of X that are clopen are $\emptyset$ and $X$  Also, by construction of A;   A is the set of all $\epsilon$-chains between any element and $a$  And, so $A^c = \emptyset$ if $A$ was $\epsilon$-chainable (because A has to have a path from all elements to a, for this to be true, the complement wouldn't have anything in it)  Leaving only $A$ as the remaining clopen set  Does this make any sense? Or should an alternative be used, and how to formalize it.  Thanks. ng-options with simple array init Correct usage for "all you need is/are..." Add a linebreak in an HTML text area How can i add a line break to the text area in a html page? i use VB.net for server side coding. Do a "git export" (like "svn export")? I've been wondering whether there is a good "git export" solution that creates a copy of a tree without the .git repository directory. There are at least three methods I know of:   git clone followed by removing the .git repository directory.  alludes to this functionality but starts with "Just read the desired tree into the index..." which I'm not entirely sure how to do.  is a third party script that essentially does a git clone into a temporary location followed by rsync --exclude='.git' into the final destination.   None of these solutions really strike me as being satisfactory. The closest one to svn export might be option 1, because both those require the target directory to be empty first. But option 2 seems even better, assuming I can figure out what it means to read a tree into the index. A group $G$ with a subgroup $H$ of index $n$ has a normal subgroup $K\subset H$ whose index in $G$ divides $n!$ Assessing approximate distribution of data based on a histogram Suppose I want to see whether my data is exponential based on a histogram (i.e. skewed to the right).   Depending on how I group or bin the data, I can get wildly different histograms.   One set of histograms will make is seem that the data is exponential. Another set will make it seem that data are not exponential. How do I make determining distributions from histograms well defined? Homemade coconut milk separates into different layers after a day in the fridge I made some coconut milk. After a day in the fridge there was two layers of liquid in the jar, coconut water and solid coconut which I found out afterwards that it is called coconut butter! When I stir them together to  have my coconut milk back, it didn't work. Is there a way to prevent this? If not, is there a way to have coconut milk again? I have the following problem:  Let $a, b \in\mathbb{Z}$. Show that $\,\{ ax + by\ :\ x, y \in \mathbb{Z}\} = \{ n \gcd(a,b)\ :\ n\in \mathbb{Z} \}$   I understand that the Bezout's lemma says that $gcd(a,b) = ax +by$, so Im not really how you would go about proving the above, it doesn't really make sense to me. Any help is appreciated1 How can I reduce the delay before window previews are shown in the Windows 7 taskbar? I really love the preview feature of the Windows 7 taskbar. There's only one reason I don't use it more often -- it takes a relatively long time to display the actual window.  There is a registry trick () to reduce the delay used by general menus, and make the submenus open instantly when hovered upon. I'm wondering if there's a similar trick that can be used for the Windows 7 taskbar's previewing. Consider numbers of the type $n=2^m+1$. Prove that such an n is prime only if $n=F_K$ for some $ k \in N$, where $F_k$ is a Fermat Prime. Consider numbers of the type $n=2^m+1$. Prove that such an $n$ is prime only if $n=F_K$ for some $ k \in N$, where $F_k$ is a Fermat Prime. Consider numbers of the type $n=a^m-1$ where $a&gt;1$ is a natural number. Prove that such an $n$ is prime only if $n=M_p$ for p-prime, where $M_p$ is a Mersennt Prime.   I do not understand what the question is asking me for. Can I get some clarification? Which OpenType Math fonts are available? What OpenType math fonts are there available for usage in TeX/LaTeX, e.g. with the unicode-math package?  Here is a MWE which you can use to show off the font.  \documentclass{article} \pagestyle{empty}  \usepackage{amsmath} \DeclareMathOperator\Res{Res} \newcommand*\diff{\mathop{}\!\mathup{d}}  \usepackage{amsthm} \newtheorem{theorem}{Theorem}  \usepackage{unicode-math}  %%% % Set up you text and math fonts %%%  \begin{document}  \begin{theorem}[Residue theorem]   Let $f$ be analytic in the region $G$ except for the isolated   singularities $a_1,a_2,\dots,a_m$. If $\gamma$ is a closed   rectifiable curve in $G$ which does not pass through any of the   points $a_k$ and if $\gamma\approx 0$ in $G$, then   \[     \frac{1}{2\pi i} \int\limits_\gamma f\Bigl(x^{\mathbf{N}\in\mathbb{C}^{N\times 10}}\Bigr)     = \sum_{k=1}^m n(\gamma;a_k)\Res(f;a_k)\,.   \] \end{theorem}  \begin{theorem}[Maximum modulus]   Let $G$ be a bounded open set in $\BbbC$ and suppose that $f$ is a   continuous function on $G^-$ which is analytic in $G$. Then   \[     \max\{\, |f(z)|:z\in G^- \,\} = \max\{\, |f(z)|:z\in \partial G \,\}\,.   \] \end{theorem}  First some large operators both in text: $\iiint\limits_{Q}f(x,y,z) \diff x \diff y \diff z$ and $\prod_{\gamma\in\Gamma_{\bar{C}}}\partial(\tilde{X}_\gamma)$;\ and also on display \[   \iiiint\limits_{Q}f(w,x,y,z) \diff w \diff x \diff y \diff z   \leq   \oint_{\partial Q} f'\Biggl(\max\Biggl\{   \frac{\Vert w\Vert}{\vert w^2+x^2\vert};   \frac{\Vert z\Vert}{\vert y^2+z^2\vert};   \frac{\Vert w\oplus z\Vert}{\vert x\oplus y\vert}   \Biggr\}\Biggr)\,. \]  \end{document}   Here is a similar MWE for ConTeXt.  The images in the answer will only be shown for LaTeX output but the ConTeXt output looks very similar.  %%% % Set up you text and math fonts %%%  \setupmathlabeltext[Res=Res] \definemathcommand[Res][nolop]{\mfunctionlabeltext{Res}} \definemathcommand[diff]{\mathop{}\!\mfunctionlabeltext{diff}}  \defineenumeration   [theorem]   [text={Theorem},    style=italic,    title=yes,    titlestyle=normal,    distance=0pt,    titleleft={(},    titleright={).~},    alternative=serried,    width=fit]  \starttext    \starttheorem[title={Residue theorem}]     Let $f$ be analytic in the region $G$ except for the isolated     singularities $a_1,a_2,\dots,a_m$. If $\gamma$ is a closed     rectifiable curve in $G$ which does not pass through any of the     points $a_k$ and if $\gamma\approx 0$ in $G$, then     \startformula       \frac{1}{2\pi i} \int\limits_\gamma f\Bigl(x^{{\mathbf N}\in\mathbb{C}^{N\times 10}}\Bigr)       = \sum_{k=1}^m n(\gamma;a_k)\Res(f;a_k)\,.     \stopformula   \stoptheorem    \starttheorem[title={Maximum modulus}]     Let $G$ be a bounded open set in $\mathbb{C}$ and suppose that $f$ is a     continuous function on $G^-$ which is analytic in $G$. Then     \startformula       \max\{\, |f(z)|:z\in G^- \,\} = \max\{\, |f(z)|:z\in \partial G \,\}\,.     \stopformula   \stoptheorem    First some large operators both in text:   $\iiint\limits_{Q}f(x,y,z) \diff x \diff y \diff z$   and   $\prod_{\gamma\in\Gamma_{\bar{C}}}\partial(\tilde{X}_\gamma)$;\   and also on display   \startformula     \iiiint\limits_{Q}f(w,x,y,z) \diff w \diff x \diff y \diff z     \leq     \oint_{\partial Q} f'\Biggl(\max\Biggl\{     \frac{\Vert w\Vert}{\vert w^2+x^2\vert};     \frac{\Vert z\Vert}{\vert y^2+z^2\vert};     \frac{\Vert w\oplus z\Vert}{\vert x\oplus y\vert}     \Biggr\}\Biggr)\,.   \stopformula  \stoptext Order of elements is lcm-closed in abelian groups How can I prove that if $G$ is an Abelian group with elements $a$ and $b$ with orders $m$ and $n$, respectively, then $G$ contains an element whose order is the least common multiple of $m$ and $n$?  It's an exercise from Hungerford's book, but it's not homework. I could not solve it when I take the course on groups and I think it should be easy. There is a hint that says to first prove when $m$ and $n$ are coprimes. I did this part. But I have no idea how to solve the general case.  Thanks. Can not update Bash on Debian 6.0 (Squeeze) I can not update  on a Debian 6.0 (Squeeze) server to get rid of the discovered vulnerability:  bash --version GNU bash, version 4.1.5(1)-release (x86_64-pc-linux-gnu)  apt-get update apt-get install bash Reading package lists... Done Building dependency tree Reading state information... Done bash is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 7 not upgraded.   Can I use Squeeze-LTS for this server just to update Bash? After one week I will be on another server, so I will not make any other updates.  uname -m x86_64  lsb_release -a No LSB modules are available. Distributor ID: Debian Description:    Debian GNU/Linux 6.0.5 (squeeze) Release:        6.0.5 Codename:       squeeze How to reduce AWS EBS root volume size? Database synchronization between dev/staging and production I have a problem with WordPress database synchronization between development and production and I am wondering how other people solving it. I am aware about  but it doesn't really cover the nastier and more realistic use case.  Say I have a live WordPress website. I took a dump of everything, replicating it on our dev environment. I started making changes. 1 week later I am ready to deploy my updates. In the meantime, database on production site has changed(new posts, new comments, etc.). How do I synchronize changes between production and development during the rollout and is it possible to automate(somewhat at least) this process? Does it make a difference if your URL path ends in a trailing slash or not? Does it make any difference to SEO ratings what-so-ever if your url has a trailing slash:  http://www.example.com/some/slug/paths/   as opposed to one that does not:  http://www.example.com/some/slug/paths