Apply suggestions from code review

Co-authored-by: Victor Stinner <vstinner@python.org>

Author: skirpichev

.github/CODEOWNERS

@@ -669,7 +669,7 @@ peps/pep-0788.rst  @ZeroIntensity @vstinner
 # ...
 peps/pep-0789.rst  @njsmith
 peps/pep-0790.rst  @hugovk
-peps/pep-0791.rst  @vstinner
+peps/pep-0791.rst  @skirpichev @vstinner
 # ...
 peps/pep-0801.rst  @warsaw
 # ...

peps/pep-0791.rst

@@ -111,7 +111,7 @@ Module scope and possible extensions
 ------------------------------------
 
 Unless we can just provide bindings to some well supported mathematical library
-like the GMP, the module scope should be limited.  For example, no primality
+like the GMP, the module scope should be limited.  For example, no efficient primality
 testing and factorization.
 
 There are possible additions, among proposed in the initial discussion thread
@@ -120,7 +120,7 @@ There are possible additions, among proposed in the initial discussion thread
 
 * ``c_div()`` --- for integer ceiling divide, see
   `relevant discussion thread <https://discuss.python.org/t/91269>`_.
-* ``gcdext()`` --- to solve linear Diophantine equation in two variables (the
+* ``gcdext()`` --- to solve linear `Diophantine equation <https://en.wikipedia.org/wiki/Diophantine_equation>`_ in two variables (the
   :external+py3.14:class:`int` implementation actually includes an extended
   Euclidean algorithm)
 * ``isqrt_rem()`` --- to return both integer square root and a remainder (if
@@ -129,7 +129,7 @@ There are possible additions, among proposed in the initial discussion thread
   has a special handling for integer arguments.  It's unique (with respect to other module
   functions) and not documented so far, see issue
   `python/cpython#120950 <https://github.com/python/cpython/issues/120950>`_.
-  * ``fibonacci()``.
+* ``fibonacci()`` --- `Fibonacci sequence <https://en.wikipedia.org/wiki/Fibonacci_sequence>`_.
 
 
 Rejected ideas