Bob does not know who/whom the thief is. Which is correct?
What’s the rule for using “who” and “whom” correctly?
How can I recover from a "AMD-Action:downloadProduct:SP" during installation of macOS? Just wiped my hard drive on my MacBook Pro from 2013. Went to install a new copy of MacOS Sierra. I get the following error:  AMD-Action:downloadProduct:SP   I looked online and tried change the date using the Utility Terminal and the following command:  date mmddHHMMyy   Then did   csrutil enable csrutil clear   Then I tried clearing the NVRAM using command + option + P + R on startup.  Still no luck. Still getting the same error message. Apple support told me to go to a "computer repair store".  Any advice? Attacks of the MAC construction $\mathcal{H}(m\mathbin\|k)$ for common hashes $\mathcal{H}$? Function on $[a,b]$ that satisfies a Hölder condition of order $\alpha > 1 $ is constant I want to show that if a function $f:[a,b]\rightarrow \mathbb R$ satisfies a Hölder condition of order $\alpha &gt; 1 $ then it is constant.  The way I think of it is as follows:  $$|f(x) - f(y)| &lt; K|x-y|^\alpha$$  $$\frac{|f(x) - f(y)|} {|x-y]}  &lt; K|x-y|^{\alpha -1}$$  $$\lim_{y\rightarrow x} \frac{|f(x) - f(y)|} {|x-y]} \le \lim_{y\rightarrow x}  K|x-y|^{\alpha -1} =0 $$ As the limit is $0$, we can remove the modulus, so we get:  $$\lim_{y\rightarrow x} \frac{f(x) - f(y)} {x-y} = 0$$ So $f$ is derivable and $f'(x) = 0$ for all $x$ in $[a,b]$. Note that the reason we can add the limit $y\rightarrow x$ is because $[a,b]$ is closed in $\mathbb R$.  However, the question gives as a hint using the mean value theorem. I am not sure why one should do that. You would first have to prove that $f$ is derivable in a similar manner to what I did, and then prove that $f$ is constant. Or is there a simpler way to do it and I am missing it?  Also please inform me of any mistakes I did in the proof (if any)/ Thank you! Function overloading in C Player looses boot after tackle Sort by author in Alpha bibliography Using the alpha bibliography style, citations are sorted by the citation key. I'd like to use the same style of authors-year citation keys (e.g., [CP92]) but have the bibliography sorted by the first author's lastname instead of alphabetically by the citation key itself. This would keep the same papers by the same first author together.  For example, alpha would produce the following sorted order:        [Cha81] D. Chaum. Untraceable...   [CL04] J. Camenisch and A. Lysyanskaya. Signature...   [CP92] D. Chaum and T. Pedersen. Wallet...      Whereas, abbr would produce the following sorted order:        [1] J. Camenisch and A. Lysyanskaya. Signature...   [2] D. Chaum. Untraceable...   [3] D. Chaum and T. Pedersen. Wallet...      I am looking for the same sorting as abbr but maintaining the citation key style of alpha.  Is there a way to achieve this hybrid style? Story with multiple 'third planet' races Lost/Deleted dpkg (package manager for Debian). How do I get it back? OS: Ubuntu 12.04  Accidentally deleted dpkg. Now, packages can't be installed. So, needs an dpkg installer which installs packages. I've just installed Ubuntu on my Lenovo g460  with Windows 7. I am not able to play any movie or mp3 file. When I click on a file I'm asked to install a plugin. When I click on the install button nothing happens. Issue in using longtable within table environment I have an issue making a long list with wrapped text. The table can be several page long. I use longtable and assign the width for each column but as soon as I put it in the \begin{table} \end{table}, it does not work. It clips the table. I want to make a label for the table so I put it in the table environment.  And is there a way to automatically adjust the width so that I don't need to assign the value manually?  Thank you.   Tung  \begin{table} \centering \begin{longtable}{|p{6.5cm}|p{2.5cm}|p{2.5cm}|p{2.5cm}|} \hline Name                                      &amp; Company     &amp;  Catalog Number   &amp;   Comments    \\ \hline Small DNA FRAG Extract Kit-100PR          &amp; VWR         &amp;   97060-558 &amp; \\ \hline Acrylamide 40\% solution 500 mL           &amp; VWR         &amp;   97064-522 &amp;  \\ \hline Bis-acrylamide 2\% (w/v) solution 500 mL  &amp; VWR         &amp;   97063-948 &amp;  \\ \hline GeneRuler 100 bp DNA Ladder, 100-1,000 bp &amp; Fermentas   &amp;   SM0241  &amp;    \\ \hline Mini Vertical PAGE System                 &amp; VWR         &amp;   89032-300  &amp;  \\ \hline \end{longtable} \label{tab:list} \end{table} Vim: How do I search for a word which is not followed by another word? Why won't Amanita move in and settle down? I keep getting an alert that Amanita would like to settle down. I have a house ready for them however they still won't move in. Who is this NPC and why won't they settle down? Adding a class to “body” I'm trying to add a custom CSS class to the &lt;body&gt; tag, How can I modify or pre-process the &lt;body&gt; tag to add the class body, Is it right to style the &lt;body&gt; tag with css file? I am a girl in my early twenties traveling to USA from India and in my visa application I have provided the contact address for a relative in San Francisco, and their invitation letter. I would like to visit LA first. Will I face problems during immigration if I land in LA (with an immediate on wards ticket to SF)? I dont plan to get on the flight from LA to SFO.  Initially I was planning to fly to SFO from India and then fly to LA immediately after completing immigration at SFO airport. Let $A,B \subset \mathbb{R}$. Show that $\sup(A \cup B) = \max\{\sup A, \sup B\}$   Here's what I did so far:  Let $\sup A, \sup B$, and $\sup (A \cup B)$ denote upper bounds of $A,B$, and $A \cup B$, respectively. If $x \in A$, then $x \le \sup A$. If $x \in B$, then $x \le \sup B$. In either case, $x \in (A \cup B)$. So either $x \le \sup A$ or $x \le \sup B$. In either case, $x \le \max \{\sup A, \sup B\}$. So $\max \{\sup A, \sup B\}$ is the upper bound of $A \cup B$, which means $\sup (A \cup B) \le \max\{\sup A, \sup B\}$.  I do not know if there's a better way to go at it, but all I did was show the inequality. Can I do this, and show the reverse inequality? If so, how can I go about doing that? Running 64 bit programs on a 32 bit system This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, navigate to the  tag. This question and answer is owned by the community! If you can improve it and make it more useful, you're welcome to edit it. I am building a trigger, a unit test, or other Apex code. I'm working with sObject records, and trying to access related record information. For example, I might have a structure like this: Account a = new Account(Name = 'Test'); insert a;  Opportunity o = new Opportunity(Name = 'Donation', AccountId = a.Id); insert o;  System.assertEquals(o.Account.Name, 'Test', 'Correct Account associated'); // Assertion fails!  Or, in a trigger, I might be aiming for something like this: trigger ContactTrigger on Contact (after insert) {     for (Contact c : Trigger.new) {         if (c.Account.Name == 'Test') {             // Take some action here         }      } }  Why doesn't this work? Why am I getting null values, or NullPointerExceptions? Coefficients change signs I have a dataset where there is a high degree of multicollinearity, with all variables correlating positively with each other and the dependent variable. However, on some of the models I run I get a couple of significant negative coefficients. Basically there are two coefficients that depending on what variables I include in the model, I can manipulate their signs.  My understanding is that if the variance-covariance matrix only contain positive values, then all coefficients should also be positive. Is this correct? I wonder a generalization of Jensen's inequality: let $\mathbf{X,Y}$ be two positive definite matrices, can we obtain the following Jensen like inequality $$(1-\lambda)\mathbf{X}^{-1}+\lambda\mathbf{Y}^{-1} \succeq((1-\lambda)\mathbf{X}+\lambda\mathbf{Y})^{-1}$$ for any $\lambda \in (0,1)$, where the notation $\mathbf{A}\succeq \mathbf{B}$ represents matrix $(\mathbf{A-B})$ positive semi-definite. file /dev/* prints the description of a bunch of files as "block special (M/N)" and "character special (M/N)", where M and N are numbers. For example:  $ file /dev/null /dev/null: character special (1/3)   man file doesn't seem to document these, but refers vaguely to man stat, which seems to refer to these as major and minor device types. apropos 'device type' finds nothing. So what do these numbers mean?