Returns true if input is prime, otherwise false. If input is less than two, then this will always return false. If input is greater than or equals to

Returns a list of each row of string in the file. Only available for Java 7+. Example usage: `FileUtils.readAllLines("src/com/danialgoodwin/projecteul

The intuition for this is zigzagging up and right in a multiplication chart until the value if found or is out of bounds. Chart is symmetrical, so cou

Returns primes table.

Fills elements of input multiples in input array with input value, except for the input multiple itself is not changed.

Intuition: There are at most two distinct depths, and they are at most one apart. Depth-first search. Space: O(height), time: O(n)

Return a random number between 1 and 5, inclusive.

@param num must be a valid index in sequenceLengths

The intuition for this is zigzagging up and right in a multiplication chart until the value if found or is out of bounds. Chart is symmetrical, so cou

Returns at most two factors of input.

Clears bits that are multiples of number, but not the number itself.

This should be called before silenced().

Creates a table to hold sequential primes that can be accessed by `getNthPrime(int)`. The largest size of the table is INT_MAX.

Return the first term in the Fibonacci sequence to contain n digits, where n >= 1. Space: O(1), time: O(n), though more accurately, the rate at which

Solves via starting with palindrome, then determines whether or not it has 3-digit factors. Space: O(1), Time: O(n n)?, much faster than v1.

Returns a table for whether or not all number up to input max are prime.

Returns the product of all the numbers in char list. Returns 0 if empty or contains non-digit.

Return the sum of the proper divisors for n. Return 0 for n <= 1.

Lexical analyzer (aka scanner or tokenizer)