diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000..f1dc2f6
Binary files /dev/null and b/.DS_Store differ
diff --git a/problem03.rb b/problem03.rb
index e69de29..79d12c2 100644
--- a/problem03.rb
+++ b/problem03.rb
@@ -0,0 +1,16 @@
+def find_prime(sqrt_val)
+	require 'prime'
+	#Create an array to store data
+	result=Array.new
+	#Prime number must be less than sqrt value
+	for i in 2..Math.sqrt(sqrt_val).round
+		if sqrt_val%i==0
+		if Prime.prime?(i)
+			result.push(i)
+		end
+	end
+	end
+	return result
+end
+
+print find_prime(600851475143).max
diff --git a/problem05.rb b/problem05.rb
index e69de29..2a9d474 100644
--- a/problem05.rb
+++ b/problem05.rb
@@ -0,0 +1,23 @@
+
+#Given a number n, check if it is divisble from 1 to num
+def check_evenly_divs(n,num)
+	for i in 1..num
+		if n%i!=0
+			return false
+		end
+	end
+	return true
+end
+
+#Find the smallest number evenly divisble by num
+def find_divisible(num)
+	accum=num
+	loop do
+		if check_evenly_divs(accum,num)==true
+			return accum
+		end
+		accum=accum+num
+	end
+end
+
+print find_divisible(20)
\ No newline at end of file
diff --git a/problem08.rb b/problem08.rb
index e69de29..efd9ccc 100644
--- a/problem08.rb
+++ b/problem08.rb
@@ -0,0 +1,31 @@
+Number="73167176531330624919225119674426574742355349194934
+96983520312774506326239578318016984801869478851843
+85861560789112949495459501737958331952853208805511
+12540698747158523863050715693290963295227443043557
+66896648950445244523161731856403098711121722383113
+62229893423380308135336276614282806444486645238749
+30358907296290491560440772390713810515859307960866
+70172427121883998797908792274921901699720888093776
+65727333001053367881220235421809751254540594752243
+52584907711670556013604839586446706324415722155397
+53697817977846174064955149290862569321978468622482
+83972241375657056057490261407972968652414535100474
+82166370484403199890008895243450658541227588666881
+16427171479924442928230863465674813919123162824586
+17866458359124566529476545682848912883142607690042
+24219022671055626321111109370544217506941658960408
+07198403850962455444362981230987879927244284909188
+84580156166097919133875499200524063689912560717606
+05886116467109405077541002256983155200055935729725
+71636269561882670428252483600823257530420752963450"
+
+maxima=0
+
+for i in 0..Number.length-4
+	temp=Number[i, 1].to_i * Number[i+1, 1].to_i * Number[i+2, 1].to_i * Number[i+3, 1].to_i * Number[i+4, 1].to_i
+	if temp>maxima
+		maxima=temp
+	end
+end
+
+puts maxima
\ No newline at end of file