What is the term for a polite word or phrase that is used in place of a vulgar word or phrase?      "Prostitute" is a _____ for "hooker"
What term describes a non-offensive substitute for a swear word?   For example, Battlestar Galactica used frack instead of fuck. Another example is the use of snap instead of shit.  I think I may have heard a single-word term used to describe such alternate non-offensive words before, but I don’t know what it is.
USB composite device driver I am wondering if it possible to create a USB device (in following the device) composed from   a custom circuit (eg arduino) and  a flash storage   in such a manner that the device is recognized as a standard usb flash storage (and as such is operable with standart OS drivers), while said storage holds the utilities to operate with the custom circuit (dispalying the data colled by the circuit); and if so, how?  My first thought was to smack a cheap usb-hub and usb-pen before my circuit but that solution, is not pleasing to me.  My goal is to eliminate the need to carry an extra flash-drive just for the operating software, and use default os drivers, make it plug-and-just-work:   i plug the device in the os (windows) mounts a new flash-drive without needing a special driver is start (manually or via autorun) my custom.exe from that flash-drive i recive data measured by the circuit What is a nicer, less immature saying?  I love using 'A Freudian slip', but that is only applicable in certain situations. How to completely remove Garage Band from macOS? translation invariant of integral on $\mathbb{R}$ Problem 1: Let $f\in L^1(\mathbb{R})$, show $\int_\mathbb{R}f(t)dt=\int_{\mathbb{R}}f(x+t)dt,\forall x\in (-\infty, \infty)$.  Problem 2: Let $f\in L^1(\mathbb{R})$,show $\displaystyle \lim_{t\rightarrow 0}\int_{\mathbb{R}}|f(x+t)-f(x)|dx=0$.  My try for Problem 1:  Consider $\displaystyle \int_{\mathbb{R}}f(t)dt=\lim_{n\rightarrow \infty}\int_{-n}^nf(t)dt=\lim_{n\rightarrow \infty}\int_{\mathbb{R}}f_n(t)dt$, where $f_n(t)=f(t)\chi_{[-n,n]}$.  And since $dt=d(x+t)$, we have $\displaystyle \int_{-n}^nf(x+t)dt=\int_{-n+x}^{n+x}f(t)dt$.  So for each $x\in (-\infty,\infty)$,  $$ \begin{split} \int_{\mathbb{R}}f(t)-f(t+x)dt &amp;=\lim_{n\rightarrow \infty}\int_{\mathbb{R}}f(t)(\chi_{[-n,n]}-\chi_{[-n+x,n+x]})dt\\ &amp;=\lim_{n\rightarrow \infty}\int_{\mathbb{R}}f(t)(\chi_{[-n,-n+x]}-\chi_{[n,n+x]})dt\\ &amp;=\lim_{n\rightarrow \infty}\lim_{k\rightarrow \infty}\int_\mathbb{R}\varphi_k(t)(\chi_{[-n,-n+x]}-\chi_{[n,n+x]})dt\\ &amp;=\lim_{k\rightarrow \infty}\lim_{n\rightarrow \infty}\int_\mathbb{R}\varphi_k(t)(\chi_{[-n,-n+x]}-\chi_{[n,n+x]})dt \end{split} $$ where $\varphi_k(t)$ is simple function pointwise converges to $f(t)$, simple function vanish out of set of finite measure, so $\varphi_k(t)(\chi_{[-n,-n+x]}-\chi_{[n,n+x]})$ vanishes when $n$ big enough(is this right?)    Another try:  Since $f\in L^1$, $f$ is bounder a.e. so can be approximated by simple functions, and $\chi_{A+t}(x)=\chi_A(x-t)$,thus $$\int f(t)=\lim_n\int\varphi_n=\lim_n \sum_{i=1}^nc_i\mu(E_i)=\lim_n \sum_{i=1}^nc_i\mu(E_i-x)=\int f(t+x)$$  For problem 2, I guess they share the same method.   Any help or correction about these two problems? Thanks. Moving a doorbell transformer Can a doorbell transformer that is on the outside of a wall be place inside the wall behind the drywall. I’m concerned about it getting too hot. Mine is in the kitchen by the ceiling lights Why does Property Set throw StackOverflow exception? I know java and would normally put in getter/setter methods. I am interested in doing it in C# with the following code, but it throws a StackOverflow exception. What am I doing wrong?  Calling Code  c.firstName = "a";   Property Code    public String firstName; {     get     {         return firstName;     }     set     {         firstName = value;     } } Finding determinant for a matrix with one value on the diagonal and another everywhere else Let us look the the matrix  $\left(\begin{array}{ccccc} a &amp; b &amp; b &amp; b &amp; b\\ b &amp; a &amp; b &amp; b &amp; b\\ b &amp; b &amp; a &amp; b &amp; b\\ b &amp; b &amp; b &amp; a &amp; b\\ b &amp; b &amp; b &amp; b &amp; a \end{array}\right)$  It has one value, $a$, on the main diagonal, and another value, $b$ everywhere else. Let us assume that we are over a ring and that $a$ is invertible.  I wish to find the determinant of every $n\times n$ matrix of this form ($a$ on the diagonal, $b$ everywhere else). Using row and column operations I have managed to transform the matrix to upper-triangular form and found formula for specific cases. Generalizing it I got to the following formula:  $\det(A) = a\left(a-b\right)^{n-2}\left(a+\left(n-2\right)b-\frac{\left(n-1\right)b^{2}}{a}\right)$  I think I can prove it with row-operations in the general case with a little patience.  However, I'm wondering if there is a "smart" way of getting to this formula that I'm missing and if there is a nicer representation of it. Also, what can be said when $a$ is not invertible? (esp. the case where we are over a field and $a=0$). What is meant by a continuous-time white noise process? I have problems transferring binary programs to a micro-controller prototype board when using ubuntu/kubuntu to mount the board via usb. With MacOS and Windows there are no problems. I have found the writing from Ubuntu definitely changes the written file. I suspect that the write caching is the problem. How can I disable it, or what else might be the problem. How to disable phone number linking in Mobile Safari? Difference between Session and HttpContext.Current.Session Remove category & tag base from WordPress url - without a plugin Invocable method Apex class is not visible in Process builder Can I apply for a Schengen visa of the first port of entry or does it need to be the country of the longest duration? I'm planning to travel to the Netherlands, Spain and Bulgaria. My longest stay will probably be in Bulgaria. Now, Bulgaria doesn't issue a Schengen visa but allows people with a Schengen visa to visit. Which visa should I be applying for? Bulgarian Visa AND Schengen visa or just the Schengen visa for Netherlands or Spain? ShellExecuteEx code 31 error any time I try to launch an EXE, how to find problematic driver? What is the difference in meaning of "frustrated at" and "frustrated with" used in sentences like     He is frustrated with me   or      He is frustrated at me   When is each of these sentences above are used? "World's Hardest Easy Geometry Problem" AWS S3, Paperclip missing required :bucket option Proof that no polynomial with integer coefficients can only produce primes Doing a discrete math review and am trying to solve problem 1.6 in the text found here:  - I believe I've gotten parts (a) and (b) correctly, but (c) is a bit tricky for me. Would appreciate a review of a/b and a hint for c if possible. Restatement here:  For n = 40, the value of polynomial $p(n)::=n^2 + n + 41$ is not prime, as noted in Section 1.1. But we could have predicted based on general principles that no nonconstant polynomial can generate only prime numbers.  In particular, let $q(n)$ be a polynomial with integer coefﬁcients, and let $c::=q(0)$ be the constant term of q.  (a) Verify that $q(cm)$ is a multiple of c for all $m \in Z$  Proof: Since q is a polynomial, it will be of the form: $q(x) = a_nx^n+a_{n-1}x^{n-1} + ... + a_1x + c$  If $x = cm$, then notice that cm will be inside every term of the polynomial, and since the final term is c, c can be factored out of every term. Hence, q(cm) is a multiple of c for all $m \in Z$.  b) Show that if q is nonconstant and c > 1, then as n ranges over the nonnegative integers, $N$, there are infinitely many $q(n) \in Z$ that are not primes.  Proof: Continuing from the result found in (a), it is easy to see that for all $m \in Z$, there will be an infinite number of multiples of c that will be generated by q. Since c > 1, these multiples are guaranteed not to be prime.  c) Conclude that for every nonconstant polynomial, q, there must be an $n \in N$ such that $q(n)$ is not prime. Hint: Only one easy case remains.  c = 0 is trivially easy to prove using the (b) above.  I assume the "easy" case is referring to c = 1, but in this case I'm not sure how to continue, since the result of (a) and (b) don't apply: I can't use them since adding 1 to any even number may make it prime. If the result of the terms not including c is odd, then adding 1 to that result makes it even and it is not prime. However, if the terms add up to an even number, I don't see a way of using the knowledge I have so far to prove conclusively that that number + 1 will NOT in fact be prime. I am having trouble understanding what defines Entailment operator. On Mathoverflow I posted this question on what I perceive to be .  Consider: :     P therefore Q  P            Therefore, Q   My question is could we have arbitrarily defined it such as:     P therefore Q  P            Therefore, P   However, if an advanced civilization receives information in the form of following nested structures/containers or packets, how will they interpret Modus Ponens if in an alien land Modus Ponens is not defined?    Therefore, it raises the validity of MP. How do we define the implication or entailment operator? Because if we use an argument that relies on implication or entailment operator ipso facto, then it is trivial that logic is circular.  Is there a flaw in my rationale?