#include <stdio.

h>

/* Exercise 8*/
int pgcd(int nbr1, int nbr2)
{
if (nbr2 != 0)
return pgcd(nbr2, nbr1%nbr2);
else
return nbr1;
}

/* Exercise 9*/
int pgcdd(int a ,int b ,int c)
{
return pgcd(c,pgcd(a,b));

/* Exercise 10*/
int PPCM(int a ,int b)
{
if ((a==0) || (b==0))
return 0 ;
else
return (a*b)/pgcd(a,b);

int main()
{

printf("le pgcd est %d \n",pgcd(45,0));

printf("le pgcd est %d \n",pgcdd(45,5,88));
printf("le PPCM est %d ",PPCM(45,90));

return 0;
}

Exercise 11

#include <stdio.h>

void Isprime(int x)

{ int p = 0, i, nbr;
for( i=1; i<=x; i++)
{
if(nbr%i==0)
{
 p++;
}
}
if(p==2)
{
printf("true");
}
else
{
printf("false ");
}
}

int main()
{

Isprime(8) ;

return 0;
}