Function for primes

[uwl]

I wish to write a function that determines if a number is prime (1) or not (0). The only rule I know to apply is the number divides evenly by itself and one.

int    is_prime(int nb)
{
    int    i;

    i = 2;
    while (i < nb)
    {
        i++;
    }
    if (nb % nb == 0) // Prime
        return (1);
    return (0);
}

 

[Deleted member 2829]

And now you wonder why your function reports every number as prime ? I guess you have not stepped through this code in a debugger ?
By all means have a critical look at your while and if statements. First, the test should be inside the loop. Second, the test is wrong (always true).