# gmp_nextprime

(PHP 5 >= 5.2.0, PHP 7)

gmp_nextprimeFind next prime number

### 설명

GMP gmp_nextprime ( int `\$a` )

Find next prime number

### 인수

`a`

PHP 5.5 이전에서 GMP 수 resource나, PHP 5.6 이후에서 GMP 객체, 또는 수로 변환할 수 있는 문자열일 수 있습니다.

### 반환값

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

### 예제

Example #1 gmp_nextprime() example

``` <?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
```

### 주의

Note:

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

``` 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. ```
``` It seems gmp_nextprime on negative numbers always returns 2. ```