Programs of Loops

Store the first n prime numbers in the list

The following program stores the first n prime numbers to a list. The value of n is chosen by the user, and any number can be used. Here’s how to solve this problem:

• Start with an empty list of n elements.
• Store $2$ as the first prime number at the index $0$.
• Keep checking every following integer by dividing it by every prime value in the list.
  • Check $3$ by taking the remainder after dividing it by all the prime values in the list. The only value in the current list is $2$