int main(int ac, char **av) { if (ac == 2) ft_putnbr(ft_is_prime(ft_atoi(av[1]))); ft_putchar('\n'); return (0); }
int ft_find_next_prime(int nb) { if (ft_is_prime(nb)) return (nb); if (nb <= 2) return (2); if ((nb % 2) == 0) nb++; while (nb < (ft_recursive_power(2, 31)) - 1) { if (ft_is_prime(nb)) return (nb); nb += 2; } return (-1); }
int ft_find_next_prime(int nb) { nb++; while (nb++) { if (ft_is_prime(nb)) return (nb); } return (0); }
int ft_find_next_prime(int nb) { int i; i = nb; while (i < nb * 2) { if (ft_is_prime(i) == 1) return (i); i++; } return (0); }
int main() { int i; int sum; int prime; i = 0; sum = 0; prime = 7; while (i <= prime) { if (ft_is_prime(i)) sum += i; i++; } printf("%d\n", sum); return (0); }
int main(void) { int nb; nb = -9; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 0; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 1; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 2; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 3; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 4; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 12; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 13; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 21; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 10254653; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 10254655; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 102546347; printf("%d = %d\n", nb, ft_is_prime(nb)); nb = 2147483647; printf("%d = %d\n", nb, ft_is_prime(nb)); printf("\n"); return (0); }
int main() { printf("%d", ft_is_prime(0)); }
int ft_find_next_prime(int nb) { if (nb < 1) return (2); if (ft_is_prime(nb)) return (nb); return (ft_find_next_prime(nb + 1)); }