diff --git a/README.md b/README.md
index 76050a5..e6bbd70 100644
--- a/README.md
+++ b/README.md
@@ -248,7 +248,7 @@ The **graphical method** for solving simple linear programming (LP) problems inv
 
 1. **[Plot the Constraints]():** For each constraint, treat it as an equality and plot the corresponding straight line on the Cartesian plane $\(x_1\)$ on the horizontal axis, $\(x_2\)$ on the vertical axis.
 
-2. **[Identify the Feasible Region]():** For each inequality constraint, determine which side of the line satisfies the inequality. This can be done by testing a point (e.g., the origin $\((0,0)\$) ; if it's not on the line) in the inequality. The feasible region is the area where all the shaded regions of the inequalities overlap. If there are non-negativity constraints (\(x_1 \geq 0\) and \(x_2 \geq 0\)), the feasible region will be in the **first quadrant**.
+2. **[Identify the Feasible Region]():** For each inequality constraint, determine which side of the line satisfies the inequality. This can be done by testing a point (e.g., the origin $\(0,0)\$) ; if it's not on the line) in the inequality. The feasible region is the area where all the shaded regions of the inequalities overlap. If there are non-negativity constraints (\(x_1 \geq 0\) and \(x_2 \geq 0\)), the feasible region will be in the **first quadrant**.