Prime Numbers Help?

[toraj58]

i write the code for you:

#include <cstdlib>
#include<iostream>
#include<math.h>

using namespace std;

int main() {
    int i, j;
    for(i=2; i<100; i++) 
    {
        bool isPrime = true;
        for(j=2; j<=sqrt(i); j++) 
        {
            if(i&#37;j ==0 ) 
            {
                isPrime = false;
                break;
                
            }
           
        }
        
        if (isPrime)
        {
           cout<< i << " : Is Prime" << endl;          
        }else
        {
           cout<< i << " : Is not Prime" << endl;      
        }
    }
    system("PAUSE");
    return EXIT_SUCCESS;
}

according to a math theory it is just enough to test for 0 remainder till reaching sqrt(i). so i used that theory to have faster algorithm