typo index

Author: SelimChraibi

docs/src/manual.md

@@ -258,7 +258,7 @@ If you expect some workers to fail but still want the algorithm to continue runn
 
 You are free to create your own algorithms, but if you're interested in *aggregation algorithms*, you can use an implementation provided in this library. The iteration of such an algorithm performs the following computation:
 
-$$q_j \longleftarrow \textrm{query}(\underset{i \in \textrm{connected}}{\textrm{aggregate}}(a_j))\ \ \textrm{where }\ \ a_i = \textrm{answer}(q_i)$$
+$$q_j \longleftarrow \textrm{query}(\underset{i \in \textrm{connected}}{\textrm{aggregate}}(a_i))\ \ \textrm{where }\ \ a_i = \textrm{answer}(q_i)$$
 
 where $q_j$ is computed by the worker upon reception of $\textrm{answer}(q_i)$ from worker $j$ and where $connected$ are the list of workers that have answered.