Update modular_inverse_fermat_little_theorem.cpp

hollowcrust · web-flow · commit 07f4aef8ca19 · 2024-10-11T16:29:58.000+08:00
diff --git a/math/modular_inverse_fermat_little_theorem.cpp b/math/modular_inverse_fermat_little_theorem.cpp
@@ -31,7 +31,7 @@
  * \f}
  *
  * We will find the exponent using binary exponentiation such that the
- * algorithm works in logarithmic time.
+ * algorithm works in \f$O(\log n)\f$ time.
  *
  * Examples: -
  * * a = 3 and m = 7

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,7 @@`
`31`	`31`	`* \f}`
`32`	`32`	`*`
`33`	`33`	`* We will find the exponent using binary exponentiation such that the`
`34`		`- * algorithm works in logarithmic time.`
	`34`	`+ * algorithm works in \f$O(\log n)\f$ time.`
`35`	`35`	`*`
`36`	`36`	`* Examples: -`
`37`	`37`	`* * a = 3 and m = 7`