Feat: Project Euler Problem 25

Author: domix80

DIRECTORY.md

@@ -159,6 +159,8 @@
     * [Sol1](https://github.com/TheAlgorithms/Ruby/blob/master/project_euler/problem_021/sol1.rb)
   * Problem 022
     * [Sol1](https://github.com/TheAlgorithms/Ruby/blob/master/project_euler/problem_022/sol1.rb)
+  * Problem 025
+    * [Sol1](https://github.com/TheAlgorithms/Ruby/blob/master/project_euler/problem_025/sol1.rb)    
 
 ## Searches
   * [Binary Search](https://github.com/TheAlgorithms/Ruby/blob/master/searches/binary_search.rb)

project_euler/problem_025/sol1.rb

@@ -0,0 +1,45 @@
+#The Fibonacci sequence is defined by the recurrence relation:
+#    Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
+#Hence the first 12 terms will be:
+#
+#    F1 = 1
+#    F2 = 1
+#    F3 = 2
+#    F4 = 3
+#    F5 = 5
+#    F7 = 13
+#    F8 = 21
+#    F6 = 8
+#    F9 = 34
+#    F10 = 55
+#    F11 = 89
+#    F12 = 144
+#
+#The 12th term, F12, is the first term to contain three digits.
+#What is the index of the first term in the Fibonacci sequence to contain 1000 digits?
+
+def solution?()
+  #Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
+  resultn1 = 1
+  resultn2 = 1
+  result = 2
+  index = 3
+  num_digits = 1000
+  value = true
+  while value
+    resultn2 = resultn1
+    resultn1 = result
+    if (resultn1 + resultn2).abs.digits.length < num_digits
+      value = true
+    else
+      value = false
+    end
+    result = resultn1 + resultn2    
+    index += 1
+  end
+  res = index
+end
+
+answer = solution?()
+p answer
+