prime genrator in 34 bytes - comp.lang.ruby

1 message - Collapse all

Simon Strandgaard

More options Mar 23 2005, 9:54 pm

Newsgroups: comp.lang.ruby

From: Simon Strandgaard <neon...@gmail.com>

Date: Thu, 24 Mar 2005 11:54:56 +0900

Local: Wed, Mar 23 2005 9:54 pm

Subject: [oneliners] prime genrator in 34 bytes

  Reply to author
  |
  Forward
  | Print
  | Individual message
  | Show original
  | Report this message
  | Find messages by this author
  

The previous record seen on http://rubygarden.org/ruby?OneLiners
seems to to have been 46 bytes (its unclear who the author was).

JIX proposed this 34 bytes long solution.
i=l=1;(l%i+=1)>i-2&&p(i)while l*=i

Congratulations Jix, it was entertaining me and flgr.

I proposed a 40 bytes solution that isn't endless:
l=1;2.upto(1000){|i|p i if l%i>i-2;l*=i}

--
Simon Strandgaard

Reply to author Forward

End of messages