A prime number is an integer greater than 1 that is evenly divisible by only 1 and itself. For example, the number 5 is prime because it can only be evenly divided by 1 and 5. The number 6, however, is not prime because it can be divided by 1, 2, 3, and 6.
Write a function named isPrime, which takes an integer as an argument and returns 1 if the argument is a prime number, and 0 otherwise.
Use this function by calling it in main() to display a list of the prime numbers from 100 to 500.
#include <stdio.h>
int isPrime(int);
int main()
{
int n;
for (n = 100; n <= 500; n++)
{
if (isPrime(n))
{
printf("%d\t", n);
}
}
return 0;
}
int isPrime(int number)
{
int i;
for (i = 2; i < number; i++)
{
if (number % i == 0)
{
return 0;
}
}
return 1;
}
101 103 107 109 113 127 131 137 139 149
151 157 163 167 173 179 181 191 193 197
199 211 223 227 229 233 239 241 251 257
263 269 271 277 281 283 293 307 311 313
317 331 337 347 349 353 359 367 373 379
383 389 397 401 409 419 421 431 433 439
443 449 457 461 463 467 479 487 491 499