I'm using overleaf and getting errors while trying to run  \subsection{Decomposition of circular functions as a product of elemental trigonometric functions \footnote{We take elemental trigonometric functions to mean circular functions having a period of $2 \pi$ (i.e. $\sin x$, $\cos x$).}}    The error im getting is:  Argument of \@sect has an extra }.  &lt;inserted text&gt;                  \par  l.24 ...od of $2 \pi$ (i.e. $\sin x$, $\cos x$).}}  I've run across a `}' that doesn't seem to match anything. For example, `\def\a#1{...}' and `\a}' would produce this error. If you simply proceed now, the `\par' that I've just inserted will cause me to report a runaway argument that might be the root of the problem. But if your `}' was spurious, just type `2' and it will go away.  main.tex, line 24  Runaway argument?  {\normalfont \large \bfseries }{\@xfootnote }\def \reserved@b {\stepcounter \ETC. ! Paragraph ended before \@sect was complete. &lt;to be read again&gt;                     \par  l.24 ...od of $2 \pi$ (i.e. $\sin x$, $\cos x$).}}  I suspect you've forgotten a `}', causing me to apply this control sequence to too much text. How can we recover? My plan is to forget the whole thing and hope for the best.
Trying to put a footnote in subsection title:  \subsection{Effect of Lateral Confinement on SW Band Structure\footnote{Parts of this sub--section are based on \citet{Venkat2013}}}   produces the following error:  Argument of \@sect has an extra } ...section are based on \citet{Venkat2013}}}   I am using:   \documentclass[paper=A4, fontsize=12, toc=listof, toc=index, toc=bib]{scrreprt}   Please advise.
Prove $\lim_{n\to\infty} \frac{a_n}{n}$ exists for positive sequence where $a_{n+m} \leq a_n + a_m$ Let $\{a_n\}_{n=1}^\infty$ be a positive sequence of real numbers such that $a_{n+m} \leq a_n + a_m.$  Prove that $\lim_{n\to\infty} \frac{a_n}{n}$ exists by showing that $\lim_{n\to\infty} \frac{a_n}{n} = \inf_{n \geq 1} \frac{a_n}{n}.$   A similar question has been posted previously, see  , and I have found that this is the general result of "Fekete's Subadditive Lemma" for sequences, but I am unhappy with the few proofs I've seen.  Perhaps the clearest one I have found is  , but this seems a bit tricky for what is expected on this qualifier question.  We are given a hint "treat $\liminf$ and $\limsup$ separately".  Does anyone know of a more direct way to show that this limit exists? Can python send text to the Mac clipboard Edit a truetype font I'm trying to find a free tool (on windows ) that would enable me to change some settings on a TrueType font. Specifically, I'm trying to fix the following errors:  E1311 The macStyle bold bit doesn't match the name table's font subfamily string macStyle bold bit is set, but subfamily is Regular  W2000 The subfamily string is inconsistent with the style of the font OS/2.fsSelection bold bit is set, but subfamily string = 'Regular'  I can do that with fontographer, but would prefer to use something free.  Fontforge doesn't seem to work with this font, when saved it corrupts the cyrillic letters in the font. Orthogonal Projection onto the $ {L}_{\infty} $ Unit Ball What is the Orthogonal Projection onto the $ {\ell}_{\infty} $ Unit Ball?  Namely, given $ x \in {\mathbb{R}}^{n} $ what would be:  $$ {\mathcal{P}}_{ { \left\| \cdot \right\| }_{\infty} \leq 1 } \left( x \right) = \arg \min_{{ \left\| y \right\| }_{\infty} \leq 1} \left\{ {\left\| y - x \right\|}_{2}^{2} \right\} $$  I managed to get an answer using the . Yet I would be happy to see if someone can derive the answer directly.  Thank You. Is a visa to Poland required for a Russian spouse of a Polish citizen? I am a holder of a Russian passport and my husband is a Polish citizen. We both live and work in the UK. I have received my family member of EEA national card, good for 5 years. We would like to travel to Poland together. On the website of the Polish embassy it clearly states that if we are traveling together, I do not require a visa, however in the embassy they were sure that I do need a visa. Could anyone please clarify? Cardinality of a set A is strictly less than the cardinality of the power set of A If a black body is a perfect absorber, why does it emit anything? I'm trying to start understanding quantum mechanics, and the first thing I've come across that needs to be understood are black bodies. But I've hit a roadblock at the very first paragraphs. :( According to :     A black body (also, blackbody) is an idealized physical body that absorbs all incident electromagnetic radiation, regardless of frequency or angle of incidence.   OK, that's nice. It's an object that absorbs (takes in itself and stores/annihilates forever) any electromagnetic radiation that happens to hit it. An object that always looks totally black, no matter under what light you view it. Good. But then it follows with:     A black body in thermal equilibrium (that is, at a constant temperature) emits electromagnetic radiation called black-body radiation.   Say what? Which part of "absorbs" does this go with? How can it absorb anything if it just spits it right back out, even if modified? That's not a black body, that's a pretty white body if you ask me. Or a colored one, depending on how it transforms the incoming waves.  What am I missing here? Suppose I have a function $f$ that is analytic on the unit disk $D = \{ z \in \mathbb{C} : |z| &lt; 1 \}$ that is also continuous up to $\bar{D}$. If $f$ is identically zero on some segment of of the boundary (e.g. $\{ e^{it}, 0 \leq t \leq \pi/2 \}$ ), is it then true that $f$ is identically zero on the entire boundary?   I know that analytic functions that are zero at an accumulation point inside the domain of analyticity are identically zero throughout the entire domain, but I don't know what (if anything) can be said if something similar occurs on the boundary of the domain. What changes after peer review but prior to final submission are acceptable for a conference paper? Google Drive files opening in new window vs new tab? This might be a duplicate of  but that question is 5 years old and unanswered.  When I'm in drive.google.com and I open a G Suite file (either double-click or select &amp; press enter) in Firefox it opens in a new window whereas in Chrome it opens in a new tab.   Why do they do that? Is this a browser-specific quirk or a Google setting (that I haven't found)? Is there a way to control the behavior? I'd like them both to open in tabs, but presumably the same answer would be relevant in the opposite direction too. Windows registry entries for default explorer view I'm making an automated installer for Windows XP, and I want the default view to be the "details" view on all folders - that is, the effect gotten by setting one folder to the details view, then going to Tools -> Folder Options -> View -> "Apply to All Folders". I also want the status bar to be showing, same as going View -> Show Status Bar.  What registry entries should I modify, and to what, to have this be the case? Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3) Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3)  SO this is for abstract algebra and I am really struggling with this. Here are some of the definitions and theorems I think would apply.  -an integer a divides and integer b if there is an integer q such that b=aq -Let a and b be integers, with a>0. Then there exist unique integers q and r such that b= aq+r and 0&lt;=r  The question says hint: use 2 cases but I'm not really sure what that means. I'm guessing it wants me to look at it when a is congruent to 0 and when it's not? so i tried to do that but just ended up stuck. below is as far as i got with that attempt  Proof: Case 1 There should be some information about letting variables exist in certain number sets here  assume a is not congruent to 0 mod 3, then 3 does not divide a-0, therefore a-0 does not equal 3q for some q in the integers  I was trying to get this to wind down to thus 3 divides a^2-1 but even tho it seems true (I couldn't find a counter example) I couldn't figure out how to prove it with what I have.  Next i tried reversing it thinking I could contradict it or something.  I think this would be case 2? assume a is congruent to 0 mod 3, then 3 divides a-0 and a-0=3q for some q in the integers, then 3q=a since 0 is the additive identity, therefore 3 divides a,  and again stuck and my brain hurts a little..  Can anyone help me figure out how to work this. Indefinite Integral with "sin" and "cos": $\int\frac{3\sin(x) + 2\cos(x)}{2\sin(x) + 3\cos(x)} \; dx $ I am currently facing a "performance problem" while using grep. I am trying to locate the occurrences of many (10,000+) keywords in many (think Linux kernel repository size) files. The objective is to generate a kind of index for each keyword:   keyword: my_keyword filepath 1 filepath 2 ------ keyword: my_keyword2 ...   Being fairly new to shell scripting, I have tried a few naive approaches:  while read LINE; do     echo "keyword: "$LINE &gt;&gt; $OUTPUT_FILE     grep -E -r --include='Makefile*' "($LINE)" . &gt;&gt; "$OUTPUT_FILE"     echo "-----" done &lt; $KEYWORD_FILE   This takes about 45 minutes to complete, with the expected results.  Note: all they keywords I search for are located in a file ("KEYWORD_FILE", so fixed before anything starts), and the files in which to search can be determined before the search starts. I tried to stored the list of files to search in before the search like that:  file_set=( $(find . -name "Kbuild*" -o -name "Makefile*") )   and then replace the grep call by  echo {$file_set[*]} | parallel -k -j+0 -n 1000 -m grep -H -l -w "\($LINE\)" &gt;&gt; "$OUTPUT_FILE"   It takes about an hour to complete&hellip;  Question: considering I can use whatever technique I want, provided it's sh compliant, how can this be done "faster" and/or more efficiently ?  Perhaps grep is not the tool to use, and my use of parallel is wrong&hellip; any ideas are welcome! What is the yield keyword used for in C#? How to disable Mac OS X's autocorrect but still show spelling suggestions? I welcome popup spelling suggestions, but I dislike the OS replacing text as I type without any real confirmation from me.   I'm aware both behaviors can be enabled/disabled together as one option in System Prefs &gt; Keyboard &gt; Text, but would anyone know a way to disable the autocorrect while leaving the tooltip-style suggestions intact…perhaps via the Terminal? Thank you.   Mac OS X 9.4 (Mavericks) Does there exist a smooth approximation of $x \bmod y$? I'm looking for a function $m(x,y)$ that smoothly approximates $x \bmod y$, and I'm assuming there would be some $n$ or $\varepsilon$ in the body of $m(x,y)$ that defines the degree of approximation such that as $n$ goes to infinity or $\varepsilon$ goes to zero,  $$ m(x,y)= x \bmod y. $$  I've looked at, for example, $\sin(x/y)$ and have been trying to figure out ways to make $\sin(x)$ more "steep" so that I can apply such techniques to $\sin(x/y)$ in order to perhaps more closely approximate $x \bmod y$.  The analogy I'm looking at is the approximation of $\mid x\mid$ as $\sqrt{x^2 + \varepsilon)}$ where epsilon is some small quantity.  Does a similarly smooth function exist for $x \bmod y$? Find a recurrence relation for the number of ways to arrange $n$ dominoes to fill a $2$ by $n$ checkerboard. I am having trouble with this question, please take a look at it:     Find a recurrence relation for the number of ways to arrange $n$ dominoes to fill a $2$ by $n$ checkerboard.   I have just started reading the topic and it is one of the starting problem. Please help. You can give me some hints, a complete answer is also appreciated.  Thanks #include&lt;iostream&gt; using namespace std;  class A  {    int a;    int b;    public:    void eat()    {       cout&lt;&lt;"A::eat()"&lt;&lt;endl;    } };  class B: public A {    public:    void eat()    {        cout&lt;&lt;"B::eat()"&lt;&lt;endl;     }  };  class C: public A {     public:    void eat()     {        cout&lt;&lt;"C::eat()"&lt;&lt;endl;     }  };  class D: public B, C {  };  int foo(A *ptr) {  ptr-&gt;eat();  } main() {  D obj; foo(&amp;(obj.B)); //error. How do i call with D's B part.  }   The above foo call is a compile time error.  I want to call foo with obj's B part without using virtual inheritance. How do i do that.   Also, in case of virtual inheritance, why the offset information need to be stored in the vtable. This can be determined at the compile time itself. In the above case, if we pass foo with D's object, at compile time only we can calculate the offset of D's A part. Password Protect QGIS project On a shared computer, I have a QGIS project which links up to a PostGIS database that contains my data. If a user wants to access layers from the db, they have to enter the db credentials, so that's OK.   However, I have previously logged on and imported layers from my db into QGIS, and manipulated them in QGIS (styling options based on meta-data, etc.)... Anybody who opens my QGIS project can view these layers in QGIS, and can therefore see the data I wish to be protected in my db.  Is there a way to password protect my QGIS project?