factorial of two is two
pass a block and check that values equal all factors
convert number to string and evaluate string to get factors
create var for eval of parameter and pass var into prime factor check
pass two and its factors to the block to be evaluated
remove checks for specific factors now that refactored block passes
update prime factors module to push whatever number is passed in to the array of factors
if a number is evenly divisible by two and is bigger than 1, add the quotient of n and 2 to the array of factors
pass in five, which is prime
check that two and three are valid for six
check that seven is prime
iterate over factors divisible by two until you get down to two
refactor logic that determines factors of n. iterate over values greater than 1 rather than having specific checks for each low prime.
remove adding self to array if self is greater than one because the case is now handled in the while loop
refactor while loop and var definitions
test a big example that checks that the product of all prime numbers up to thirteen has all prime numbers up to thirteen as factors
refactor for testing much larger numbers