Singular vs plural: the effect of conjunctions
Singular or plural following a list
How to implement a \tomorrow in latex I was asked how to implement a \tomorrow macro in TeX/LaTeX. While I could come up with a reasonably good solution, working for one document class, I don't see how that could be achieved in a document class agnostic way.  I found , but even though the date arithmetic may be of use, it assumes a specific format for the date (which also is wrong for the locale I reside in).  Does anyone have a reasonably portable solution? Is this even possible? In the Harry Potter universe, wizards and witches have managed to keep Muggles unaware of their existence, across the planet and over many centuries. Up to the timeframe that the novels take place in (the 1990s), I can see how this can be achieved through a combination of discretion and magic, with discretion being the preferred method on occasion (e.g., you don't need magic to slip into Platform 9 3/4 unnoticed, you just need to check that nobody is looking).   Our current world of 2016, however, its a very different place. The UK is (in)famously heavily camera-monitored (). Even more poignantly, a very large (and growing) segment of the population carries an internet-enabled HD camera with them at all times and are willing to use it at a moment's notice (, but it is comedy in part because a more realistic version could happen). It looks like, the moment something magical happens in public, a video of it would be on Youtube/Facebook/Twitter and within minutes.   How does the Ministry of Magic deal with this development? Do they need to create a dedicated corps to monitor social media services and alter records as necessary? Determinant of a square matrix in a field \begin{array}{rrrrr|r}     b &amp; a &amp; a &amp; \cdot \cdot \cdot &amp; a \\     a &amp; b &amp; a &amp; \cdot \cdot \cdot &amp; a \\     a &amp; a &amp; b &amp; \cdot \cdot \cdot &amp; a \\     \cdot &amp; \cdot &amp; \cdot &amp; \space &amp; \cdot\\ \cdot &amp; \cdot &amp; \cdot &amp; \space &amp; \cdot\\ a &amp; a &amp; a &amp; \cdot \cdot  \cdot &amp; b   \end{array}  I have the above matrix $A\in M_{n\times n}(F)$ where $F$ is a field and $n\geq1$, $a,b\in F$.  I'm trying to find out how to use row operations to make it into an upper triangular matrix in order to figure out the determinant. But I'm not sure how I would approach it. How does Spider-Man climb walls? Why is $\frac{1}{\frac{1}{0}}$ undefined? Number of bitstrings with $000$ as substring I have $F_n$ number of bitstrings that have $000$, How would I prove that for $n \ge 4$ , $a_n = a_{n-1} +a_{n-2}+a_{n-3}+ 2^{n-3}$?  Now there are many  ways to go about this but if I choose starting a $n-3$ bit string and append it with $000$ how would I show that? Digitally selectable filter I have asked a  but I did not get an answer, as it was too specific. So I will build on it but make it a bit more broad spectrum.  I would like to make a digitally selectable BPF using transistors to select a component in the filter; resulting in the center frequency being changed.  I have used FilterPro to generate quick second order filters and get a rough filter response.  For all the designs, a Multiple-feedback was selected:  In the first picture, a center frequency at 108KHz with a bandwidth @ -3dB of 103K to 113KHz is given.    For the second, a center frequency at 117.5KHz with a bandwidth @ -3dB of 112.8K to 122.2KHz is given.    The only difference between these two circuits is R3.  If I were to implement a circuit as shown below, would it work and what transistor would be recommended? I have selected the  as the Opamp in the circuit design as that is what was used for the .    For the transistors, I was thinking of using the MOSFETs (2N7002) used in the ST7590 design as well. Effective Refractive Index in Paper I am reading the paper, entitled "Artificial uniaxial and biaxial dielectrics with use of two-dimensional subwavelength binary gratings" by Eric B. Grann, M. G. Moharam, and Drew A. Pommet.   In the paper they mention this formula:        Do you know how it can be derived and where it comes from ? bash regex with quotes? The following code  number=1 if [[ $number =~ [0-9] ]] then   echo matched fi   works. If I try to use quotes in the regex, however, it stops:  number=1 if [[ $number =~ "[0-9]" ]] then   echo matched fi   I tried "\[0-9\]", too. What am I missing?  Funnily enough,  suggests this should work.  Bash version 3.2.39. What are FML and BWSS? I see this ad sometimes and I would like to know what the acronyms are. Series about proxy space battles via implanted computers in kids The premise of the story is that there are 2-3 main coalitions on Earth and they fight over resources in the edges of the solar system with spaceships that are controlled from Earth by kids with computers in their heads.  If I recall correctly:   The main character's name is Tom, he starts out by conning people at some sort of gambling arcade before he is found and recruited by the "army" The Pentagon in the US has a super tall tower built in the courtyard called The Spire where most of the three books take place. The reason they need kids for this has something to do with brain elasticity and putting computers in adults causes them to go mad. All the cadets are super dismissive about learning how to program their computer aside from one girl who is super good at it. The best fighters from each side of this conflict were something of superstars, but everyone else was kept completely anonymous for their protection. There were at least 3 books last I knew, released circa 2011-2014 The third book ends with Tom being the first astronaut to Mars. The first book had a green cover, the second was yellow, and the third was red. Though I might have the order wrong. Why is it that Frisian is considered the closest related language to English? It is commonly asked "What is the closest language to English?" and the equally common answer is         Except that there is rarely a reason given for this connection; the most that is given are baldly stated 'facts' (e.g. "English and Dutch are in the same 'Low German' group")  Can anyone give any substantive reasons? For example, an comparative overlap of vocabulary, a distance metric of phonology, privately shared syntactic rules among all the rules in West German languages. Opening a file from terminal When we want to open an application or file from the terminal, we type, say,  okular file.dvi   This opens the application, but also shows the status of the application. We cannot close the terminal, because it kills the process. Unfortunately, if you're trying to, for example, create a LaTeX file, you will need one tab for the text editor, one for the dvi file, and so on. And if you're trying to open all windows from the terminal, you can forget it. I'm trying use the terminal as much as possible, and while I have Yakuake, it is still a bother having so many tabs and seeing which of those have an application I've killed and so on.  So, is there a way to open an application/file from the terminal so that the status doesn't show and immediately gives the prompt so that we can use it to open more applications? When do you use “learnt” and when “learned”? Is learnt UK English and learned US? Is it that simple?  I’m used to using learnt, but my US spellchecker says it is wrong. Calculation of limit without stirling approximation $\lim n^n/(e^nn!)=0$ using Stirling approximation it is obvious. But can we do it without using Stirling approximation.  Now series with terms $x^n n^n/n!$ has ROC $1/e$. What we can say about behaviour of power series at endpoints? I have installed Ubuntu on my D: partition using Wubi. Is there any way in which I can remove my Windows from C: drive and move my existing Ubuntu installation to C: drive and make it a regular install. Show that $a \star b=a \cdot b+a+b$ is binary operation for the group $\Bbb{ Q} \setminus \{-1\}$ The group $\left(\Bbb{ Q}\setminus\{-1\},\star\right)$ has as its underlying set the rational numbers different from $-1$ and the operation $\star$ is defined as $a \star b=a \cdot b+a+b$ where multiplication/addition are the usual operations with rational numbers.Show that this is a binary operation.  What I did (Please help verify):  identity element has to be 0 since $a\star 0 = a+0+a(0)$ so for $a\star b=0$ we have  $ab+a+b=0$ $$ab+a=-b \\ a(b+1)=-b \\ a=\frac{-b}{b+1}$$ so $b$ cant be $-1$ since that solution is not in $\Bbb{Q}$. Similar question might have been answered here. Is this operation true for all groups? I think so.  Thanks for the tips and help. As the title says, I'm wondering if there is a continuous function such that $f$ is nonzero on $[0, 1]$, and for which $\int_0^1 f(x)x^n dx = 0$ for all $n \geq 1$. I am trying to solve a problem proving that if (on $C([0, 1])$) $\int_0^1 f(x)x^n dx = 0$ for all $n \geq 0$, then $f$ must be identically zero. I presume then we do require the $n=0$ case to hold too, otherwise it wouldn't be part of the statement. Is there ay function which is not identically zero which satisfies $\int_0^1 f(x)x^n dx = 0$ for all $n \geq 1$?  The statement I am attempting to prove is homework, but this is just idle curiosity (though I will tag it as homework anyway since it is related). Thank you! Is verifying ISOs downloaded from the official website worthwhile? I downloaded the ISO from , selecting the default "Ubuntu Desktop" option.  The website links the page  which gives instructions how to verify ubuntu.  This seems pretty tedious, and I am wondering how realistic it is that there is a problem with ISO downloaded from the official website. I note that the process of verification itself requires me to download software that is new to me, thus introducing another attack vector on me even as I am closing another one.  For what it's worth, I am planning to use Live USB only and not to fully install Ubuntu. Does that make a difference? A colleague and I recently submitted a paper to a journal with an impressive-sounding name, the "International Journal of Artificial Intelligence and Computational Research". According to ,      IJAICR is a referred [sic] journal in the field of computer science, artificial intelligence and soft computing methods.   It was accepted two days after we submitted it. That's too fast. We were suspicious. Although the journal said that all papers are peer-reviewed, we could not see how that was done in two days. Plus, we received no comments from the reviewers. Also, the submission guidelines didn't ask for a "blind" copy (without our names or any references to who we were).   But wait, there's more.  The acceptance letter asked us to send them US$300 to publish it. We did not. We've withdrawn our submission and will submit a new version of the paper to a more reputable journal in the coming months.  How might we make a better choice of respectable journals before we submit next time?