diff --git a/README.md b/README.md
index 4b4187d..bc8a164 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,2 @@
-DevPreWork01
+Project Euler Solutions
 ============
diff --git a/problem05.rb b/problem05.rb
index e69de29..5126ac6 100644
--- a/problem05.rb
+++ b/problem05.rb
@@ -0,0 +1,31 @@
+# I began with recreating the example in the problem
+# change the range value of 'arr' to 1-10, to verify
+
+# The code seems to be working right, and returns values fine up until
+# the range of 'arr' is increased past 17.  I don't think my computer is
+# powerful enough to deal with the large numbers, the program always crashes!
+# I believe the code would eventually produce the correct answer, if allowed to run
+
+def one_to_twenty(num)
+  arr = (1..20).to_a
+  result = arr.map{|x| num % x}
+  result = result.inject{|memo, x| memo + x}
+  if result == 0
+    true
+  else 
+    false
+  end
+end
+
+def find_it(number)
+  while one_to_twenty(number) == false
+    puts number
+    number +=1
+    break if one_to_twenty(number) == true
+  end
+  puts "The answer is #{number}!"
+end
+
+puts find_it(1)
+
+#122_770_002 last number reached before computer crashed!
diff --git a/problem08.rb b/problem08.rb
index e69de29..40163ef 100644
--- a/problem08.rb
+++ b/problem08.rb
@@ -0,0 +1,43 @@
+num =("73167176531330624919225119674426574742355349194934
+96983520312774506326239578318016984801869478851843
+85861560789112949495459501737958331952853208805511
+12540698747158523863050715693290963295227443043557
+66896648950445244523161731856403098711121722383113
+62229893423380308135336276614282806444486645238749
+30358907296290491560440772390713810515859307960866
+70172427121883998797908792274921901699720888093776
+65727333001053367881220235421809751254540594752243
+52584907711670556013604839586446706324415722155397
+53697817977846174064955149290862569321978468622482
+83972241375657056057490261407972968652414535100474
+82166370484403199890008895243450658541227588666881
+16427171479924442928230863465674813919123162824586
+17866458359124566529476545682848912883142607690042
+24219022671055626321111109370544217506941658960408
+07198403850962455444362981230987879927244284909188
+84580156166097919133875499200524063689912560717606
+05886116467109405077541002256983155200055935729725
+71636269561882670428252483600823257530420752963450"
+)
+
+whole_num = num.split("")
+whole_num = whole_num.map { |e| e.to_i }
+
+
+
+new_arr = []
+
+next_5 = (whole_num.each_cons(5) {|a| new_arr << a
+  p a}).to_a
+
+
+
+def mult_five(array)
+  win = array.map do |(a,b,c,d,e)|
+    p a * b * c * d * e
+  end
+  p " The greatest product of five consecutive digits is #{win.max}!!"
+end
+
+mult_five(new_arr)
+