diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
index 28c05dfc85..0fc363ab98 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -8,7 +8,7 @@ dashedName: problem-29-distinct-powers
 
 # --description--
 
-Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
 
 <div style='padding-left: 4em;'>
   2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
@@ -23,7 +23,7 @@ If they are then placed in numerical order, with any repeats removed, we get the
   4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
 </div>
 
-How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
 
 # --hints--