Print number of files excluding directories
script to count files in a directory
I've been using Texmaker for ~5 years now and prefer it over other editors because of its flexibility.   Is there a way to auto-indent LaTeX code in TeXmaker so that the code becomes more manageable ? I'd like to copy files from one external drive to a network connected drive. I want to make sure that there are no errors.  I know of MD5 hash files that I see for large single files that are download from the internet. I also know that I can use the terminal to 'diff' the two sets of files.  However, I'm looking for a piece of software that could confirm that all the files in the file structure have been copied by the finder completely, or a piece of software that would do the copying for me and confirm that all the bits are exactly the same.  The files are video related - and are often over a TB in size (not in one file - complex multi-folder nested files)  I'm fine if there is a terminal command that can do the copy and compare for me as well. (although being able to see the amount of time left on a copy is a very nice feature... additionally, I want to make sure I get ALL of the file - resource forks and all) Is $(B_t^2)$ Markov where $(B_t)$ is Brownian motion? I am pretty sure $(B_{t}^{2})$ not Markov because the squared random walk is not.    I guess I can repeat the method since to be Markov it must satisfy the discrete.  Thanks How to plot an emission spectrum? Consider $X = (a+b)^n-a^n-b^n$  where  $a$ and $b$ and $a+b$ are not divisible by $n$, $n&gt;=3$ is positive and prime, $a \ne b$ and both are greater than 1.  By the binomial expansion we know $X$ is divisible by $n$, but how can we study whether $X$ is divisible by $n^2$ or other powers of $n$? Specifically I am interested to prove $X$ is NOT divisible by $n^2$, but I am not sure how to prove or disprove it. Make flash drive bootable with MULTIPLE Windows Installers I have seen many ways to make a USB an installer for about any Windows OS. But how can I (using grub or something like that) make it bootable to all editions on Windows XP and 7?   I have tried Googling it and researching, I've even tried to do it, But I dont understand much about GRUB or linux at all.  Please keep in mind that I am not very good with linux, so please use as many details as possible. Chain skip happening seemingly at random with a new chain "modified" link in the home page questions list does not contain "?lastactivity" parameter I have just noticed that the "modified" link for  does not contain "?lastactivity" parameter in homepage questions list:        When , it's changing to https://meta.stackexchange.com/questions/253359/list-of-communities-with-base-css-updates-completed/286876#286876 as it should, and showing the deleted answer to those who can see it.  Other questions I checked are not affected. Possible way to reproduce might be question with zero answers, where the "modified" was caused by a now-deleted answer. When you die, what contributes to your "Score"? When you die, 3 things happen.    You swear  A message appears in the chat log describing how you died A "You died" screen appears, with the options to quit or respawn, and a "Score".   What contributes to this score? DNS, multiple nameservers and geolocation? Currently, when a DNS client makes a request for a DNS record (say, www.example.com., it needs to traverse the DNS tree. It asks the root servers for the location of com., which it then asks for the location of example.com., which it then asks for the location of www.example.com.. Thankfully, much of this is cached.  If example.com. has multiple, geographically diverse NS records listed, my understanding is that these are listed in random order to avoid all queries going to the first (or last) NS record listed.  This would appear to imply that a DNS resolver in Australia could choose a NS record for a nameserver that's located far away, perhaps in Europe, when there may be another authoritative nameserver that is much closer.  So, my question is: Is there any provision within the DNS spec to allow DNS resolvers to select an authoritative nameserver that's local to them? The only way I can see to achieve this is to have the NS records behind an anycast address and do local resolution that way. Would this work? Is there any other option? Best method for short time-series Using methods from another class in the main? The following is a geometry puzzle from a math school book. Even though it has been a long time since I finished school, I remember this puzzle quite well, and I don't have a nice solution to it.  So here is the puzzle:    The triangle $ABC$ is known to be isosceles, that is, $AC=BC$. The labelled angles are known to be $\alpha=\gamma=20°$, $\beta=30°$. The task is to find the angle labelled "?".  The only solution that I know of is to use the sine formula and cosine formula several times. From this one can obtain a numerical solution. Moreover this number can be algebraically shown to be correct (all sines and cosines are contained in the real subfield of the 36th cyclotomic field). So in this sense I solved the problem, but the solution is kind of a brute force attack (for example, some of the polynomials that show up in the computation have coefficients > 1000000). Since the puzzle originates from a book that deals only with elemetary geometry (and not even trigonometry if I remember correctly) there has to be a more elegant solution. How to secure recommendations and apply for PhD after having worked outside of academia for two years? i want to write a device driver but not able to find the header file can someone please help me find them?Also if someone can point out some important site links that would be really appreciated I would like to remove selected commit log entries from a linear commit tree, so that the entries do not show in the commit log.  My commit tree looks something like:  R--A--B--C--D--E--HEAD   I would like to remove the B and C entries so that they do not show in the commit log, but changes from A to D should be preserved. Maybe by introducing a single commit, so that B and C become BC and the tree looks like.  R--A--BC--D--E--HEAD   Or, ideally, after A comes D directly. D' representing changes from A to B, B to C and C to D.  R--A--D'--E--HEAD   Is this possible? if yes, how?  This is a fairly new project so has no branches as of now, hence no merges as well. How do I execute a program X times in the terminal?  I read that I have to do a bin/bash txt, but I don't know how to execute this X times. Visa for transit in Seoul To prove the convergence of the p-series   $$\sum_{n=1}^{\infty} \frac1{n^p}$$  for $p &gt; 1$, one typically appeals to either the Integral Test or the Cauchy Condensation Test.  I am wondering if there is a self-contained proof that this series converges which does not rely on either test.    I suspect that any proof would have to use the ideas behind one of these two tests. How to wrap lines in a jtable cell?