Programming Assignment #$5--($Calculate the nth Prime Number$)$

$$ Due:$\_$see canvas

Name your program: p$5.$c

This week we are going to simplify last week$$s program with the use of a

Function. The code below is the code shown in class last week. This week we

need to replace the code in the black rectangle with a function called,

check$\_$if$\_$prime$()$;

#include

#define TRUE $1$

#define FALSE $0$

$//$function prototype goes here

int main $($void$)\{$

unsigned int nth$\_$prime, number$\_$of$\_$primes;

unsigned int test$\_$int, divisor;

$\_$Bool isPrime;

printf$("$Enter the nth$\_$prime to find:"$)$;

scanf$("\%$u$",$ &nth$\_$prime$)$;

number$\_$of$\_$primes $=0$;

test$\_$int $=1$;

do

$\{$

test$\_$int$++$;

isPrime$=$TRUE; $//$assume test$\_$int is prime until proven not to be

for$($divisor $=2$; divisor $<$ test$\_$int; divisor$++)$

$\{$

if$($test$\_$int $\%$ divisor $==0)$

$\{$

isPrime $=$ FALSE;

break;

$\}$

$\}$

if$($isPrime $==$ TRUE$)$

number$\_$of$\_$primes$++$;

$\}$

while$($ number$\_$of$\_$primes $<$ nth$\_$prime $)$;

printf$("$The $\%$u Prime Number $=\%$u

$",$ nth$\_$prime, test$\_$int$)$;

return $0$;

$\}$

The function definition should look like:

$\_$Bool check$\_$if$\_$prime$($ unsigned int test$\_$number$)$

$\{$

$//$ code to determine if a number is prime, goes here

$\}$

This function takes an $($unsigned int$)$ as an argument, and returns $0($i$.$e$.$ false$)$ if

the integer is not prime, and returns $1($for true$)$ if the integer is prime.

Once you$$ve completed your program, fill in the table below.

$600$ th Prime Number is: $6,000$th Prime Number is: $60,000$th Prime Number is: