I need a script I can call in crontab that equates out to ---   find all files &lt; 1 week old | rm files.   I use macrium reflect free edition to back up my windows machines to a samba share dedicated to macrium. But the free edition doesn't come with the ability to delete files older then a week and therefor my drive will eventually fill up or require constant monitoring. I would like to learn how to do this, not just to continue using free Reflect (It's so good I'm just waiting till I can afford a 4 pack @ 140$) but so I can use it for other purposes as well. Any Ideas?  Its tricky because It cant say anything older then April 5th, as that's useless in a week, it needs to be a mathematical equation in the command like, find all files &lt; 1 week old | rm files.  Thanks for your time...  Donut
By the time, many files are still on my system and I don't need them anymore, so how to delete all files that are one year old at least?
Expanding the equation out gives  $(3^{2n}\times3)+(2^n\times2^2) \equiv 0\pmod{7}$   Is this correct? I'm a little hazy on my index laws.  Not sure if this is what I need to do? Am I on the right track? Got French Schengen visa but no "VIS" after giving fingerprints Use counter before its value is set I'd like to use a counter in the text which however is only set at a later point. Like so:  \newcounter{howmany} There are \thehowmany items in this list: \begin{enumerate}   \item one   \item two   \item three \setcounter{howmany}{\theenumi} \end{enumerate}   And it should say "There are 3 items in this list". But that doesn't work. Well, sure. I need to use \refstepcounter to get that save-functionality. But \refstepcounter only increments it by one, and there doesn't seem to be a \refsetcounter ;) Any suggestions? A loop after the enumerate over \refstepcounters? Redefining \item to include \refstepcounter? There gotta be a simpler way, no?  Thanks! When applying for post-doctoral and faculty positions you are typically asked for three (sometimes more) reference letters to support your application.    Given that it is competitive out there, it also makes sense to apply for all positions that are good matches to your qualifications and career development goals (in the case of post-docs).  Sometimes this may mean asking for several reference letters (or pre-application "can you support me if required?" requests) in a short space of time.  Also, there may only be a small pool of people (i.e. 3 or 4) who know your work sufficiently well to give an excellent reference.  I have also been told that referees want to help you out, and that there is no reason to fear asking them.  And, that in many cases once a letter is written it can typically be quickly repurposed.  But there must be a breaking point.  How do I manage this without being disrespectful?  How many requests in a given unit of time is too many, or harms my credibility?   I am asking this question in this forum, as I am interested in the norms in the academic world, which are often somewhat different than the rest of the working world. Is my processor 64 or 32 bit? Line of Bones to Travel and Conform to Curve (Train or snake following path) I've searched google extensively on this. Can't seem to find an answer.   I know about spline IK, which is wonderful for conforming a row of bones to a path. But combining the armature object with a follow path modifier causes the point of origin to move, but the bones themselves stick to the beginning of curve.   Ultimately my goal is to make a creature like a snake or centipede follow a curve path, thus animating it fairly realistically ... How do I create an internet shortcut within a folder? The bottom bracket of my bike was completely stripped to the point that when you push the left side crank arm, the right crank moves and you can see the bottom bracket lock move out the frame. The bike shop tried putting Teflon tape but it's temporary. It's a 26' xc hard tail. For all I know both sides of the bottom bracket(square tapered) are stripped clean hence the Teflon tape put by the previous owner. Can I fix the problem by changing into a hallow tech cranks because it works like a thread less bb, or should I just buy a thread less square tapered bb? Any suggestion on what to do? How to read negative radians in the interval? Say a function's domain is $\{-\pi/2, \pi/2\}$. How should I interpret this interval?  It starts from where? To where? In what direction?  And if it starts from $3\pi/2$, would the next one be $-5\pi/3$.(because it starts from negative, $-\pi/2$). Let $F$ be a field and $x\in F$. If $x=-x$ and $1\neq -1$, then $$0=\frac{x+x}{1+1}=\frac{1+1}{1+1}x=x.$$ This means that the statement in the title is true if and only if $1\neq -1$. But how do we know that $1\neq -1$ for an arbitary field? How does one create a custom application launcher for Wine installed apps? Computing $ \int_0^{\infty} \frac{ \sqrt [3] {x+1}-\sqrt [3] {x}}{\sqrt{x}} \mathrm dx$ The plugin generated X characters of unexpected output during activation (WordPress) Is there any benefit of creating model in one piece or I can create separate pieces and just overlap them to create a visually joint part.  For example, the below image were made from two parts 1. Blade 2. Spinner  Is there any benefit to model them (e.g. extrude from the spinner) or it is actually ok to have them separated since visually I can achieve the same effect (See picture 2) When should one use final for method parameters and local variables? I've found a couple of references () that suggest using final as much as possible and I'm wondering how important that is. This is mainly in the the context of method parameters and local variables, not final methods or classes. For constants, it makes obvious sense.  On one hand, the compiler can make some optimizations and it makes the programmer's intent clearer. On the other hand, it adds verbosity and the optimizations may be trivial.  Is it something I should make an effort to remember? Using divisibility theorems, prove that if $\gcd(a,b)=1$ and $a|c$ and $b|c$, then $ab|c$.   This is pretty clear by UPF, but I'm having some trouble proving it using divisibility theorems. I was looking at , and if this could be proven, then the solution would follow immediately. I have a table tabName with the following rows:  id(PK) .. Created(datetime)     Resolved(datetime) Status(new/resolved/open) 1          2015-05-10 00:00:00   1970-01-01 ..       open 2          2015-05-10 ..         1970-01-01 ..       new 3          2015-05-10            2015-05-12          resolved 4          2015-05-11 ..         1970-01-01 ..       open 5          2015-05-11 ..         1970-01-01 ..       new 6          2015-05-11            2015-05-11          resolved 7          2015-05-12 ..         1970-01-01 ..       open 8          2015-05-12 ..         1970-01-01 ..       new 9          2015-05-12            2015-05-12          resolved   NOTE:  1970-01-01 .. is default time for all the tickets which are still open.  I have to frame a query to get the count of tickets still open, date wise. Say like on 10 May I have 3 tickets opened. Noting that for id = 3, resolved date is not 10 but it's closed on 12 May.  I framed a query like  SELECT DATE_FORMAT(Created, '%d-%m') AS createdd, COUNT(1) FROM tabName WHERE DATE_FORMAT(Resolved, '%d-%m') &gt; DATE_FORMAT(Created, '%d-%m')       AND YEAR(Created) = '2015' GROUP BY createdd;   The above query gets all the tickets whose Resolved date is greater than the date which is considered for the count. This may count newer tickets as well. And also if the older tickets which are not resolved yet is not counted.  Is there any other way to frame the required query? I have been juggling with this query from last 3 days. Not able to find out still.  Updated: As suggested by Abhik, i have tried in sqlfiddle site.  Here is what i created:  CREATE TABLE test    (idint,createddatetime,resolveddatetime, status varchar(15), PRIMARY KEY (id));    INSERT INTO test       (id,'created','resolved',status`) VALUES       (1,'2015-05-10 00:00:00','1970-01-01 00:00:00','open'),    (2,'2015-05-10 00:00:00','1970-01-01 00:00:00','new'),    (3,'2015-05-10 00:00:00','2015-05-12 00:00:00','resolved'),    (4,'2015-05-11 00:00:00','1970-01-01 00:00:00','open'),    (5,'2015-05-11 00:00:00','1970-01-01 00:00:00','new'),    (6,'2015-05-11 00:00:00','2015-05-11 00:00:00','resolved'),    (7,'2015-05-12 00:00:00','1970-01-01 00:00:00','open'),    (8,'2015-05-12 00:00:00','1970-01-01 00:00:00','new'),    (9,'2015-05-12 00:00:00','1970-01-01 00:00:00','open')    ;   `   When i run  ` select created_date, @open:= @open+open_ticket-resolved as open from(  select   date_format(created,'%d-%m') as created_date ,  sum( case when status='open' then 1 else 0 end )+  sum( case when status='new' then 1 else 0 end )+  sum( case when status='resolved' and ( date(resolved) > date(created) or  date(resolved) = date(created)) then 1 else 0 end ) as open_ticket,  sum(case when status = 'resolved' and date(resolved) = date(created) then 1   else 0 end) as resolved  from test  where  YEAR(Created) = '2015'  group by created_date )x,  (select @open:=0)r order by created_date ; `  I got following output  created_date   open 10-05   3 11-05   5 12-05   8  Here count of still open tickets for 12-05 must be 7. The above query includes ticket id "3" , which is closed on 12-05. So is there any way to exclude this? If i am able to get this right, then i will have full fledged query. on proving bac-cab rule, $\vec{A} \times ( \vec{B} \times \vec{C})= \vec{B} (\vec{A} \cdot\vec{C})- \vec{C}(\vec{A}\cdot\vec{B})$ I noticed something when I was doing a proof of the BAC-CAB rule, and wanted to check if my intuition was correct.   First, when I actually multiplied out $\vec{B} (\vec{A} \cdot\vec{C})-\vec{C}(\vec{A}\cdot\vec{B}) $ I noticed that I got the same thing. That is, the two quantities are equal. This makes sense since they are dot products. But that further implies that the expression goes to zero.  Well, that means that $\vec{A} \times (\vec{B} \times \vec{C})$ would have to be zero too. And when I thought about it it occurred to me that $\vec{B} \times \vec{C}$ describes a vector perpendicular to both B and C; it's orthogonal. But $\vec{A} \times$ (any vector) will describe a vector perpendicular to (any vector) and in this case, that's $\vec{B} \times \vec{C}$. That is going to be parallel with the vector described by $\vec{B} \times \vec{C}$ itself and that further implies that the cross product of the two is equal to zero. Which is equal to the BAC-CAB quantity above.   So, what is the big honking flaw in my reasoning here? :-) I'm looking for a way to access raster layers in an Esri File-GeoDatabase without using ArcObjects or ArcPy, specifically I would like to access the raster layers with GDAL. I understand that the GDAL FileGDB and OpenFileGDB give access to vector datasets within File-GeoDatabases, and that ESRI's own FileGDB C++ API does not support raster access.   Is anyone out there aware of any open source solutions? What are the basics of commands in Minecraft Java Edition?