Prime.rb

def squareroot(n, diff)
	gues=refine(1,n)

	while(((gues*gues)-n)>diff)
	gues=refine(gues, n)
	end

	gues
	
end

def refine(gues, n)
	gues=(gues+(n/gues))/2.0
end



def is_primeno?(n)
	s=squareroot(n, 0.00000001).to_i
	
	rang=2..s
	is_prime=true
    rang.each do |c|
    	is_prime=false if (n%c == 0)

	end
	
	
		puts is_prime