Got it.

Also sent you a pull request for Puzzle Node:
https://github.com/LNA/puzzle_node/pull/1


On Wed, Feb 26, 2014 at 11:16 PM, mikeebert <notifications@github.com>wrote:

> In chapter_10/10.8.rb:
>
> > +
> > +  def is_prime?(candidate)
> > +    if least_relevant_multiple_of_next_larger_prime_factor(
> candidate)
> > +      multiples_of_prime_factors << candidate
> > +      return false
> > +    end
> > +    is_not_multiple_of_any_previous_prime_factors
> > +  end
> > +
> > +  def least_relevant_multiple_of_next_larger_prime_factor(candidate)
> > +    next_larger_prime_factor = primes[multiples_of_prime_factors.length]
> > +    least_relevant_multiple = mext_larger_prime_factor * mext_larger_prime_factor
> > +    candidate = least_relevant_multiple
> > +  end
> > +
> > +  def is_not_multiple_of_any_previous_prime_factor(candidate)
>
> Look at the example in the book again. You're missing a crucial part.
>
> --
> Reply to this email directly or view it on GitHub<https://github.com/LNA/Clean_Code/pull/2/files#r10112486>
> .
>