diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md
index e6b5592e676..d079367c459 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md
@@ -8,83 +8,21 @@ title: 'Problem 148: Exploring Pascal''s triangle'
 <section id='description'>
 We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:
 
-
-
-
-
-
- 1
-
-
-
-
-
- 1
-
- 1
-
-
-
-
- 1
-
- 2
-
- 1
-
-
-
- 1
-
- 3
-
- 3
-
- 1
-
-
- 1
-
- 4
-
- 6
-
- 4
-
- 1
-
- 1
-
- 5
-
-10
-
-10
-
- 5
-
- 1
-1
-
- 6
-
-15
-
-20
-
-15
-
- 6
-
- 1
+<pre>
+            1
+          1   1
+        1   2   1
+      1   3   3   1
+    1   4   6   4   1
+  1   5   10  10  5   1
+1   6   15  20  15  6   1
+</pre>
 However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are not divisible by 7.
-
-Find the number of entries which are not divisible by 7 in the first one billion (109) rows of Pascal's triangle.
 </section>
 
 ## Instructions
 <section id='instructions'>
-
+Find the number of entries which are not divisible by 7 in the first one billion (10<sup>9</sup>) rows of Pascal's triangle.
 </section>
 
 ## Tests