The default 'reset time' for Internet Information Services is 29 hours. The reason for this is that
'Wade [person on the team who developed the setting] suggested 29 hours for the simple reason that it’s the smallest prime number over 24. He wanted a staggered and non-repeating pattern that doesn’t occur more frequently than once per day. In Wade’s words: “you don’t get a resonate pattern”'.
Source: http://blogs.iis.net/owscott/why-is-the-iis-default-app-pool-recycle-set-to-1740-minutes
Is it true that if you have a cycle (of say 24 hours) and in this cycle period you want to have a non-resonate, staggered non-repeating pattern bigger than the cycle period, you have to use a prime number larger than this cycle period? How can this be proved?
/edit A simple calculation shows that this cycle is recurring as follows:
5
10
15
20
1
6
11
16
21
2
7
12
17
22
3
8
13
18
23
4
9
14
19
0
5
10
15
20
(...)
So after 24 times every value is touched and the cycle restarts again. This cycle is repeating after all. I don't know how to formalize this, but I think the question can be answered with False, it does not lead to a non-recurring pattern.
If integer $r$ is the length of the reset interval, and resets begin at $t=0$, then the sequence of reset times (as measured on a $24$-hour clock) is $$R_{24,r} = (t\ \mathtt{mod}\ 24:\ \ t\ \mathtt{mod}\ r=0,\ t\in \{0,1,2,...\} )$$ where $\ a\ \mathtt{mod}\ b\ $ denotes the remainder of the division of $a$ by $b$.
NB:
That is, $R_{q,r}$ contains a minimal repeating cycle of length $\frac{q}{\gcd(q,r)}$. If $q$ is fixed and $r=1,2,3,...$, then the corresponding fundamental periods range over all the divisors of $q$ (in haphazard order). What varies as $r$ varies is the length and internal structure of the minimal repeating cycle.
It seems evident that Wade's actual criteria are just these:
Now (1) requires that $r\ge 24$, so consider the first few possibilities:
The smallest integer $r$ satisfying both (1) and (2) is seen to be $r=29$.
NB: In our case of $R_{24,r}$, the maximum period ($24$) is attained when $\gcd(24,r) = 1$, i.e., when $r \in \{1,5,7,11,13,17,19,23,25,29,31,35,... \}$. It just happens that $r=29$ is the least of these with $r\ge 24$ and such that the minimal repeating cycle is not simply $(0,1,2,...,23)$.