unsigned long pollard_p1(unsigned long n)
{
    unsigned long gcd_result;
    
    do {    
        // b is the smoothness bound, 
        // all the prime factors of 
        // n must be <= b
        unsigned int b = 1234;
    
        // Generate a random number
        // 2 <= a <= n-1
        unsigned long a = true_random(n-3) + 2;
        unsigned long d = gcd(a, n);
    
        if (d >= 2) return d;
    
        double l;
        unsigned long inner_pow;
        unsigned long outer_pow;
    
        for (unsigned int q=2; q<=b; q++) {
            l = log(n)/log(q);
    
            inner_pow = pow(a, q);
            outer_pow = pow(inner_pow, l);
    
            a = outer_pow % n;
        }
        
        gcd_result = gcd(a-1, n);
    } while(gcd_result == n);

    return gcd_result;
}