From c777efc94c0be4f3abaf0e045a3d4b08951fa565 Mon Sep 17 00:00:00 2001
From: Erik R Eaton <erik.eaton@uconn.edu>
Date: Tue, 28 Mar 2017 17:33:43 -0400
Subject: [PATCH] Update README.md

---
 README.md | 18 ++++++++++++++----
 1 file changed, 14 insertions(+), 4 deletions(-)

diff --git a/README.md b/README.md
index f104511..ed2a567 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,15 @@
 # linear_algebra
-## 5 ##
+
+## 2. ##
+
+
+## 3. ##
+
+
+## 4. ##
+
+
+## 5. ##
 
 Natrual Frequency 1 = 2sqrt(5) 
 Natural Frequency 2 =  0.5(sqrt(5*(sqrt(129)-9)))
@@ -8,7 +18,7 @@ Note: In order to calculate the natural frequencies, the first matrix was simpli
 
 ![first work] (first work.png)
 ![second work] (second work.png)
-## 6 ##
+## 6. ##
 | # of segments | largest | smallest | # of eigenvalues |
 | --- | --- | --- | --- |
 | 5 | 3.6180 | 0.3820 | 4 |
@@ -18,8 +28,8 @@ Note: In order to calculate the natural frequencies, the first matrix was simpli
 
 If the segment length (dx) approaches 0, this implies that the number of segments continues to grow to infinity. Therefore, there will also be an infinite number of eigenvalues. This conclusion is supported by the pattern in behavior illustrated in the table above.
 
-#### Script for 6 #####
-````
+##### Script for 6 #####
+
 function [ max_eig,min_eig,quant_eig] = PoleVault( segments,length )
 %PoleVault The purpose of the function is to find the eigenvalues for a
 %slender column subject in axial load for a general number of segments.