PhDP · November 13, 2012 15:32
diff --git a/primes.rb b/primes.rb
 # Print a sequence of primes. It's not written to be fast, it's just to demonstrate
 # than an infinite sequence can be compressed in a small program and thus have low
 # (Kolmogorov) complexity.
 def printprimes(max)
  primes = []
  for i in 2.. max do
    primes << i if primes.inject(true) {|res, elt|
      res and i % elt != 0
    }
  end
  primes.each {|i| print i}
 end
	# Print a sequence of primes. It's not written to be fast, it's just to demonstrate
	# than an infinite sequence can be compressed in a small program and thus have low
	# (Kolmogorov) complexity.
	def printprimes(max)
	primes = []
	for i in 2.. max do
	primes << i if primes.inject(true) {\|res, elt\|
	res and i % elt != 0
	}
	end
	primes.each {\|i\| print i}
	end