Merge pull request #906 from Quantum-Software-Development/FabianaCampanari-patch-1

Update README.md

Author: FabianaCampanari

README.md

@@ -156,7 +156,7 @@ $$
 
 <br>
 
-##### ➢ [***Note***](): ***This equation represents a simple solution to an ordinary differential equation.***
+#####  [***Note***](): ***This equation represents a simple solution to an ordinary differential equation.***
 
 <br>
 
@@ -174,11 +174,15 @@ $$
 
 A chocolate manufacturer has a stock of chocolates, consisting of 130 kg with cherry filling and 170 kg with mint filling. He decides to sell the stock in the form of two different assorted packages. One package contains a mix with half the weight in cherry chocolates and half in mint chocolates and sells for R$ 20.00 per kg. The other package contains a mix of one-third cherry chocolates and two-thirds mint chocolates and sells for R$ 12.50 per kg. How many kilograms of each mix should the seller prepare to maximize his sales profit?
 
+<br>
+
 ### [Solution]():
 
 ###  ***Objective Function***
 
-### ➢ [Maximize]():
+###  [Maximize]():
+
+<br>
 
 $$
 Z = 20x_1 + 12.5x_2
@@ -192,7 +196,7 @@ Z = 20x_1 + 12.5x_2
 
 <br>
 
-### ➣ [Subject to Constraints]():
+###  [Subject to Constraints]():
 
 $$
 \begin{cases}
@@ -216,6 +220,7 @@ $$
 
 ### ➢ [Solution Steps]():
 
+<br>
 
 1. Express the cherry chocolate constraint: