I am creating an anthology of poems and songs, and have a main file where I am using \input to insert separates TeX files which contain the poems.  I was wondering if there was a simpler way of inserting all of the files in alphabetical order based on filename instead of a separate \input for each file?  Could anybody help?    Thank you to for pointing me in the direction of the other questions - they didn't come up when I googled my queries. I am trying to adapt the code in  but I am getting 2 errors from it. My code is as follows at the moment  \documentclass{minimal}  \makeatletter% \def \app@exe {\immediate\write18}  \def \inputAllFiles [#1]{%   \app@exe{cmd /c dir /b *.tex &gt; \jobname.tmp}   \InputIfFileExists{\jobname.tmp}{}{}   \AtEndOfDocument{\app@exe{rm -f #1/\jobname.tmp}}} \makeatother%  \begin{document}  \inputAllFiles{.}  \end{document}   The errors messages I am getting are both on the line with the \inputAllFiles command and say: Use of \inputAllFiles doesn't match its definition and Too many }'s.  I have tried fiddling around with the code, but noting I seem to do helps. Could anybody help to see where I am going wrong?
Assume I have many TeX files. For the sake of simplicity, also asssume they are in a single folder or directory.  I want to input all files from within my main LaTeX document. Actually I can create a list of those files using C# in advance.  To enrich my view about LaTeX or TeX, could you tell me whether or not this job can be done only by using pure TeX or LaTeX?
The formal solution of the time-dependent Schrödinger equation Consider the time-dependent  (or some equation in Schrödinger form) written down as $$ \tag 1 i \partial_{0} \Psi ~=~ \hat{ H}~ \Psi . $$ Usually, one likes to write that it has a formal solution of the form $$ \tag 2 \Psi (t) ~=~ \exp\left[-i \int \limits_{0}^{t} \hat{ H}(t^{\prime}) ~\mathrm dt^{\prime}\right]\Psi (0). $$ However, this form for the solution of $(1)$ is actually built by the method of successive approximations which actually returns a solution of the form $$ \tag 3 \Psi (t) ~=~ \hat{\mathrm T} \exp\left[-i \int \limits_{0}^{t} \hat{H}(t^{\prime})~\mathrm  dt^{\prime}\right]\Psi (0), \qquad t&gt;0, $$ where $\hat{\mathrm T}$ is the time-ordering operator.  It seems that $(3)$ doesn't coincide with $(2)$, but formally $(2)$ seems to be perfectly fine: it satisfies $(1)$ and the initial conditions. So where is the mistake? What kind of node is this?    Image from this How to copy modifiers with attribute values from active object to selected objects with python scripting? I am creating a controller for a 12 V system using an Arduino Uno microcrontroller. For the outputs I am using a relay shield to switch the 12 V components. I have a 12 V toggle switch that turns on some 12 V components in the system and I want to use a trigger signal off of this same switch to send to an Arduino digital input. I know that the Arduino can only handle 5 V max. What would be the best way to step down the 12 V coming off of the switch to the 5 V for the input?  EDIT: The system is for use in a car. Would the amperage of the car battery need to be lowered somehow as to not blow up the components? 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;     } } Rich Snippets not working (and working at the same time?) We have an eCommerce site, and we have had rich snippets implemented (in JSON-LD) since January/February this year (2015). I have read multiple sources (including the Google documentation) and there seem to be three possibilities why they are not showing:   Not enough time has passed (4-12 weeks seems to be the common time quoted) The markup is wrong Google have decided not to show the data   I can rule out the first given the amount of time. The second I am fairly confident is not the case as I have used multiple testing tools. As for the third … well that's anyone's guess (although the study  suggests that MOST shops should be successful).  A strange note is that the rich snippets do not show on a regular search for our ranking keywords (we rank #1 for a few and page 1 for the majority). However the rich snippets DO show when we search for a ranking keyword + site:www.fridgefreezerdirect.co.uk as show here:    I have done this in an incognito window in the browser and using a VPN with the same results.  Can anyone suggest anything we can do or reasons this may be? Is there a single word that describes both Witches and Wizards? In the Harry Potter world, there's the term "muggle" for people with no magical abilities, "muggle-born" for those with magical abilities who's parents are muggles and "squib" for those with no magical abilities who's parents are magical.  But is there any collective term for all magical people (as opposed to wizards for males and witches for females)?  I don't recall seeing any word that refers to all men and women and children with magical abilities, and it's the only group left without noun or collective noun to describe them. Is it acceptable to use "Just wondering" as a question? I often find myself writing sentences such as: "I am wondering if the landlord replied to you yet?"  And I always end up removing the question mark and rephrasing the sentence. In speech it is easy to inflect such a sentence so as to infer that it is a question, but in reality "I am wondering" is a statement and I feel it should not have a question mark when written down.  So is it acceptable to use "I am wondering" as a question? How do I rename all folders and files to lowercase on Linux? I have to rename a complete folder tree recursively so that no uppercase letter appears anywhere (it's C++ source code, but that shouldn't matter).  Bonus points for ignoring CVS and Subversion version control files/folders. The preferred way would be a shell script, since a shell should be available on any Linux box.  There were some valid arguments about details of the file renaming.   I think files with the same lowercase names should be overwritten; it's the user's problem. When checked out on a case-ignoring file system, it would overwrite the first one with the latter, too. I would consider A-Z characters and transform them to a-z, everything else is just calling for problems (at least with source code). The script would be needed to run a build on a Linux system, so I think changes to CVS or Subversion version control files should be omitted. After all, it's just a scratch checkout. Maybe an "export" is more appropriate. Using one group separator for integer part and another for decimal part (siunitx) I thought I was able to do something like this before, but I can't find my solution.  I would like to format my large numbers as follows:   12,504.3124 2359 3   I know I can use siunitx to partially set this up, but I'm not getting the results I want:  \documentclass{article} \usepackage{siunitx}  \newcommand\aenumA[1][4]{%%   \num[group-separator={,},        group-digits=integer,        ]}  \newcommand\aenumB[1][4]{%%   \num[group-digits=decimal,        ]}  \pagestyle{empty} \begin{document}    \aenumA{12504.312423593}    \aenumB{12504.312423593}  \end{document}   I would like a hybrid solution (commas in the integer part and spaces in the decimal).  I would actually also like to be able to group differently between the two: every three digits in the integer part, every four digits in the decimal part.  Is there a straight-forward way to do this with siunitx?  Or, do I need to split the number at the decimal and treat the two parts separately and then glue them back together? Grant the OP a binding close as duplicate vote Since the  to the close as duplicate mechanism it is a lot more visible to the OP that there is/might be a duplicate to their question. Empirically, I've noticed a lot more people agreeing, in the comments under their question, that their question is a dupe.   For instance, :        I'm aware that allowing  is  (back in the stone age) but now Stack Exchange is so much larger, and Stack Overflow is groaning under the weight of questions, I think this should be partially revisited.  Based on the principle that the simplest way to keep a site clean is to have as many people as possible nibbling away, I propose that the OP gets granted a binding close-as-duplicate vote.  It should simply be an additional line in the banner, which is . It might be something like this:     This question may already have an answer here:   &nbsp; "" 3 answers   &nbsp; Does this fully answer your question?  Yes / No   I'm not wedded to the Yes / No thing I just can't think of a better way at the moment.  Clicking on Yes would take the OP to the close as duplicate dialogue with that question highlighted. If there are multiple duplicate questions you'd need to ask the OP multiple times. A No could be used to track the relative success of the project, i.e.   Whether the question subsequently gets closed. Whether the question gets reopened again. How many times the OP actually clicks. How many times the OP disagrees with the analysis of the community.   Potentially, a No could be used to open a comment dialogue asking the OP to explain why they think their question is not a duplicate thereby stopping them simply putting "this is not a duplicate" in the question and formalising this process somewhat. Not sure about this idea...  I do not think this should be restricted by reputation, anyone should be able to close their own question as a duplicate. It gives people with lower reputation a more positive experience of the closing process and emphasises the importance of duplicate finding.  Most importantly, self-closes should not, initially, count towards the question ban. We can help new users learn how to use a lot more of the site than they might otherwise see and encourage them to search for duplicates more thoroughly. If the OP then goes on to do the same thing 10 times in a row then you can start using it toward the ban as they're obviously using the users as a personalised search service but at least the first 3-4 times this should not have any effect.  This question is, deliberately, only requesting 20% of the linked question (from 2009) and then only based on the new UI. The linked question asks for binding migration votes etc, which I do not want to see and I am not requesting a binding close-as-duplicate for the OP until someone else has already voted to close (though I think if the OP has 3k rep this might be allowable). This, I hope, addresses the concern's raised in the linked question and explains why this is not a duplicate of that question. How do I use a particular font for a small section of text in my document? The standard font packages make global changes to the fonts in my document. What if I want to use a particular font for just a portion of my text?   How do I find the right name of the font? How do I select the font? How do I restrict the scope of the font change?     There are separate answers for different flavors of TeX (quick links): Can anyone hint me to prove:  $\forall n\in \mathbb{N}: \exists$ Fibonacci numbers $ F_{i_1},\ldots,F_{i_k}$ such that: $$\sum F_{i_k}=n$$    Note: Every Fibonacci number can appear only once. Thanks Limit of a sequence defined by recursive relation : $ a_n = \sqrt{a_{n-1}a_{n-2}}$ Headers of \chapters* take the headers of their previous \chapter When using book.cls and using \chapter* after a \chapter, the header used in \chapter* is wrong. An example is pasted below.   Is there any known workaround for that? I have tried quite some tricks without success.   \documentclass[]{book}  \begin{document}  \chapter{First Chapter} aslkjdf  \chapter*{Unnumbered Chapter} The GNU General Public License is a free, copyleft license for software and other kinds of works.  The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.  When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.  To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.  For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.  Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.  For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.  Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.  Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.  The precise terms and conditions for copying, distribution and modification follow.  \end{document} If $\lambda_{max} = n$, then $n\times n$ positive, reciprocal matrix A is consistent At the end of . the author states that  Suppose we have $n \times n$ matrix $A$ having only positive elements and satisfying the property $a_{ij}=1/a_{ji}$ (a matrix satisfying this property is called a reciprocal matrix).  If its largest eigenvalue $\lambda_{max}$ is equal to $n$, then the matrix $A$ satisfies the property (consistency property) $a_{ij} a_{jk} = a_{ik}$ where $i,j,k=1,2,...,n$.  I'm not convinced this theorem is true. Could anyone help? fatal: bad ownership or modes for chroot directory component "/" in SFTP I've been trying to configure sftp in a debian server.sshd_config:  Subsystem sftp internal-sftp  UsePAM no  Match User sftpUser ChrootDirectory /users/sftp/sftpUser ForceCommand internal-sftp AllowTcpForwarding no X11Forwarding no   Directories:   drwxr-xr-x   3 root      root      4096 Oct 20 10:59 users   drwxr-xr-x   3 root      root      4096 Oct 20 11:00 sftp   drwxr-xr-x   2 root      root      4096 Oct 20 11:00 sftpUser   cat /var/log/auth.log  Oct 20 10:58:22 w1 sshd[24634]: Accepted password for sftpUser from 201.156.103.213 port 34106 ssh2 Oct 20 10:58:22 w1 sshd[24636]: fatal: bad ownership or modes for chroot directory component "/"   sftpUser no home, bin/falseand member of user group.  In the client side I'm getting the famous Write failed: Broken pipe and then the connection is dropped.  Commenting the ChrootDirectorycommand in sshd_config makes the connection, but get's the user loose.  What am I doing wrong ? CSS - Make divs align horizontally I have a container div with a fixed width and height, with overflow: hidden.  I want a horizontal row of float: left divs within this container. Divs which are floated left will naturally push onto the 'line' below after they read the right bound of their parent. This will happen even if the height of the parent should not allow this. This is how this looks:  ![Wrong][1] - removed image shack image that had been replaced by an advert  How I would like it to look:  ![Right][2] - removed image shack image that had been replaced by an advert  Note: the effect I want can be achieved by using inline elements &amp; white-space: no-wrap (that is how I did it in the image shown). This, however, is no good to me (for reasons too lengthy to explain here), as the child divs need to be floated block level elements. How to use the SSD for caching in Windows without Intel Smart Response? My motherboard is Asus P8B75-M. It doesn't have Intel Smart Response. But recently I bought a SSD. Since I mostly use linux I have Linux installed in it. But can I use it to speed up Windows also? How? I don't have Smart Response... (I run Windows 8.1). The SSD is only 64GB. Is it correct to hyphenate with compound premodifiers? If so, where is the hyphen placed? For example, "file system" and "related". Is it "file system-related"? It will appear as if it is a compound of "file" and "system-related", won't it?