Update 0005-Pascal-Triangle.md

Author: manishh12

dsa-solutions/gfg-solutions/0005-Pascal-Triangle.md

@@ -21,7 +21,7 @@ In this page, we will solve the Pascal Triangle Row problem using different appr
 
 ## Problem Description
 
-Given a positive integer N, return the Nth row of Pascal's triangle. Pascal's triangle is a triangular array of the binomial coefficients formed by summing up the elements of the previous row. The elements can be large so return it modulo \(10^9 + 7\).
+Given a positive integer N, return the Nth row of Pascal's triangle. Pascal's triangle is a triangular array of the binomial coefficients formed by summing up the elements of the previous row. The elements can be large so return it modulo $\(10^9 + 7\)$.
 
 ### Examples
 
@@ -188,8 +188,9 @@ function nthRowOfPascalTriangle() {
 
 The mathematical approach leverages the properties of binomial coefficients to directly compute each element in the Nth row of Pascal's triangle. The value of the element at the ith position is calculated using the formula:
 
-`Value = (i choose j) = ((i! / (j! * (i - j)!))%1e9+7)`
-
+$\[
+\text{Value} = \binom{i}{j} = \frac{i!}{j! \cdot (i - j)!}
+\]$
 #### Implementation
 
 ```jsx live
@@ -412,4 +413,4 @@ These are the two approaches to solve the Pascal's Triangle Row problem. Each ap
 - **Solution Link:** [Pascal's Triangle Solution on GeeksforGeeks](https://www.geeksforgeeks.org/problems/pascal-triangle0652/0)
 - **Authors GeeksforGeeks Profile:** [Manish Kumar Gupta](https://www.geeksforgeeks.org/user/manishd5hla/)
 
----
+---