CakeFest 2017 NYC, the Official CakePHP Conference

# gmp_nextprime

(PHP 5 >= 5.2.0)

gmp_nextprimeFind next prime number

### Opis

resource gmp_nextprime ( int `\$a` )

Find next prime number

### Parametry

`a`

Może być zarówno numerem GMP zasób, lub numerycznym łańcuchem znaków, który można skonwertować z liter do liczb.

### Zwracane wartości

Return the next prime number greater than `a`, as a GMP number.

``` <?php\$prime1 = gmp_nextprime(10); // next prime number greater than 10\$prime2 = gmp_nextprime(-1000); // next prime number greater than -1000echo gmp_strval(\$prime1) . "\n";echo gmp_strval(\$prime2) . "\n";?> ```

```11
-997
```

### Notatki

Informacja:

This function uses a probabilistic algorithm to identify primes and chances to get a composite number are extremely small.

``` It seems gmp_nextprime on negative numbers always returns 2. ```
``` Negative numbers N always have at least four factors: N*1=N and abs(N)*-1=N. Therefore, even if "natural number" weren't in the definition of a prime (which it is), no negative number would ever qualify. Therefore, the next-largest prime number to any negative number is always 2. ```
``` Prime numbers are positive, non-zero numbers that have exactly two factors. No more, no less. So testing negative numbers doesn't really make any sense. ```