diff --git a/doc/gradient.md b/doc/gradient.md
index 8d4e0fe34e2138b30af4ab5a09723c1661ba3424..b5771f85336ec35ec7182eeb9a8db1b38904f37c 100644
--- a/doc/gradient.md
+++ b/doc/gradient.md
@@ -19,10 +19,10 @@ bool compute(double max_func_error,unsigned int max_iter,double start_point,bool
 
 where:
 * **max_func_error**: is the maximum difference with the previous iteration to consider that the algorithm has found a solution.
-* **max_iter**: is the maximum number of iterations allowed to the algorihtm. If the solution is found before reacing this limit, the function will return immediatelly.
+* **max_iter**: is the maximum number of iterations allowed to the algorihtm. If the solution is found before reaching this limit, the function will return immediatelly.
 * **start_point**: is the start point of the algorithm. It may be usefull to avoid local minima of the desired function.
 * **beyond_limits**: an output flag that indicates that the solution found is one of the convergence limits set by the user.
-* **max**: an input flag to indicate whetehr to find the maximum (true) of the minimum (false) of the function. If not set, the default value is true.
+* **max**: an input flag to indicate whether to find the maximum (true) of the minimum (false) of the function. If not set, the default value is true.
 
 The convergence algorithm can end in several different ways: