Various incomplete solutions

ProjectEuler/025/desc.yml

@@ -3,10 +3,8 @@ url: http://projecteuler.net/problem=25
 
 desc: |
   The Fibonacci sequence is defined by the recurrence relation:
-
   Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1.
   Hence the first 12 terms will be:
-
   F1 = 1
   F2 = 1
   F3 = 2
@@ -20,11 +18,13 @@ desc: |
   F11 = 89
   F12 = 144
   The 12th term, F12, is the first term to contain three digits.
-
   What is the first term in the Fibonacci sequence to contain 1000 digits? 
 solution: Bruteforce
 
 solutions:
   solve.php:
-    desc: Basic Solution
-    language: php
+    desc: Basic Solution - needs BCMath
+    language: php
+  solve.rb:
+    desc: Basic solution
+    language: ruby