New changes (#22)

* update Fibonacci.fs

added a function to get the nth Fibonacci number.

* update readme.md

* update readme.md

* create new file

create algorithm to calculate greatest common divisor.

* Rename PerfectNumbers.fs to Perfect_Numbers.fs

Author: Hogosha42

Algorithms/Math/Fibonacci.fs

@@ -1,4 +1,4 @@
-namespace Algorithms.Math
+namespace Algorithms.Math
 
 module Fibonacci =
     let rec PrintSerie (one: int) (two: int) =

Algorithms/Math/Greatest_Common_Divisor.fs

@@ -0,0 +1,7 @@
+namespace Algorithms.Math
+
+module GreatestCommonDivisor =
+    let rec gcd (m: int) (n: int): int = 
+      match m,n with
+        | 0,n -> n
+        | m,n -> gcd (n % m) m

Algorithms/Math/PerfectNumbers.fs renamed to Algorithms/Math/Perfect_Numbers.fs

@@ -11,6 +11,7 @@ This repository contains algorithms and data structures implemented in F# for ed
     + [Abs Minimum](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/AbsMin.fs)
     + [Factorial](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Factorial.fs)
     + [Fibonacci](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Fibonacci.fs)
+    + [Greatest Common Divisor](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Greatest_Common_Divisor.fs)
     + [Perfect Numbers](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Perfect_Numbers.fs)
     + [Power](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Power.fs)
   + [Search](https://github.com/TheAlgorithms/F-Sharp/tree/main/Algorithms/Search)