test

#include <stdio.h>
#include <stdlib.h>


int modulo(int x, int y){

    while(x >= y){

        x -= y;
    }

    return x;

}

int Prem(int aff){
    int i;
    int view;

    for(i=2;i<aff;i++){

        view = modulo(aff, i);

        if(view == 0){

            return 0;
        }


    }

    return 1;




}

int PGCD(int a, int b){

    if(b == 0){
        return a;
    }else{

   return PGCD(b,modulo(a,b));
    }


}

int rechPrem(int n){

    int i;
    int res;

    for (i=3; i<n; i++) {

        res = PGCD(n,i);

        if(res == 1){

            return i;
        }


    }

    return 0;

}



int main(int argc, const char * argv[]) {
    int x = 6;
    int res;

    res = rechPrem(x);
    printf("%d",res);



    return 0;
}


int rechercheInverse(int c,int n){


}