reimann_foo 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 31deb9a99b0f50a3a5c66fef964869c375481c80
+  data.tar.gz: 33c0613de1184d3116cfe999670bc572ba937c93
+SHA512:
+  metadata.gz: 32ed51496048b94454a8837ab2fc2843f6fc983fdc16aa5c72bf0304837f640ff53d5525570dc46c07ed6a82c3fde7024e12bccefb9284d7f25a106fc407df13
+  data.tar.gz: 1122f5faa837116d31955419407d7f43af88ca7a4a770f9cd5fc086cd8f82c195a0a603909972808d4eba417b88412af575f725bbe4f36274bb3d0a681624a60

data/lib/reimann_foo.rb

@@ -0,0 +1,110 @@
+#!/usr/bin/env ruby
+
+#reimann.rb
+
+class Primes
+	attr_reader :num
+	attr_accessor :prime
+
+	def num=(num)
+		if num == 0
+			raise "integers only"
+		else
+			puts num.to_i
+		end
+		@num = num
+	end
+
+	def initialize(num)
+		@primes_lst = []
+		@num_lst = []
+		self.num = num
+		self.prime = false
+	end
+
+	def divide_for_primes
+		(2...num).each do |i|
+			if num % i == 0
+				@primes_lst << i
+			end
+		end
+		@primes_lst
+	end
+
+	def remove_evens
+		if num >= 2
+			@primes_lst << 2
+		end
+		(2..num).each do |i|
+			if i % 2 != 0 #if odd loop
+				@primes_lst << i
+			end
+		end
+		@primes_lst
+	end
+
+	def remove_odds
+		@num_lst = @primes_lst.reverse
+		@num_lst.each do |i|
+			@primes_lst.each do |j|
+				if i % j == 0 && i != j
+					@primes_lst.delete(i)
+				end
+			end
+		end
+		puts "#{num} = #{@primes_lst.size} primes. --> #{@primes_lst}"
+		@primes_lst
+	end
+
+	def is_prime
+		@primes_lst.empty? ? self.prime = true : prime
+		@primes_lst.empty? ? "prime." : "not prime.\nDividers are #{@primes_lst}."
+	end
+
+	def write
+		file_new = File.open('primes.txt', 'a+')
+		file_new.write("#{num}")
+		unless prime
+			file_new.puts(" is not prime")
+			file_new.puts("#{@primes_lst}")
+		else
+			file_new.write(" is prime\n")
+		file_new.close
+		end
+	end
+end
+
+go = true
+while go
+	time0 = Time.now
+	print "enter num: ["
+	foo = gets.chomp.to_i
+
+	x = Primes.new(foo)
+	puts "1 if you want to find the primes for the RANGE -> (0 .. #{foo})"
+	puts "2 if you want to test if #{foo} is prime"
+	choice = gets.chomp.to_i
+	time1 = Time.now
+	if choice == 1
+		x.remove_evens
+		x.remove_odds
+	else
+		x.divide_for_primes
+		puts x.is_prime
+	end
+	time2 = Time.now
+	puts "overall time: #{(time2 - time0) * 10000} ms"
+	puts "calc time: #{(time2 - time1) * 10000} ms"
+	puts 'save? [y/n]'
+	choice = gets.chomp.downcase
+	if choice == 'y' || choice == 'yes' || choice == 'o' || choice == 'oui'
+		x.write
+	end
+	puts "try another number? [y/n]"
+	choice = gets.chomp.downcase
+	if choice == 'y' || choice == 'yes' || choice == 'o' || choice == 'oui'
+		next
+	else
+		go = false
+	end
+end

metadata

@@ -0,0 +1,45 @@
+--- !ruby/object:Gem::Specification
+name: reimann_foo
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- foo
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2019-01-01 00:00:00.000000000 Z
+dependencies: []
+description: A tool to 1. find primes in a user defined integer range and 2. test
+  if a user supplied integer is prime
+email: foo@yetispeak.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/reimann_foo.rb
+homepage: 
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.5.2.1
+signing_key: 
+specification_version: 4
+summary: primes
+test_files: []