bibtex when using subfiles package Edit:  This question is actually a duplicate of . It's solution worked for me.    Basically, I want to do what  is doing, but using bibtex instead of biblatex.   To summarize what it's doing there, I want a single .bib files to store the bibliography entries for an entire document. When I run a section file (ie. not the main.tex), it cannot find the Sources.bib and so fails to make the reference. If I run main.tex though, the reference that is inside the section file resolves perfectly fine.  For a minimum working example (it doesn't run correctly, but it gives you the idea), see below.  So I have the following file structure:  project_dir |    main.tex |    background.tex |    Sources.bib   Inside main.tex, I have:  %%%% main.tex %%% \documentclass[10pt]{ClemsonThesis} \usepackage{amsmath} \usepackage{subfiles}  \begin{document} % blah blah blah  \subfile{background.tex}  \bibliographystyle{plain} \bibliography{Sources} \end{document}     %%% background.tex %%% \documentclass[main.tex]{subfiles}  \begin{document}  %blah blah blah Here's some random text I have in a few paragraphs. Here's a citation for referencing an external resource: \cite{McCormack2012}.  \end{document}     %%% Sources.bib %%% @Inbook{McCormack2012, author="McCormack, Percival", title="The Vortex", bookTitle="Vortex, Molecular Spin and Nanovorticity: An Introduction", year="2012", publisher="Springer New York", address="New York, NY", pages="1--65", abstract="The first notable works on fluid motions appeared in the early seventeenth century. Descartes in his ``Principia Philosophiae'' (1644) considered that space was filled with frictional vortices, so that the planets are carried along by the vortex motions. Vortices had fascinated mankind for many centuries before Descartes. It was considered that life had started in the water of the primeval vortex -- in whirlwinds and whirlpools.", isbn="978-1-4614-0257-2", doi="10.1007/978-1-4614-0257-2_1", url="https://doi.org/10.1007/978-1-4614-0257-2_1" }   Using the files below, if I compile background.tex, the bibtex reference fails. If I run main.tex, the bibtex reference that is in background.tex resolves perfectly fine.  I've tried adding \bibliography{Sources} to the end of the background.tex file, but got nothing.
Handle .bib in subfiles I have a problem very similar to the question being asked in  . My .bib is references in main.tex. When compiling main, everything works like a charm. Working on the subfiles, I have two issues though (which are most likely related):   I can't access the bib with auto-completion When compiling the subfile, it doesn't insert the citations.   I tried including  \bibliographystyle{plainnat} \bibliography{mybib}   in the subfiles, which also worked smoothly. Obviously, the bibs are included in every chapter of the document when compiling main.tex, then. I tried setting a global boolean in main.tex:  \newboolean{printBibInSubfiles} \setboolean{printBibInSubfiles}{false}    and in the subfiles:  \ifthenelse{\boolean{printBibInSubfiles}}    {}    {\bibliographystyle{plainnat}     \bibliography{../betterbib.bib}}    For some reason, then setting the boolean to false, the "bibliography"-header was printed in the subfiles as well as for the main file, but there was no output of citations under any of the "bibliography"-headers. Furthermore, compiling only the subfiles didn't work correctly.  My document structure is the following:  main.tex:  \begin[document] ... \subfile{sub/dataprocessing} ... \bibliographystyle{plainnat} \bibliography{mybib} \end{document}   the subfiles:  \documentclass[../main.tex]{subfiles} \begin{document} ... \cite{Random2014} ... \end{document}   After all this explanation: the only thing I want is to access the .bib from the subfiles without having to manually uncommenting something when compiling the main file. Any takers?  PS: Obviously, I also tried the solution provided in "" but couldn't get it to work. I don't know whether that would solve my problem anyway, since I don't have the \printbibliography-issue of the thread opener.
Examples of infinite groups such that all their respective elements are of finite order. I am in need of examples of infinite groups such that all their respective elements are of finite order. Prove $\gcd(a,b,c)=\gcd(\gcd(a,b),c)$ for $0\ne a,b,c\in \Bbb{Z}$. I tried solving it with sets but I sense there are some details I am missing. I would truly appreciate your reference. Is $\sum_{k=1}^{n} \sin(k^2)$ bounded by a constant $M$? I know $\sum_{k=1}^{n} \sin(k)$ is . How about $\sum_{k=1}^{n} \sin(k^2)$? Roll back from OS X Mavericks ( or any newer OS) to Mountain Lion I installed the developer preview of OS X Mavericks, &amp; too many things broke. I can't stay on it &amp; need to roll back to Mountain Lion. Any ways of doing that? Please help!  I originally installed Mountain Lion &amp; Mavericks through the Mac App Store. Is there any anti-gravity material? I want to know if there is any  material. I am thinking of making flying vehicles which are made up of anti-gravity material so that they will not experience any gravity on them and can easily take off and be more fuel efficient. Is there any such thing? Or any workaround? I may have missed it with the 3D, but I could have sworn I saw what I suspect was a lady Dwarf or two running from the Erebor in the beginning of the Hobbit, but they didn't seem bearded.    If dwarf women aren't bearded, then was Aragorn just kidding in the Two Towers (movie) when he intimated that they all had beards?    It's also stated by Tolkien in appendix A to The Lord of the Rings that female dwarves appear identical to males and we can assume they are also born with beards, just like their male counterparts. $(a^{2^n}+1,a^{2^m}+1)=1 or 2$ Prove that if $m\not =n,a$ are positive integers then $(a^{2^n}+1,a^{2^m}+1)$ is $1$ if $a$ is even and $2$ if $a$ is odd.    I solve the problem in the following way: I assume that $m&gt;n$ then  $$a^{2^m}+1=a^{2^m}-1+2$$ With this expression if I take a divisor prime $p$ of $a^{2^n}+1$ then if $p|a^{2^m}+1$ this prime must divide 2 and the result follows.   But, how can I prove this statement without use of primes? This exercise appears before the concept of prime is introduced then I prefer do not use it.    Any idea?   Thanks! I used the OzTeX implementation of TeX, also I used to typeset my docs in plain TeX, not LaTeX for me, so I had no problem to insert an image using the OzTeX, now I'm back to TeX docs, am using the TeXWorks frontend, but I can't insert an .eps image file, it seems the \includegraphics macro its only for LaTeX, so I can't use it, any idea on how to insert an image when using plain TeX? Create Case thread Id using Apex (SOQL limit-proof) There are many posts about creating Case threadIds with Apex, notably   As the posters have noted, the SFDC rules of the threadId are subject to change over time and the only reliable way that I've seen is to do   // To be replaced with a real case Id. Id caseId = '500c0000008kJL5';   List&lt;Messaging.RenderEmailTemplateBodyResult&gt; renderResults =   Messaging.renderEmailTemplate(null, caseId, new List&lt;String&gt;{'{!Case.Thread_Id}'});  System.debug('this is the Case Thread Id: ' + renderResults[0].getMergedBody());   HOWEVER ... The method call Messaging.renderEmailTemplate burns a SOQL ()  So you can't prepopulate your Cases in an afterInsert or beforeUpdate Trigger because a transaction can be up to 2,000 (Platform Events), up to 10,000 (direct Apex DML) or more, typically, 200 rows.  All of these are > 100 SOQL limit.     So, before I go to the trouble of doing this in a chained set of async   tasks; is there more recent thinking on this subject of creating ThreadIds? I have used so many things like url removal request and deleted the pages etc., but still the errors are shown in my webmaster tools.  How can I remove the urls completely from Google? I've seen videos of some folks having several armor sets (4 is the most I've seen so far) standing about on their settlement. I'm wondering if having too many would cause some sets to disappear. They're not like guns/items that you can safely store in settlement crates, the suits kind of just... stand around. (I know there's the extra step of taking out the fusion cores, so that NPC's don't use them.)  Is there a limit to the number of Power Armor sets you can keep? Alignment issue in 'Your Sites' section in the Android app There is some unwanted extra spaces in between each site in the Your Sites section.  Steps to reproduce:   Touch the Nav Icon in the left top corner Touch the EDIT link in YOUR SITES Scroll the screen; there is unwanted spaces in between the each site   For reference I recorded the same:    Configurations:   App Version: 1.0.85 Device Manufacturer: Motorola Device Model: XT1033 OS Version: 5.1 (2) What is a good introductory book on quantum mechanics? I'm really interested in quantum theory and would like to learn all that I can about it. I've followed a few tutorials and read a few books but none satisfied me completely. I'm looking for introductions for beginners which do not depend heavily on linear algebra or calculus, or which provide a soft introduction for the requisite mathematics as they go along.  What are good introductory guides to QM along these lines? What are logic gates? So from what I understand transistors are one of the most important electronic elements for computers because of TTL (Transistors-Transistors Logic).  Is this true? If so, how exactly does this work? I have heard the terms "logic gate" and "logic block" tossed around. Teleporting a player from the overworld to the end Is there any way to teleport a player from the overworld to the end?   Or a way of teleporting a player to a random enderman in the end? I'm trying to recover a Windows system from backups and can't seem to find where Chrome saves its bookmarks.   Does anybody know where Chrome saves its bookmarks on Windows? Does OpenSSH support multihop login? Ansible uses OpenSSH as the bottomed network communicative implementation, but does it support multi-hop login?   I mean, if Ansible can login a server directly, but can it log in server_a then from server_a login server_b for config the server_b? Removing the password from a PDF file I have a couple of ebooks as PDFs with passwords, however my ebook reader (sony prs600) doesn't seem to support PDFs with passwords.  What is the easiest of removing the password from a PDF (I know the password, which presumably helps a lot).  It's a bit annoying buying a book and then only being able to read it in front of a computer. Parenthesis vs brackets for matrices When I first learned linear algebra, both the professor and the book used brackets like [ and ] to enclose matrices. However, in my current differential equations textbook, matrices are enclosed by parenthesis, and I suddenly realize everybody else are using them too.  So are brackets/parenthesis for enclosing matrices always totally interchangeable? I am reading the Dummit and Foote's proof of Cauchy's theorem for abelian groups. On the highlighted line, how do you conclude from $y\notin N$ and $y^p\in N$ that $\langle y^p \rangle \neq \langle y \rangle$ and that $|y^p|&lt;|y|$?     Proposition 21.   If $G$ is a finite abelian group and $p$ is a prime dividing $|G|$, then $G$ contains an element of order $p$.      Proof:   The proof proceeds by induction on $|G|$, namely, we assume the result is valid for every group whose order is strictly smaller than the order of $G$ and then prove the result valid for $G$ (this is sometimes referred to as complete induction).   Since $|G| &gt; 1$, there is an element $x \in G$ with $x \neq 1$.   If $|G| = p$ then $x$ has order $p$ by Lagrange’s Theorem and we are done.   We may therefore assume $|G| &gt; p$.      Suppose $p$ divides $|x|$ and write $|x| = pn$.   By Proposition 2.5(3), $|x^n| = p$, and again we have an element of order $p$.   We may therefore assume $p$ does not divides $|x|$.      Let $N = \langle x \rangle$.   Since $G$ is abelian, $N \trianglelefteq G$.   By Lagrange’s Theorem, $|G/N| = |G|/|N|$ and since $N \neq 1$, $|G/N| &lt; |G|$.   Since $p$ does not divide $|N|$, we must have $p \mid |G/N|$.   We can now apply the induction assumption to the smaller group $G/N$ to conclude it contains an element $\bar{y} = yN$, of order $p$.   Since $y \notin N$ ($\bar{y} \neq \bar{1}$) but $y^p \in N$ ($\bar{y}^p = \bar{1}$) we must have $\langle y^p \rangle \neq \langle y \rangle$, that is, $|y^p| &lt; |y|$.   Proposition 2.5(2) implies $p \mid |y|$.   We are now in the situation described in the preceding paragraph, so that argument again produces an element of order $p$.   The induction is complete.      (Original image .)