find . -type f -print0 | xargs -0 ls -ltr | head -n 10 | awk '{print $NF}' | xargs rm   This command is giving me this:  xargs: 'ls' terminated by signal 13   However, it's executing fine. It's supposed to delete the 10 oldest files on the specific folder. Is there something to worry about? Is there a fix?  Server is running BuildRoot.
I have a directory with ~1M files and need to search for particular patterns. I know how to do it for all the files:  find /path/ -exec grep -H -m 1 'pattern' \{\} \;   The full output is not desired (too slow). Several first hits are OK, so I tried to limit number of the lines:  find /path/ -exec grep -H -m 1 'pattern' \{\} \; | head -n 5   This results in 5 lines followed by  find: `grep' terminated by signal 13   and find continues to work. This is well explained . I tried quit action:  find /path/ -exec grep -H -m 1 'pattern' \{\} \; -quit   This outputs only the first match.  Is it possible to limit find output with specific number of results (like providing an argument to quit similar to head -n)?
How to install the most common plugins? Let $R$ be a ring (unital, not necessarily commutative), $M$ a finitely presented left $R$ module. Suppose $m_1,\ldots,m_n\in M$ generate $M$. This determines a surjection $f:R^n\to M$.     Must the kernel of $f$ be finitely generated?   This is true by definition if the generating set $m_1,\ldots,m_n$ is the one coming from the finite presentation of $M$. For what real values of $a$ does $\sum_{n=1}^{\infty}{(\frac{an}{n +1})^n}$ converge? For what real values of $a$ does the series $$\sum_{n=1}^{\infty}\left(\frac{an}{n +1}\right)^n$$ converge?  At first, I wanted to do the root test, but the problem is that $a$ could be negative.  If I take it out of the fraction to get $$\left(\frac{a}{n+1}\right)^n$$ it doesn't meet the criteria of either the Dirichlet or the Abel tests. the cone is contractible What is the meaning of p values and t values in statistical tests? I am running an HP pavilion dv6000 dual boot win7 and Ubuntu 12.04. (well, up until today).  After a reboot, the boot process drops to the BusyBox shell and I end up at the prompt:  BusyBox v1.18.5 (Ubuntu 1:1.18.5-1ubuntu4) built-in shell (ash) Enter 'help' for a list of built-in commands.  (initramfs)   I've been researching others who have had this same problem, but haven't been able to find any of those solutions to work for me.  I tried the method described , and after the final command   mount -t ntfs-3g /dev/sda1 /root -o force   it does nothing and gives me another (initramfs) prompt.  I can boot to a live CD (USB) and get to a terminal, but it doesn't seem to do much good, as I can see the /dev/sda1 in the ls command, but it doesn't recognize it when I try to cd to it.  One more question: using the command fdisk -l how can I tell which mount point (sda1/sda2) is my windows partition and which one is Ubuntu? $(X,\tau)$ needs to be $T_1$ in order to guarantee that $A'$ is closed? Claim: If $(X,\tau)$ is not $T_1$ then $A'$ is not necessarily closed for any $A$.  Proof: Here is an example. Take $X=\mathbb{N}$ and let $\tau=\lbrace u\subset\mathbb{N}\mid 1\in u\iff 2\in u\rbrace$. Let $A=\lbrace 2,3 \rbrace$. Since any open set containing $1$ also contains $2$ it follows that $1\in A'$. Hence $\overline{A}=\lbrace1,2,3\rbrace$, as it is the smallest closed set containing $A$. But  $X\setminus A'=\mathbb{N}\setminus\lbrace 1\rbrace$ is not open because it contains $2$ and not $1$. The set of accumulation points $A'$ is not closed.  So, in general, trying to prove that $A'$ is closed in a topological space is an effort in futility? Get month name from Date Windows Logs Application is full of "Login failed for user 'sa'. Reason: Password did not match that for the login provided. [CLIENT: ****]" I have Windows Server 2016, with SQL Server 2017, and found Windows Log Application is full of Login failed messages (as follows) :     Login failed for user 'sa'. Reason: Password did not match that for the login provided. [CLIENT: ****]    Client's IP addresses are various. I don't have any maintenance plan in SQL Server     What's the problem? Split seeds.rb into multiple sections? Number of solutions of $x_1+2x_2+\cdots+kx_k=n$? Suppose $n$ be a given positive integer. Then the Diophantine equation $x=n$ has only $1$ solution. Just by inspection, I found that the Diophantine equation $x+2y=n$ has $\left\lfloor \dfrac{n}{2}+1\right\rfloor$ non-negative solutions for $(x,y).$ Also, according to  the Diophantine equation $x+2y+3z=n$ has $\left\lfloor \dfrac{n^2}{12}+\dfrac{n}{2}+1 \right\rfloor$ non-negative solutions for $(x,y).$  Is there any closed form for the number of non-negative integer solutions for $(x_1,x_2,\cdots,x_k)$ of $$x_1+2x_2+3x_3+\cdots+kx_k=n$$ for a given $k\in\Bbb{N}$? How can I prove these formulas rigorously?  EDIT After a very tedious calculation I found that the equation $w+2x+3y+4z=n$ has  $\left\lfloor \dfrac{n^3}{144}+\dfrac{5n^2}{48}+\dfrac{(15+(-1)^n)n}{32}+1 \right\rfloor$ solutions. This solution completely agree with the approximation given by Rus May. However still I believe that we can do something more than this. calculating resistance for LED strips to use as parking lamps and turn signals I'm installing LED strips in my car's tail lamps to convert it from conventional bulbs to LEDs. I have a understanding of what I'm doing but not the complete knowledge to make the circuit work correctly without doing some guessing so I figured I would ask here.   I'm planning on working with and I need a length of 16", 15" and 14" to make then look correct in my housings. When I did the math the 19.7" strips have about 1.5 LEDs per inch and need to be segmented into 3 LED groups so I may have to get creative with the placement.   Ffom what I understand I need 2 diodes and a resistor. One diode on the parking lamp power, and one on the turn signal/brake power and then a resistor on the parking lamp  wire to step down the voltage enough to make them dim enough to use as a parking lamp and distinguish it from the brighter turn/brake lamps.  Does anyone know what size resistor and what size diode to use in this project? The voltage, with the car running, is around 13.8V to the rear lamps. I figure it should be running around 7V to the LEDs to light them as parking lamps.  Also will leaving out a cluster of 3 LEDs change the strips intensity to where I'll need different resistors for each strip? Let $P(z)=a_0+a_1z+\cdots+a_nz^n$ be a polynomial whose coefficients satisfy $$0&lt;a_0&lt;a_1&lt;\cdots&lt;a_n.$$  I want to show that the roots of $P$ live in unit disc. The obvious idea is to use Rouche's theorem, but that doesn't quite work here, at least with the choice $f(z)=a_nz^n, g(z)=$ (the rest).  Any ideas? Here's :        At the moment, the latest entry there is October 13, which would be mistaken to mean October last year (2012), but it actually is October 2010. This applies to all the filters in the activity tab. A friend offered me a brain teaser to which the solution involves a $195$ pound man juggling two $3$-pound balls to traverse a bridge having a maximum capacity of only $200$ pounds. He explained that since the man only ever holds one $3$-pound object at a time, the maximum combined weight at any given moment is only $195 + 3=198$ pounds, and the bridge would hold.  I corrected him by explaining that the acts of throwing up and catching the ball temporarily make you 'heavier' (an additional force is exerted by the ball to me and by me onto the bridge due to the change in momentum when throwing up or catching the ball), but admitted that gentle tosses/catches (less acceleration) might offer a situation in which the force on the bridge never reaches the combined weight of the man and both balls.  Can the bridge withstand the man and his balls? Almost all passports I have seen have a place of birth field on them. For instance, on the US Passport,    Is there a specific reason to this? Where has all the RAM gone? back-up: which patitions to back-up before upgrading/reinstalling I have Ubuntu13.04 on my laptop. I have to upgrade it to the next release or else I would install a fresh release after deleting my current system.  I have already installed and configured my current system a lot and I can't take the burden of doing it all over again if I install the next release. Now I would like to know that what all back-ups are required to be taken beforehand so that I would recover all my files/installations/configurations etc. In other words I should have everything on my new system (simply by restoring from back-ups) that I possess currently.  My current system has /, /boot, /home &amp; swap partitions which were created by me when I had freshly installed the O.S. I have a TECNO Spark 2 running on Android 8.1 Oreo (Go Edition). Every time I try to install apps that require notification access, it says that the feature is not available.  How to fix it? Search All Fields In All Tables For A Specific Value (Oracle)