diff --git a/Numbers/Fibonacci.cs b/Numbers/Fibonacci.cs
new file mode 100644
index 000000000..bde3ed7a9
--- /dev/null
+++ b/Numbers/Fibonacci.cs
@@ -0,0 +1,32 @@
+using System;
+
+namespace fibonacci
+{
+	class fibonacci
+	{
+		private static void Main()
+		{
+			Console.WriteLine("Please enter your maximum number: ");
+			int topNum = Convert.ToInt32(Console.ReadLine());
+			int curNum = 1; int priNum = 0; int newNum = 0;
+			do
+			{
+				if(curNum == 1 && priNum == 0)
+				{
+					Console.WriteLine("The first number in the Fibonacci Sequence is: " + priNum);
+					Console.WriteLine("The next number in the Fibonacci Sequence is: " + curNum);
+					priNum = curNum;
+				}
+				else
+				{
+					Console.WriteLine("The next number in the Fibonacci Sequence is: " + curNum);
+					newNum = curNum;
+					curNum += priNum;
+					priNum = newNum;
+				}
+				
+				
+			} while(curNum <= topNum);
+		}
+	}
+}
\ No newline at end of file
diff --git a/Numbers/Primes.cs b/Numbers/Primes.cs
new file mode 100644
index 000000000..399c76b8a
--- /dev/null
+++ b/Numbers/Primes.cs
@@ -0,0 +1,44 @@
+using System;
+using System.Collections.Generic;
+
+namespace prime
+{
+	class prime
+	{
+		private static void Main()
+		{
+			Console.WriteLine("Enter the number you wish to find the prime factors of: ");
+			int primeNum = Convert.ToInt32(Console.ReadLine());
+			List<int> primes = new List<int>();
+			
+			for(int i = primeNum - 1; i > 0; i--)
+			{
+				if(i % 2 != 0)
+				{
+					if(isPrime(i))
+						primes.Add(i);
+				}
+					
+			}
+			
+			foreach(int item in primes)
+				Console.WriteLine(item);
+		}
+		
+		private static bool isPrime(int x)
+		{
+			bool retVal = false;
+			for(int i = 2; i < x; i++)
+			{
+				if(x % i == 0)
+				{
+					retVal = false;
+					break;
+				}
+				else
+					retVal = true;
+			}
+			return retVal;
+		}
+	}
+}
\ No newline at end of file
diff --git a/Numbers/fibonacci.py b/Numbers/fibonacci.py
deleted file mode 100644
index a6692a94f..000000000
--- a/Numbers/fibonacci.py
+++ /dev/null
@@ -1,15 +0,0 @@
-# -*- coding: cp1252 -*-
-# Fibonacci Sequence - Enter a number and have the
-# program generate the Fibonacci sequence to that number
-# or to the Nth number
-
-n = int(raw_input('How many numbers do you need? '))
-series = [1]
-
-while len(series) < n:
-    if len(series) == 1:
-        series.append(1)
-    else:
-        series.append(series[-1] + series[-2])
-
-print series