prime numbers

One of the hardest things in computer science is solving problems where the number of steps required to solve the problem increase with each step.


Let's say you want to find the highest prime number.
Well, start with "1". "1" can only be divided by itself and "1" (which is also "1" in this case). Well, actually, no......... some people say that prime is neither prime nor composite, it is a special entity called "unity".
Now, we go to the next number, "2". "2" can only divided by itself and "1". So, "2" is a prime number. Go to the next number, "3". To test "3", we must divide by "2" to make sure it is not divisible by "2" to check if it is a prime number. And then, for "4", we must divide by "2" and "3".
And for "5", we mus divide by "2", "3", and "4".

So, imagine how difficult it must be (for and human or a computer) to test if a number in ten thousands or millions is prime!

Well, humans and computers have teamed up to create a bear that will calculate prime numbers!
Check it out!!!