Euler #3, sloppy

Tree method returns factors. The second to last number is the largest
prime factor. I want to discover and print only the largest prime
number, but I am confuzzled.