docs: remove all docstring references to deleted Sphinx docs

Author: sr-murthy

src/continuedfractions/continuedfraction.py

@@ -119,8 +119,7 @@ def khinchin_mean(self) -> decimal.Decimal | None:
            K_n := \\sqrt[n]{a_1a_2 \\cdots a_n} = \\left( a_1a_2 \\cdots a_n \\right)^{\\frac{1}{n}}, \\hskip{3em} n \\geq 1
 
         This property is intended to make it easier to study the limit of
-        :math:`K_n` as :math:`n \\to \\infty`.  See the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/exploring-continued-fractions.html#khinchin-means-khinchin-s-constant>`_
-        for more details.
+        :math:`K_n` as :math:`n \\to \\infty`.
 
         In the special case of integers or fractions representing integers,
         whose continued fraction representations consist of only a single
@@ -679,9 +678,6 @@ def remainders(self) -> typing.Generator[tuple[int, ContinuedFraction], None, No
         :math:`n + 1` remainders :math:`R_0, R_1, \\ldots, R_n`, and the method
         generates these in reverse order :math:`R_0, R_1, \\ldots, R_n`.
 
-        See the `documentation <https://continuedfractions.readthedocs.io/sources/continued-fractions.html#remainders>`_
-        for more details on remainders.
-
         The remainders are generated as tuples of :py:class:`int`
         and :py:class:`~continuedfraction.continuedfraction.ContinuedFraction`
         instances, where the integers represent the indexes of the remainders.
@@ -720,9 +716,6 @@ def left_mediant(self, other: Fraction, /, *, k: int = 1) -> ContinuedFraction:
 
            \\frac{ka + c}{kb + d}, \\hskip{3em}    k \\geq 1
 
-        For more information consult the
-        `documentation <https://continuedfractions.readthedocs.io/sources/sequences.html#sequences-mediants>`_.
-
         Parameters
         ----------
         other : fractions.Fraction, ContinuedFraction
@@ -770,9 +763,6 @@ def right_mediant(self, other: Fraction, /, *, k: int = 1) -> ContinuedFraction:
 
            \\frac{a + kc}{b + kd}, \\hskip{3em}    k \\geq 1
 
-        For more information consult the
-        `documentation <https://continuedfractions.readthedocs.io/sources/sequences.html#sequences-mediants>`_.
-
         Parameters
         ----------
         other : fractions.Fraction, ContinuedFraction
@@ -827,9 +817,6 @@ def mediant(self, other: Fraction, /) -> ContinuedFraction:
         or :py:meth:`~continuedfractions.continuedfraction.ContinuedFraction.right_mediant`
         methods where the order :math:`k` is set to :math:`1`.
 
-        For more information consult the
-        `documentation <https://continuedfractions.readthedocs.io/sources/sequences.html#sequences-mediants>`_.
-
         Parameters
         ----------
         other : fractions.Fraction, ContinuedFraction
@@ -943,8 +930,7 @@ def __pos__(self) -> ContinuedFraction:
 
     def __neg__(self) -> ContinuedFraction:
         """
-        The negation algorithm for a finite simple continued fraction, as
-        described `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/continued-fractions.html#negative-continued-fractions>`_.
+        The negation algorithm for a finite simple continued fraction.
 
         The basic algorithm can be described as follows: if
         :math:`[a_0; a_1,\\ldots, a_n]` is the simple continued fraction of a

src/continuedfractions/lib.py

@@ -52,15 +52,6 @@ def continued_fraction_rational(frac: Fraction, /) -> typing.Generator[int, None
 
     Negative rational numbers can also be represented in this way, provided we
     use the `Euclidean division lemma <https://en.wikipedia.org/wiki/Euclid%27s_lemma>`_.
-    This is described in more detail in the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/creating-continued-fractions.html#negative-continued-fractions>`_.
-
-    For a definition of "continued fraction", "coefficient", "order",
-    "finite continued fraction", "simple continued fraction", please consult
-    the
-    `package documentation <https://continuedfractions.readthedocs.io/en/stable>`_,
-    or any online resource such as
-    `Wikipedia <https://en.wikipedia.org/wiki/Continued_fraction>`_, or
-    suitable books on number theory.
 
     Parameters
     ----------
@@ -321,9 +312,6 @@ def convergents(*coeffs: int) -> typing.Generator[Fraction, None, None]:
     :math:`C_0, C_1, \\ldots, C_n`, and the function generates these in that
     order.
 
-    See the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/exploring-continued-fractions.html#convergents-and-rational-approximations>`_
-    for more details on convergents.
-
     Parameters
     ----------
     *elements : `int`
@@ -605,9 +593,6 @@ def remainders(*coeffs: int) -> typing.Generator[Fraction, None, None]:
     :math:`R_0, R_1, \\ldots, R_n`, and the function generates these in
     reverse order :math:`R_0, R_1, \\ldots, R_n`.
 
-    See the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/exploring-continued-fractions.html#remainders>`_
-    for more details on remainders.
-
     Parameters
     ----------
     *elements : `int`
@@ -711,9 +696,6 @@ def mediant(r: Fraction, s: Fraction, /, *, dir: str = 'right', k: int = 1) -> F
       \\lim_{k \\to \\infty} \\frac{a + kc}{b + kd} &= \\frac{c}{d}
       \\end{align}
 
-    For more information consult the
-    `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/mediants.html>`_.
-
     For the left mediant use ``dir="left"``, while for the right use
     ``dir="right"``. The default is ``dir="right"``. For ``k = 1`` the left and
     right mediants are identical to the simple mediant :math:`\\frac{a + c}{b + d}`.

src/continuedfractions/sequences.py

@@ -34,8 +34,7 @@ def rationals(
     By default it generates sequences of all positive rational numbers as
     :py:class:`~continuedfractions.continuedfractions.ContinuedFraction`
     objects with the user-specified enumeration on Cantor's 2D
-    representation of the rationals as described in the
-    `documentation <https://continuedfractions.readthedocs.io/sources/sequences.html#rationals>`_.
+    representation of the rationals.
 
     To include negative rationals and :math:`0` set ``positive_only`` to
     ``False``, as described in the documentation and the docstring examples
@@ -113,9 +112,6 @@ def rationals(
         * ``"rectilinear"``
         * ``"rectilinear transposed"``
 
-        These enumerations are described above in the docstring, and also in
-        the `Sphinx documentation <https://continuedfractions.readthedocs.io/sources/pythagorean-triples.html#primitive-pythagorean-triples>`_
-
     positive_only : bool, default=True
         Whether to generate only the positive rationals, which is true by
         default.
@@ -439,8 +435,6 @@ class KSRMTree:
        is described clearly in the papers of Saunders and Randall, and of
        Mitchell.
 
-    See the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/sequences.html#ksrm-trees>`_
-    for more details.
     """
 
     # The two slots for the private attributes for the key tree features - the
@@ -478,8 +472,6 @@ def roots(self) -> typing.Literal[((2, 1), (3, 1))]:
         * Mitchell, D. W. (2001). An Alternative Characterisation of All Primitive Pythagorean Triples. The Mathematical Gazette, 85(503), 273-275. https://doi.org/10.2307/3622017
         * Saunders, R., & Randall, T. (1994). The family tree of the Pythagorean triplets revisited. The Mathematical Gazette, 78(482), 190-193. https://doi.org/10.2307/3618576
 
-        or the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/sequences.html#ksrm-trees>`_.
-
         Examples
         --------
         >>> KSRMTree().roots
@@ -507,8 +499,6 @@ def branches(self) -> tuple[KSRMTreeBranch]:    # noqa: F821
         * Mitchell, D. W. (2001). An Alternative Characterisation of All Primitive Pythagorean Triples. The Mathematical Gazette, 85(503), 273-275. https://doi.org/10.2307/3622017
         * Saunders, R., & Randall, T. (1994). The family tree of the Pythagorean triplets revisited. The Mathematical Gazette, 78(482), 190-193. https://doi.org/10.2307/3618576
 
-        or the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/sequences.html#ksrm-trees>`_.
-
         Examples
         --------
         Generating the first two generations of children for the parent
@@ -962,9 +952,6 @@ def farey_sequence(n: int, /) -> typing.Generator[FareyFraction, None, None]:
     :py:class:`~continuedfractions.sequences.FareyFraction`
     instances, in ascending order of magnitude.
 
-    See the `documentation <https://continuedfractions.readthedocs.io/en/latest/sources/sequences.html#sequences-farey-sequences>`_
-    for more details.
-
     Parameters
     ----------
     n : int: