int	my_find_prime_sup(int nb)
{
  int	prime;
  int	is_prime;
  int	next;
  int	i;

  if (nb <= 1)
    return (2);
  is_prime = my_is_prime(nb);
  if (is_prime)
    prime = nb;
  else
    {
      i = 1;
      while (!is_prime)
	{
	  next = nb + i;
	  is_prime = my_is_prime(next);
	  i = i + 1;
	}
      prime = next;
    }
  return (prime);
}
Example #2
0
int     my_find_prime_sup(int nb)
{
  int   resultat;

  resultat = my_is_prime(nb);
  while (resultat == 0)
    {
      nb = nb + 1;
      resultat = my_is_prime(nb);
    }
  return (nb);
}
Example #3
0
int		my_find_prime_sup(int nb)
{
	int		i;

	if ((my_is_prime(nb)) == 0)
	{
		for (i = nb; i <= 2147483647;i++)
		{
			if ((my_is_prime(i)) == 1)
				return (i);
		}
	}
	return (nb);
}
Example #4
0
int my_find_prime_sup(int nb)
{
  if (nb < 2)
    nb = 2;
  while (!my_is_prime(nb))
    ++nb;
  return (nb);
}
Example #5
0
int	my_find_prime_sup(int nbr)
{
  int	i;

  i = 0;
  while (my_is_prime(nbr + i) != 1)
    i = i + 1;
  return (i);
}
Example #6
0
int	my_find_prime_sup(int nb)
{
  int	i;

  i = 0;
  while (!my_is_prime(nb + i))
    {
      i = i + 1;
    }
  return (nb + i);
}
Example #7
0
int	my_find_prime_sup(int nb)
{
  if (nb <= 1)
    return 0;
  while (my_is_prime(nb) == 0)
  {
    if (nb >= MAX_INT - 1)
      return 0;
    ++nb;
  }
  return nb;
}
int	my_find_prime_sup(int nb)
{
  if (nb <= 2)
    {
      return (2);
    }
  else
    {
      while (my_is_prime(nb) != 1)
	{
	  nb = nb + 1;
	}
      return (nb);
    }
}