diff --git a/ProjectEuler/006/desc.yml b/ProjectEuler/006/desc.yml
index 77ebe89..c5869c3 100644
--- a/ProjectEuler/006/desc.yml
+++ b/ProjectEuler/006/desc.yml
@@ -19,6 +19,6 @@ solutions:
   solve.rb:
     desc: Basic Ruby solution
     language: ruby
-  solve.rb
+  solve.rb:
     desc: ANSI C solution (Tested with TCC)
     language: c
\ No newline at end of file
diff --git a/ProjectEuler/007/desc.yml b/ProjectEuler/007/desc.yml
new file mode 100644
index 0000000..b973e46
--- /dev/null
+++ b/ProjectEuler/007/desc.yml
@@ -0,0 +1,20 @@
+title: Find the 10001st prime.
+url: http://projecteuler.net/problem=7
+
+desc: |
+  By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
+  What is the 10 001st prime number?
+  
+solution: |
+  Move up the among the prime numbers till you reach 10001
+
+solutions:
+  solve.php:
+    desc: Basic solution
+    language: php
+  solve.rb
+    desc: Basic solution
+    language: PHP
+  solve.c
+    desc: ANSI C (Compiled with TCC) solution
+    language: C
diff --git a/ProjectEuler/007/solve.c b/ProjectEuler/007/solve.c
new file mode 100644
index 0000000..7b6dd73
--- /dev/null
+++ b/ProjectEuler/007/solve.c
@@ -0,0 +1,30 @@
+#include <stdio.h>
+#include <math.h>
+
+int is_prime( int prime) {
+
+	int max_test = sqrt( prime );
+
+	int i;
+    for (i = 3; i <= max_test; i+=2){
+        if (prime % i == 0){
+			return 0; 
+		}
+    } 
+    return 1; 
+}
+
+int main( )
+{
+	//Use start val
+	int i=13;
+	int primes = 6;
+	do{
+		i+= 2;		
+		if(is_prime(i)){
+			primes++;
+		}
+		
+	} while(primes < 10001);
+	printf("%d", i);
+}
\ No newline at end of file
diff --git a/ProjectEuler/007/solve.php b/ProjectEuler/007/solve.php
new file mode 100644
index 0000000..dea6f82
--- /dev/null
+++ b/ProjectEuler/007/solve.php
@@ -0,0 +1,18 @@
+<?php
+function is_prime($prime) {    
+    $sqrt = sqrt($prime);
+    for ($i = 3; $i <= $sqrt; $i+=2){
+        if ($prime%$i == 0) return false; 
+    } 
+    return true; 
+} 
+ 
+$i=13;
+$primes = 6;
+do{
+    $i+= 2;
+    if(is_prime($i)){
+        $primes++;
+    }
+}while($primes < 10001);
+echo $i;
\ No newline at end of file
diff --git a/ProjectEuler/007/solve.rb b/ProjectEuler/007/solve.rb
new file mode 100644
index 0000000..d6440d5
--- /dev/null
+++ b/ProjectEuler/007/solve.rb
@@ -0,0 +1,21 @@
+def is_prime(prime)     
+    sqrt = Math.sqrt(prime)
+	i=3
+	while(i <= sqrt) 
+        if (prime % i == 0) 
+			return false
+		end
+		i+= 2
+    end
+    return true; 
+end
+ 
+i=13
+primes = 6
+until (primes == 10001)
+    i+= 2
+    if(is_prime(i)) 
+        primes+=1
+	end
+end
+puts i
\ No newline at end of file