[Project shared ~8:30pm] It's exactly what the name says. Takes your input, factorises it into prime numbers. This uses the sieve of Eratosthenes project I made a few days ago. It works by checking through the primes in the list and seeing how much each prime divides your input. For each time a prime divides, add it into the list. This is done until your input is 1 and therefore is no longer divisible by any number. If your number is already prime (meaning it's in the primes list), then it just adds it to the factorisation list and the program ends there. This took quite a bit more debugging than the sieve of Eratosthenes I made, but it fortunately worked out in the end. Have a good day!
