Fix problem 3 using prime module

Using ruby's prime module drastically simplified this solution.

The underlying algorithm works as follows:

- Iterate over a range of pseudoprimes generated by Prime::Generator23
- Perform trial division on each pseudoprime, if its a factor then collect
  it
- Return all collected factors as array
- Take the largest number from 2d array