Consider a computer system that has $m$ number of objects in its memory. Job of the system is to search the specific object. We describe all searchable objects in the memory as a set $\mathscr{A} = \{1,2,3,.....m\}$.
So if in first cycle system does not locate the object, It will traverse the $\mathscr{A}$ again. In second cycle we suppose system again failed to find the object in the set then system traverse $\mathscr{A}$ again. System will keep traversing that set for $n$ number of cycles until it finds the specific object.
If we describe set as $\mathscr{A_i} = \{1,2,3,.....n_i\}$, Then reputation behavior can be described theoretically as
$\mathscr{A_1} = \{1,2,3,.....m_1\}$
$\mathscr{A_2} = \{1,2,3,.....m_2\}$
$\mathscr{A_3} = \{1,2,3,.....m_3\}$
$. . . . . . . .$
$. . . . . . . .$
$\mathscr{A_n} = \{1,2,3,.....m_n\}$
If set of elements in form of variables for example $\mathscr{A} = \{a_{11}, a_{12}, a_{13}\, . . . ., a_{1m}\}$ , Then how can we describe the repetition behavior of the set theoretically?