lalalainexd/primee — pull request #1 by burtlo (2012-12-05 22:43:36+00:00)
Title: Minor Optimization and changes for clarity

Good problem to solve. Providing some feedback on your solution.

### Created method for `single_digits`

You are creating the array every single time within the previous method whenever it is called. This minor change to place it in a method and then *memoize* it makes it so that you create it once and then never create it again. It also makes it more clear as a method.

### `single_digit_primes`

Arrays have a great method named [include?](http://rubydoc.info/stdlib/core/Array#include%3F-instance_method) which solves the problem you were solving with the checks across several numbers. Again memoizing the primes created.

### Starting above 2

You started at the number 2 and then had some logic to skip the number two. I thought that it would be better to simply start above 2 and simply include it in the initial set of primes.