Hello, this is a loop I've written to find all the prime numbers up to the input from the user (n)
I can see that this one has many steps to perform and so I am looking for a way to improve it's...