Make a function that thats in a number, the function must return true if it is prime.
Sigiloso
You would do a loop and take the mod of the number. Then you would update a variable if it is divisible. then you would just do an if statement to see if it has more than 2 factors.