diff --git a/ProjectEuler/015/desc.yml b/ProjectEuler/015/desc.yml
index 8e47a7c..41dd8f9 100644
--- a/ProjectEuler/015/desc.yml
+++ b/ProjectEuler/015/desc.yml
@@ -1,4 +1,4 @@
-title: Find the longest sequence using a starting number under one million.	
+title: Starting in the top left corner in a 20 by 20 grid, how many routes are there to the bottom right corner?
 url: http://projecteuler.net/problem=15
 
 desc: |
diff --git a/ProjectEuler/016/desc.yml b/ProjectEuler/016/desc.yml
new file mode 100644
index 0000000..6f4b441
--- /dev/null
+++ b/ProjectEuler/016/desc.yml
@@ -0,0 +1,17 @@
+title: What is the sum of the digits of the number 2^1000?
+url: http://projecteuler.net/problem=16
+
+desc: |
+  2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
+  What is the sum of the digits of the number 2^1000?
+  
+solution: |
+  Bruteforce
+
+solutions:
+  solve.php:
+    desc: Using BCMath to cope with large numbers
+    language: php
+  solve.rb:
+    desc: Basic solution
+    language: ruby
diff --git a/ProjectEuler/016/solve.php b/ProjectEuler/016/solve.php
new file mode 100644
index 0000000..ccbb255
--- /dev/null
+++ b/ProjectEuler/016/solve.php
@@ -0,0 +1,7 @@
+<?php
+$num = bcpow(2,1000);
+$sum = 0;
+for($c =0; $c < strlen($num);$c++) {
+	$sum += $num[$c];
+}
+echo $sum;
\ No newline at end of file
diff --git a/ProjectEuler/016/solve.rb b/ProjectEuler/016/solve.rb
new file mode 100644
index 0000000..e5f0d0a
--- /dev/null
+++ b/ProjectEuler/016/solve.rb
@@ -0,0 +1,6 @@
+num = 2 ** 1000
+sum = 0 
+num.to_s.chars do |digit|
+	sum += digit.to_i
+end
+puts sum
\ No newline at end of file