0

hi I am talking C# this semester, can anybody help me with my assignment?

Here is the problem:

Determines whether a number is prime by checking whether 2,3,4,5,6..., n/2 is a divisor. If a divisor is found, not is not a prime number. A more efficient approach to determine whether any of the prime numbers less than or equal to squareroot of n can divide n evenly. If not n is a prime number. To display the first fifty prime numbers using this, approach you need to use an array tp store prime numbers and later use them to check whether they are possible divisor of n.

I can't really understand the problem. That makes if difficult.. could anybody help me? or can anybody simplify the problem? thanks