What are the prime numbers up too 100?

Answer 1

In prime numbers, you are really looking for a positive integer that has exactly two positive integer factors, 1 and itself.

1 only has only one factor, namely 1, so it is not a prime number.

Here are the prime numbers up to 100:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97

Answer 2

2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97

Answer 3

2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 51 53 59 61 67 71 73 79 83 91 97

Is my guess. To be honest, I'm not entirely sure after about the 30's, but I'm somewhat confident that's correct.

Answer 4

2 3 5 7 11 13 17 19 23 29
31 37 41 43 47 53 59 61 67 71
73 79 83 89 97

Answer 5

Use a 10 X 10 table of numbers. (Graph paper helps) Start by looking at each number in order. 1 doesn't matter. It isn't a prime. The first prime is 2. Cross out every number divisible by 2 in the table. The next prime is 3. Cross out every number divisible by 3. Go on to 5 and 7. All the numbers not crossed out are primes.

Answer 6

1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97

See the link below on how to find these numbers.

Answer 7

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97

Answer 8

1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.

Answer 9

There's a really cool web site that lists all the first 15 million prime numbers (which includes the prime numbers up to 100):

Here are the first 1,000 primes:
http://primes.utm.edu/lists/small/1000.txt

Here are the first 15 million primes:
http://primes.utm.edu/lists/small/millions/

Cheers,

-Larry

Answer 10

Don't you know how to generate prime numbers? Here is the program:

#include
using namespace std;
void prime_num(int);
int main()
{
cout << " Enter a number and I will generate the prime numbers up to that number: ";
int num = 0;
cin >> num;
prime_num(num);
}

void prime_num( int num)
{
bool isPrime=true;
for ( int i = 0; i <= num; i++)
{
for ( int j = 2; j <= num; j++)
{
if ( i!=j && i % j == 0 )
{
isPrime=false;
break;
}
}
if (isPrime)
{
cout <<"Prime:"<< i << endl;
}
isPrime=true;
}
}