Prime finder

added method that finds all primes for less than n. And added method that iterates over list_of_primes and creates new list of primes combos via elimination. This way, when we check secret(x) and secret(y), we're not brute force checking ALL combos at every index. Only the ones that haven't been checked.