Function for primes

Joined
Jun 14, 2021
Messages
5
Reaction score
0
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 to write them in the form of 6n + 1.

Code:
int    is_prime(int nb)
{
    int    i;

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

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

No members online now.

Forum statistics

Threads
473,813
Messages
2,569,696
Members
45,483
Latest member
TedDvb6626

Latest Threads

Top