Miscellany

int     my_is_prime(int nb)
{
  int   i;

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


int     my_find_prime_sup(int nb)
{
  while (my_is_print(nb) != 1)
    {
      nb++;
    }
  return (nb);
}