The questions "Who?", "What?", "When?", "Where?", "How?", and "Why?" remain unanswered.  She was tired of his "Where were you?", "How many drinks did you have?", and " Were you unfaithful to me?" questions.  Please, no recasts.  Thank you.
The American convention in quotations is (typically) to place punctuation inside quoted text. But I always run into situations where the punctuation of the quote interferes with the punctuation of the sentence. How would you punctuate this (American, non technical)?     When my friends ask, "What do you want for your birthday?", I never know how to respond.   It seems odd to place the last comma outside the quote simply because of the question mark. Is that the preferred (i.e. most often accepted) standard?
Traverse a list in reverse order in Python So I can start from len(collection) and end in collection[0].  I also want to be able to access the loop index. Isomorphisms preserving integral domains and fields Let $R \simeq S$ be isomorphic commutative rings with unity. Prove the following:  a). If $R$ is an integral domain then $S$ is an integral domain.  For this, I said that If I let $f: R \to S$ be an isomorphism and $(R, + , \circ), (S, \oplus, \ast)$, then let $x, y\in R$,  such that $x \circ y = 0_R$, because $f$ is an isomorphism, $f(x \circ y) = f(x) \ast f(y) = f(0_R)$. If I let $R$ be an integral domain then, as per the definition $R$ is commutative, has unity, and no zero divisors.   So $f(x \circ y) = f(x) \ast f(y) = f(0_R)$ where we have either $f(x \circ y) = f(0_R) \ast f(y) = f(0_R)$ or $f(x \circ y) = f(x) \ast f(0_R) = f(0_R)$.   Since $f$ is an isomomorphism, let $s = f(x), t = f(y)| s,t \in S$. Then $s \ast t = f(0_R)$. By definition, $S$ also has unity so $0_S$ exists. If we map $0_R \to 0_S$. Then either $s = 0_S$ or $t = 0_S$.   So then, since $S$ has unity, is commutative, and has a no zero divisors as we showed above, it is also an Integral domain.  I'm not sure I have this correctly.  b). If $R$ is a field then $S$ is a field. I don't really understand how to do this one. Since $S$ is an integral domain, it has a $0_S$. So I need to show that $S$ distributes $\ast$ over $\oplus$.  Any help with these is appreciated IF/ELSE script in sender profile I'm trying to create a dynamic sender profile where the from name and from email change if a value is present in a specific field of the data extension. I want the Lead First Name value and Lead Last Name values to appear. I'm trying to keep all the logic in the sender profile. %%=IIF(EMPTY(AttributeValue(&quot;X&quot;)), &quot;Bill&quot;, AttributeValue(&quot;LeadFirstName&quot;) AttributeValue(&quot;LeadLastName&quot;))=%%  Not sure why, but doing the test, the script shows up as the sender and isn't resolving. forecast using arima models I am trying to predict values using arima(0,1,1). After doing predict(mod,n.ahead=5) (in R) am getting the same value for all the predictions:   5947.681 5947.681 5947.681 5947.681 5947.681    Is it correct? 60% Downpayment on house? Prove that the union of the interior of a set and the boundary of the set is the closure of the set I'll denote closure of A with $\overline{A}$, $A^\circ$ as the interior of A, $\partial A$ as the boundary of $A$ and $A'$ as the accumulation points. I'm trying to prove the following:   $$\overline{A}=A^\circ \cup\partial A$$  Is this a valid proof?  Take $x \in A^\circ \cup \partial A$ then $x \in A^\circ$ or $x \in \partial A$   if $x \in A^\circ$ then $x \in \overline{A}$  if $x \in \partial A$ then $x \in \overline{A} \cap\overline{(X\setminus A)}$ thus $x \in\overline{A} $ so $A^\circ\cup\partial A\subset\overline{A}$  Take $x \in \overline{A}$ then $x \in A' \cup A$ thus $x \in A'\setminus A$ or $x \in A^\circ$  if $x \in A'\setminus A$ then $x \in \overline{(X\setminus A)}$ so $x \in \overline{A}\cap\overline{(X\setminus A)}$ and $x \in\partial A$ so $x\in A^\circ\cup\partial A$  if $x \in A^\circ$ then $x \in A^\circ\cup \partial A$ so $\overline{A}\subset A^\circ\cup\partial A$ Is it possible to match encrypted documents using user-defined search terms? Suppose I am storing a number of encrypted documents in a database. I would like to make it possible to identify the subset of documents whose contents match user-specified search terms without a) maintaining a plaintext index or b) decrypting documents on the fly. Is there any way to accomplish this securely?  By the same token, I'm wondering if a collection of encrypted documents can be sorted according to an encrypted attribute (e.g., document title) without first decrypting all attribute values. Is there any reason to use this-> I am programming in C++ for many years, still I have doubt about one thing. In many places in other people code I see something like:  void Classx::memberfunction() {     this-&gt;doSomething(); }   If I need to import/use that code, I simply remove the this-> part, and I have never seen anything broken or having some side-effects.  void Classx::memberfunction() {     doSomething(); }   So, do you know of any reason to use such construct?  EDIT: Please note that I'm talking about member functions here, not variables. I understand it can be used when you want to make a distinction between a member variable and function parameter.  EDIT: apparent duplicate: Export multiple objects to .obj What is the function of the RNA primer in DNA replication? During DNA replication, RNA primase puts an RNA primer in the lagging strand. What is the function of this RNA primer? Why can't the enzymes put DNA fragments directly? Implied string comparison, 0=='', but 1=='1' I have written below Wrapper class.  global class BI_VA_AutomationWrapper {      global class BI_VA_AutomationRequest {      webservice String userName;     webservice String emailId;     webservice String buinessUnit;     webservice String orgName;     webservice String country;     webservice String environment;     webservice String myShopNumber;     webservice String BidsId;//for testing     webservice String Type; //for testing  }  global class BI_VA_AutomationResponse {      webservice String responseStatus;     webservice String myShopNumber;     //webservice list&lt;Error&gt; errorMessages;     webservice String  errorMessages;//for testing   } global class BI_VA_Error {      webservice String type;     webservice String message;    }}   And test class is,  @isTest public class BI_VA_AutomationWrapperTestClass  { public static testMethod void unitTest(){      BI_VA_AutomationWrapper.BI_VA_AutomationRequest wrap= new BI_VA_AutomationWrapper.BI_VA_AutomationRequest();        wrap.userName='Test@test.com';     wrap.emailId='Test@test11.com';     wrap.buinessUnit='AH';     wrap.orgName='ORD';     wrap.country='US';     wrap.environment='QA';     wrap.myShopNumber='123456789';     wrap.BidsId='123';     wrap.Type='ResetPassword';              BI_VA_AutomationWrapper.BI_VA_AutomationResponse res= new BI_VA_AutomationWrapper.BI_VA_AutomationResponse();     res.responseStatus = 'Success';     res.myShopNumber = '987654321';     res.errorMessages = 'Test error';      BI_VA_AutomationWrapper.BI_VA_Error error = new BI_VA_AutomationWrapper.BI_VA_Error();     error.type = 'Test';     error.message = 'Test';  }}   Code coverage is 0% only. Flash drive .docx disappeared files For a polynomial $p(z)$, prove there exist $R>0$, such that if $|z|=R$, then $|p(z)|\geq |a_n|R^n/2$ For a polynomial $p(z)=a_0+\ldots+a_nz^n$, prove there exist $R&gt;0$, such that if $|z|=R$, then $|p(z)|\geq |a_n|R^n/2$.  I get $|p(z)|\geq |a_n|R^n$, which makes that factor of $1/2$ useless. So I must have done something wrong.  $$|\frac{\partial^n{f}}{\partial z^n}(P)|\leq \frac{\sup_{z\in \overline{D}(P,r)} |f(z)|k!}{r^k}$$. This is the Cauchy estimate.   $$|\frac{\partial^n{p}}{\partial z^n}(z)| = |a_n n!|$$ $$|\frac{\partial^n{p}}{\partial z^n}(0)|\leq \sup_{\zeta\in \overline{D}(0,|z|)} |p(\zeta)|n!/R^n$$ $$|a_n n!|\leq \sup_{\zeta\in \overline{D}(0,|z|)} |p(\zeta)|n!/R^n$$ $$R^n |a_n|\leq \sup_{\zeta\in \overline{D}(0,|z|)} |p(\zeta)|$$  There exist a $z_0$, such that $|z_0|&gt;0$ and $$\sup_{\zeta\in \overline{D}(0,|z_0|)} |p(\zeta)| = |p(z_0)|$$.  This is saying there exist a disk centered at the origin, such that $|p|$ is maximum on some point on the boundary.   Let $R=|z_0|$, we have $R^n |a_n|\leq |p(z_0)|$  Edit: I know what I got wrong. $z_0$ is just one point on the circle $|z| = R$. One can chose another point $z_1$ on the circle, such that $p(z_1)&lt;p(z_0)$. How to get a list of the filenames of the figures embedded in a document I have a TeX document that is embedding a huge amount of figures from a fig folder that is full of another humongous amount of other figures.  I would like to move the document along with its figures, but I don't want to take the whole fig folder, just the figures in there that are embedded by the document.  Is there a package (or any other way) that allows me to, for example, print out the filenames of all the figures embedded by the document? Something like:  fig/figurename1.eps fig/figurename2.eps ... etc   I could then just copy-paste that list and add some cp's in a plain text file and automate the copy of those files to my desired location by running the file in my shell:  $ cp fig/figurename1.eps wherever/fig/ $ cp fig/figurename2.eps wherever/fig/ ... etc   Of course this is just an idea, if somebody has an alternative to the "file listing and copy-pasting in a shell file" I would be happy to listen =) Can anyone provide some pseudo code for a roulette selection function? How would I implement this:    I don't really understand how to read this math notation. I never took any probability or statistics. I have looked through several questions and answers on EL&amp;U, and often there is an indication that American English prefers "have" while British English prefers "have got". In addition, there are several references to "have got" being more informal than "have" (e.g.: , ). But where is it considered more informal? In American English alone or both American and British English?   This point may seem obvious to those who made the above mentioned references, but the fact is that even the most fluent users of English in my country will say without a doubt that 'have got' is the preferred usage in the UK and, therefore, it must also be more formal. Why? Because in an academic environment, the more informal structures are generally frowned upon, outside some specific spoken exercises. And if the teachers insist on using "have got", it follows it isn't informal.  So, is the teaching of (British) English in our schools transmitting the wrong idea?  EDIT: I'm adding some information in answer to the comments.  I'm mainly concerned with the idea of possession:      I have got a cat vs. I have a cat and She has got a dog vs. She has a dog   As mentioned in the comments, every (Portuguese) student will be told that "have" and "have got", when it comes to the idea of possession, are absolute synonyms, the only two differences being:    "have got" is preferred by British English, "have" is preferred by American English   the negative and interrogative structures differ    I have never heard of any distinction in formality. In fact, I was rather surprised when I went through the EL&amp;U archives and read about it.  So, would "I have got a cat" be as formal/informal as "I have a cat"?   And how do British and American English look at its formality/informality? Is it the same? Why do people go to the Wall in Game of Thrones? Is the wall a bad or a good place to be? Some people are sent there as punishment, others go because they want to (Jon Snow), others to get away from harm (Arya).  If I am not completely correct, it is because I have only started watching the series recently, and it is a bit confusing!  Please also correct me if I am wrong with any facts! Grep: unexpected results when searching for words in heading from man page I'm running into weird behavior when trying to grep a man page on macOS. For example, the Bash man page clearly has an occurrence of the string NAME:  $ man bash | head -5 | tail -1 NAME   And if I grep for name I do get results, but if I grep for NAME I don't:  $ man bash | grep 'NAME' $ man bash | grep NAME   I've tried other uppercase words that I know are in there, and searching for SHELL yields nothing whereas searching for BASH yields results.  What's going on here?  Update: Thanks for all the answers! I thought it worth adding the context in which I ran into this. I wanted to write a bash function to wrap man and in cases where I've tried to look up the man page for a shell builtin, jump to the relevant section of the Bash man page. There might be a better way, but here's what I've got currently:  man () {   case "$(type -t "$1")" in     builtin)       local pattern="^ *$1"        if bashdoc_match "$pattern \+[-[]"; then         command man bash | less --pattern="$pattern +[-[]"       elif bashdoc_match "$pattern\b"; then         command man bash | less --pattern="$pattern[[:&gt;:]]"       else         command man bash       fi       ;;     keyword)       command man bash | less --hilite-search --pattern='^SHELL GRAMMAR$'       ;;     *)       command man "$@"       ;;   esac }  bashdoc_match() {   command man bash | col -b | grep -l "$1" &gt; /dev/null } Haar measure on $SO(n)$ I am interested in describing the group of special orthogonal matrices $SO(n)$ by a set of parameters, in any dimension. I would also like to obtain an expression of the density of the Haar measure in this set of parameters. Could anyone help me on this or indicate a good reference? Thanks