Update one_liner.rb

Using Fermat's Little Theorem is a much more efficient way of checking if a number is prime (200-300% for ~500 numbers generation. Significant increase at ~10000). This should make prime checking, and prime generation a lot faster.