unsigned int pgcd(unsigned int a, unsigned int b){
    //Euclidean algorithm
    int r = 1;
    while(a%b != 0) {
            r = a%b;
            a = b;
            b = r;
    }
    return r;
}

bool computation_bound(unsigned int number){
    int i;
    for ( i = 2; i <= sqrt(number); i++){
        if (pgcd(i, number) != 1) return false;
    }

    return true;
}

int main(){
    std::cout << "1039 premier ? " << computation_bound(1039) << std::endl;
    std::cout << "2047 premier ? " << computation_bound(2047) << std::endl;
}