diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
index 24e89f42e6..96bf1cf079 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -10,7 +10,7 @@ dashedName: linear-congruential-generator
 
 The [linear congruential generator](<https://en.wikipedia.org/wiki/linear congruential generator>) is a very simple example of a [random number generator](<http://rosettacode.org/wiki/random number generator>). All linear congruential generators use this formula:
 
-$$r\_{n + 1} = a \\times r_n + c \\pmod m$$
+$$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
 Where: