1234567891011121314151617181920212223242526272829303132333435363738 | '\" t
.\" Copyright (c) 2026 Bruce Hill
.\" All rights reserved.
.\"
.TH Int.next_prime 3 2026-01-19 "Tomo man-pages"
.SH NAME
Int.next_prime \- get the next prime
.SH LIBRARY
Tomo Standard Library
.SH SYNOPSIS
.nf
.BI Int.next_prime\ :\ func(x:\ Int\ ->\ Int)
.fi
.SH DESCRIPTION
Finds the next prime number greater than the given integer.
.SH ARGUMENTS
.TS
allbox;
lb lb lbx
l l l.
Name Type Description
x Int The integer after which to find the next prime.
.TE
.SH RETURN
The next prime number greater than `x`.
.SH NOTES
This function is _probabilistic_, but the chances of getting an incorrect answer are astronomically small (on the order of 10^(-30)). See [the GNU MP docs](https://gmplib.org/manual/Number-Theoretic-Functions#index-mpz_005fprobab_005fprime_005fp) for more details.
.SH EXAMPLES
.EX
assert 11.next_prime() == 13
.EE
.SH SEE ALSO
.BR Tomo-Int (3)
|