PyPyNum 1.5.0__py3-none-any.whl → 1.5.2__py3-none-any.whl

{PyPyNum-1.5.0.dist-info → PyPyNum-1.5.2.dist-info}/METADATA

@@ -1,7 +1,7 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.5.0
-Summary: A Python math package written in pure Python programming language [python_requires >= 3.5]
+Version: 1.5.2
+Summary: A multifunctional mathematical calculation package written in pure Python programming language [Python>=3.5]
 Home-page: https://www.gitee.com/PythonSJL/PyPyNum
 Author: Shen Jiayi
 Author-email: 2261748025@qq.com
@@ -673,8 +673,8 @@ Description-Content-Type: text/markdown
 
 # <font color = blue>PyPyNum</font>
 
-<font color = gree>A Python math package written in pure Python programming language</font> <font color = red>(
-python_requires >= 3.5)</font>
+<font color = gree>A Python math package written in pure Python programming language</font><font color = red>
+(python_requires >= 3.5)</font>
 
 ```
  ________   ___    ___  ________   ___    ___  ________    ___  ___   _____ ______
@@ -687,10 +687,14 @@ python_requires >= 3.5)</font>
           \|___|/                \|___|/
 ```
 
-## Version -> 1.5.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
+## Version -> 1.5.2 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
+PyPI上无法显示logo，可以在Gitee中查看。
+
+The logo cannot be displayed on PyPI, it can be viewed in Gitee.
+
 ### 介绍
 
 #### Introduction
@@ -702,20 +706,27 @@ python_requires >= 3.5)</font>
 + 如需联系，QQ 2261748025 （Py𝙿𝚢𝚝𝚑𝚘𝚗-水晶兰）
 + If you need to contact, QQ 2261748025 (Py𝙿𝚢𝚝𝚑𝚘𝚗-水晶兰)
 
-### PyPyNum的Zen
+### PyPyNum的Zen（预览）
 
-#### The Zen of PyPyNum
+#### The Zen of PyPyNum (Preview)
 
 ```
     The Zen of PyPyNum, by Shen Jiayi
 
 This is a math package written purely in Python.
 
-... (Do you want to see the entire content?
-Then enter "from pypynum import this" on your
+Elegant is superior to clunky.
+Clarity trumps obscurity.
+Straightforwardness is preferred over convolution.
+Sophisticated is better than overcomplicated.
+Flat structure beats nested hierarchies.
+Sparse code wins over bloated ones.
+
+... (Do you want to view all the content?
+Enter "from pypynum import this" in your
 Python interpreter and run it!)
 
-                                December 27, 2023
+                                        February 27, 2024
 ```
 
 ### 与上一个版本相比新增功能
@@ -725,88 +736,69 @@ Python interpreter and run it!)
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-“Symbolics”模块中的希腊字母字符串中存
-在错误，已更正
-There is an error in the Greek
-letter string in the "Symbolics"
-module, which has been corrected
+重写了PyPyNum的Zen。
+
+Rewrote the Zen of PyPyNum.
+
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+
+“maths”模块的一些功能已经进行了优化，
+以实现更快的运行速度。
+
+Some functions of the "maths"
+module have been optimized to
+achieve faster running speed.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-傅立叶变换的类“FT1D”在数据末尾设置自动
-零填充，直到数据长度达到2的正整数幂
-The class "FT1D" of Fourier
-transform sets automatic zero
-padding at the end of the data
-until the data length reaches a
-positive integer power of 2
+修复了“tools”模块中的“split”函数导致
+的字符串分割错误。
+
+Fixed string splitting error
+caused by the "split" function
+in the "tools" module.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-“plotting”模块中添加了一个非常有用的
-“color”函数，可用于使字符串或其他类型
-的数据着色。
-A very useful "color" function
-has been added to the "plotting"
-module, which can be used to
-make strings or other types of
-data colored.
-
-您可以使用此函数为字符上色，然后将其用作
-绘制函数曲线的字符，并将“coloration”
-参数设置为“True”（可能仅适用于
-PyCharm等编程软件）
-You can use this function to
-color a character, then use it
-as the character to draw the
-function curve, and set the
-"color" parameter to "True"
-(which may only be applicable to
-programming software like
-PyCharm)
+“sequence”模块设置为每个序列返回单独
+的第n项或包含第0到第n项的列表的功能。
+
+The "sequence" module sets the
+function of returning a separate
+nth item or a list containing
+0th to nth items for each
+sequence.
+
+
+“geometric_sequence”函数补充了一个
+情况的求解函数，并且已经证实，其余两个情
+况没有解析解，需要使用多项式方程来求解。
+
+The "geometric_sequence"
+function supplements the solving
+function for one scenario, and
+it has been confirmed that there
+are no analytical solutions for
+the remaining two scenarios,
+which need to be solved using
+polynomial equations for
+implementation.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-<The "+" indicates the newly added method>
-
-[This is the base class of vectors, matrices, and tensors]
-
-Array(data=None, check=True)
-    __add__(self, other)
-    __eq__(self, other)
-    __getitem__(self, item)
-    __hash__(self)
-    __init__(self, data=None, check=True)
-    __ne__(self, other)
-    __radd__(self, other)
-    __repr__(self)
-    __round__(self, n=None)
-    __str__(self)
-    argmax(self, axis=None) +
-    argmin(self, axis=None) +
-    basic(self, func, axis=None) +
-    copy(self)
-    flatten(self)
-    max(self, axis=None) +
-    mean(self, axis=None) +
-    median(self, axis=None) +
-    min(self, axis=None) +
-    mode(self, axis=None) +
-    product(self, axis=None) +
-    ptp(self, axis=None) +
-    reshape(self, shape)
-    std(self, axis=None) +
-    sum(self, axis=None) +
-    var(self, axis=None) +
+<<<The "+" indicates the newly added method>>>
 
 maths [Mathematical functions]
-    root(x: num, y: num) -> num +
     ...
-    cumsum(lst: arr) -> list +
-    cumprod(lst: arr) -> list +
-    iroot(y: int, n: int) -> int +
+    geom_mean(numbers: arr) -> num +
+    square_mean(numbers: arr) -> num +
+    harm_mean(numbers: arr) -> num +
+    ...
 
-<<< Other modules also have certain modifications >>>
+sequence [Various sequences]
+    ...
+    recaman(n: int, single: bool = True) -> Union[int, list] +
+    ...
 ```
 
 ### 运行用时测试
@@ -1047,8 +1039,14 @@ PyPyNum
             freq(data: arr) -> dict
             mode(data: arr)
             mean(numbers: arr) -> num
+            geom_mean(numbers: arr) -> num
+            square_mean(numbers: arr) -> num
+            harm_mean(numbers: arr) -> num
             var(numbers: arr) -> num
             std(numbers: arr) -> num
+            cov(x: arr, y: arr) -> num
+            corr_coeff(x: arr, y: arr) -> num
+            coeff_det(x: arr, y: arr) -> num
             product(numbers: arr) -> num
             sigma(i: int, n: int, f) -> num
             pi(i: int, n: int, f) -> num
@@ -1096,9 +1094,12 @@ PyPyNum
             polynomial_regression(x: Union[list, tuple], y: Union[list, tuple], n: int = None) -> list
     ★ sequence [Various sequences]
         FUNCTIONS
+            fibonacci(n: int, single: bool = True) -> Union[int, list]
+            catalan(n: int, single: bool = True) -> Union[int, list]
             bernoulli(n: int, single: bool = True) -> list
-            catalan(n: int) -> int
-            fibonacci(n: int) -> int
+            recaman(n: int, single: bool = True) -> Union[int, list]
+            arithmetic_sequence(*, a1: real = None, an: real = None, d: real = None, n: real = None, s: real = None) -> dict
+            geometric_sequence(*, a1: real = None, an: real = None, r: real = None, n: real = None, s: real = None) -> dict
     ★ tools [Other useful tools]
         FUNCTIONS
             classify(array: Union[list, tuple]) -> dict

{PyPyNum-1.5.0.dist-info → PyPyNum-1.5.2.dist-info}/RECORD

@@ -3,32 +3,32 @@ pypynum/FourierT.py,sha256=AtG0tESykzEs4gDsXhcizW7qhQnmw0gjcWcXefBqzhs,1401
 pypynum/Geometry.py,sha256=bJCuif-wHO-t7oHFEE7ntzIdQwzUEbT3mcKgmBV6Wps,13982
 pypynum/Group.py,sha256=m39OZNRoG9b3p_7sS1u50A0rJl0aYqYPVvnttkYQ_gw,2944
 pypynum/Logic.py,sha256=IJAv59ECHU0HmG9lYCAQ_puqeL6Zor3-IDIVH48KBWE,11000
-pypynum/Matrix.py,sha256=tDo7lFesMmIKula-zbq3UaleW8HshF1LUr8MuT16_oM,10915
+pypynum/Matrix.py,sha256=NLwrjpikZRsT8_tdH20NMFnDh2S2iY_XMOyOJAZQK8w,10771
 pypynum/NeuralN.py,sha256=iSOvC9JW1h4AFGokGGOTkKie5hAYN_YT9H4f3apI9b8,3275
 pypynum/PyPyNum.png,sha256=t96tJPWfHxT8kcXm_qZI2z5W36TgOqjCU9qdgbmlFws,11623
 pypynum/Quaternion.py,sha256=E7ajc4sDJyOuQQIwKPhUEHgiaeeR5BEzFZHhJMxvbok,8007
-pypynum/README.md,sha256=5nzL_Oz3cAPzO8S2MFS15lW6Kt0JH4rz_7ffhIZ_UaY,39546
+pypynum/README.md,sha256=CMrWRhCKqn8BIB_2uIgj2ix2NYCbpYp254IMRes3P-8,39841
 pypynum/Symbolics.py,sha256=Nfo0DEch7LII53ye1wZAdIfd3IAOKbECnZQMSk_cmCs,2898
 pypynum/Tensor.py,sha256=FIeRh0BS_N7Mr_1l_7wv63_BmacjMpit4ydEkXhGaz0,3614
 pypynum/Vector.py,sha256=V_d3sUtr5IEzxqA_ZqjYDuZKCIkkV3kod9Wv8DZYLy0,3310
-pypynum/__init__.py,sha256=zbDAv1MIKOszPg-ac1gYGU8shoXECuFIb5JB3TrscP0,1658
+pypynum/__init__.py,sha256=yBTYauFR5w4ThCCyUWhPakWUYJwnGUUq8hDiHZ5HVN0,1658
 pypynum/__temporary.py,sha256=OAs7it7xjDovgAmKLcj-9Pqp0228SSon3OZx0ih_h4I,5860
 pypynum/cipher.py,sha256=J5PZl8Xt71LuX29eSBu4cybNK6Z3rhA9og_YzD0YJfU,1002
 pypynum/constants.py,sha256=h9zkrZkoTaJ0l8OhXcFlFJFF3ndG94IrAp3V-1ujsD0,806
 pypynum/equations.py,sha256=_4xIXr7A56qBXKzJXyb91L4h09H7TDVNrcufy-XxkaI,744
 pypynum/errors.py,sha256=11-Au4aV8H5ExaDuMtu5iuGvpRaJP8gW7XbGNRmefSI,173
 pypynum/file.py,sha256=rqrPdcX0NOEPM8s40-ymgPKsTn0HKABW-VEh1OtPnsk,3188
-pypynum/maths.py,sha256=2SpP0N2yL98aM_dHfNrm5QSN1JGxWxfxDQYZrH_Hglw,15711
+pypynum/maths.py,sha256=psjcH4_Mfg9vd2QOETNlimbopsMl8yM33TpXrbS5noI,18792
 pypynum/plotting.py,sha256=YQg9sO_nuLSaAKQuSpebWVvbu-ns2A7JOrHch6r0FQ0,8326
 pypynum/probability.py,sha256=kZLCfZb2q_y1CVbozSZj9xQ8Dw3il5WcAojX0jsNyXw,2130
 pypynum/random.py,sha256=vfTtyH5yOSKJoSI_-NT_Tg8wC-ZXT0wt34f87oaSpJY,4610
 pypynum/regression.py,sha256=D9J9lM23HiyY4eE8vHKaHoiwuvD1RYhkVNO0jQ4yml4,2118
-pypynum/sequence.py,sha256=dWhdBZxU_ttQqNR4TMPJMcPqSrrepecnkwI_Q4OrKTQ,1425
+pypynum/sequence.py,sha256=JtRc3pkhso71ZeabxHluyVmTDcoKUKbUcGyk5F4MLdA,6554
 pypynum/test.py,sha256=Bksa7HZaywKBbLaCw2R5kGRFj6eKzkkJ7BdJBgIB3uM,8428
-pypynum/this.py,sha256=z2HU548nVf7yDdsm7Cpzjf55lUVvp7fdHh8XDjokDBU,2406
-pypynum/tools.py,sha256=KXSK-IRYdU3kRDLdnJB0hXRvqxUMwGpYe6Vkz6chhKo,6396
+pypynum/this.py,sha256=8Swp75xE5g6436NCVDfYUVwUzUcQFPLcCNFWQWY5eGQ,2129
+pypynum/tools.py,sha256=8oMApp9ElC_VXlZZl4_ZrGuXZGwNOc0MVA4aigg06Ww,7268
 pypynum/types.py,sha256=CVWPZo_ACr_QGH5gAOhoG3jK35peiqipu3PH8ScEYHE,181
-PyPyNum-1.5.0.dist-info/METADATA,sha256=bVGkhwYBA3Gb6C1Lyr0qaqxQppLSMyjfDURAfh1Gej8,80363
-PyPyNum-1.5.0.dist-info/WHEEL,sha256=2wepM1nk4DS4eFpYrW1TTqPcoGNfHhhO_i5m4cOimbo,92
-PyPyNum-1.5.0.dist-info/top_level.txt,sha256=4wW_Xb4bRglmiMsdPAe9f75MkXhNpuN88H17g_Cr5u8,8
-PyPyNum-1.5.0.dist-info/RECORD,,
+PyPyNum-1.5.2.dist-info/METADATA,sha256=NXHtN5_rvZmOYeKGNca9B1Hl6VMPCO2asADP_yV0PLw,80676
+PyPyNum-1.5.2.dist-info/WHEEL,sha256=2wepM1nk4DS4eFpYrW1TTqPcoGNfHhhO_i5m4cOimbo,92
+PyPyNum-1.5.2.dist-info/top_level.txt,sha256=4wW_Xb4bRglmiMsdPAe9f75MkXhNpuN88H17g_Cr5u8,8
+PyPyNum-1.5.2.dist-info/RECORD,,

pypynum/Matrix.py

@@ -168,10 +168,8 @@ class Matrix(Array):
             if len(item) == 2:
                 if isinstance(item[0], int) and isinstance(item[1], (int, slice)):
                     return self.data[item[0]][item[1]]
-                elif isinstance(item[0], slice) and isinstance(item[1], int):
-                    return self.t().data[item[1]][item[0]]
-                elif isinstance(item[0], slice) and isinstance(item[1], slice):
-                    return Matrix(Matrix(self.data[item[0]]).t().data[item[1]]).t()
+                elif isinstance(item[0], slice) and isinstance(item[1], (int, slice)):
+                    return [row[item[1]] for row in self.data[item[0]]]
                 else:
                     return []
             else:

pypynum/README.md

@@ -1,7 +1,7 @@
 # <font color = blue>PyPyNum</font>
 
-<font color = gree>A Python math package written in pure Python programming language</font> <font color = red>(
-python_requires >= 3.5)</font>
+<font color = gree>A Python math package written in pure Python programming language</font><font color = red>
+(python_requires >= 3.5)</font>
 
 ```
  ________   ___    ___  ________   ___    ___  ________    ___  ___   _____ ______
@@ -14,10 +14,14 @@ python_requires >= 3.5)</font>
           \|___|/                \|___|/
 ```
 
-## Version -> 1.5.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
+## Version -> 1.5.2 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
+PyPI上无法显示logo，可以在Gitee中查看。
+
+The logo cannot be displayed on PyPI, it can be viewed in Gitee.
+
 ### 介绍
 
 #### Introduction
@@ -29,20 +33,27 @@ python_requires >= 3.5)</font>
 + 如需联系，QQ 2261748025 （Py𝙿𝚢𝚝𝚑𝚘𝚗-水晶兰）
 + If you need to contact, QQ 2261748025 (Py𝙿𝚢𝚝𝚑𝚘𝚗-水晶兰)
 
-### PyPyNum的Zen
+### PyPyNum的Zen（预览）
 
-#### The Zen of PyPyNum
+#### The Zen of PyPyNum (Preview)
 
 ```
     The Zen of PyPyNum, by Shen Jiayi
 
 This is a math package written purely in Python.
 
-... (Do you want to see the entire content?
-Then enter "from pypynum import this" on your
+Elegant is superior to clunky.
+Clarity trumps obscurity.
+Straightforwardness is preferred over convolution.
+Sophisticated is better than overcomplicated.
+Flat structure beats nested hierarchies.
+Sparse code wins over bloated ones.
+
+... (Do you want to view all the content?
+Enter "from pypynum import this" in your
 Python interpreter and run it!)
 
-                                December 27, 2023
+                                        February 27, 2024
 ```
 
 ### 与上一个版本相比新增功能
@@ -52,88 +63,69 @@ Python interpreter and run it!)
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-“Symbolics”模块中的希腊字母字符串中存
-在错误，已更正
-There is an error in the Greek
-letter string in the "Symbolics"
-module, which has been corrected
+重写了PyPyNum的Zen。
+
+Rewrote the Zen of PyPyNum.
+
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+
+“maths”模块的一些功能已经进行了优化，
+以实现更快的运行速度。
+
+Some functions of the "maths"
+module have been optimized to
+achieve faster running speed.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-傅立叶变换的类“FT1D”在数据末尾设置自动
-零填充，直到数据长度达到2的正整数幂
-The class "FT1D" of Fourier
-transform sets automatic zero
-padding at the end of the data
-until the data length reaches a
-positive integer power of 2
+修复了“tools”模块中的“split”函数导致
+的字符串分割错误。
+
+Fixed string splitting error
+caused by the "split" function
+in the "tools" module.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-“plotting”模块中添加了一个非常有用的
-“color”函数，可用于使字符串或其他类型
-的数据着色。
-A very useful "color" function
-has been added to the "plotting"
-module, which can be used to
-make strings or other types of
-data colored.
-
-您可以使用此函数为字符上色，然后将其用作
-绘制函数曲线的字符，并将“coloration”
-参数设置为“True”（可能仅适用于
-PyCharm等编程软件）
-You can use this function to
-color a character, then use it
-as the character to draw the
-function curve, and set the
-"color" parameter to "True"
-(which may only be applicable to
-programming software like
-PyCharm)
+“sequence”模块设置为每个序列返回单独
+的第n项或包含第0到第n项的列表的功能。
+
+The "sequence" module sets the
+function of returning a separate
+nth item or a list containing
+0th to nth items for each
+sequence.
+
+
+“geometric_sequence”函数补充了一个
+情况的求解函数，并且已经证实，其余两个情
+况没有解析解，需要使用多项式方程来求解。
+
+The "geometric_sequence"
+function supplements the solving
+function for one scenario, and
+it has been confirmed that there
+are no analytical solutions for
+the remaining two scenarios,
+which need to be solved using
+polynomial equations for
+implementation.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-<The "+" indicates the newly added method>
-
-[This is the base class of vectors, matrices, and tensors]
-
-Array(data=None, check=True)
-    __add__(self, other)
-    __eq__(self, other)
-    __getitem__(self, item)
-    __hash__(self)
-    __init__(self, data=None, check=True)
-    __ne__(self, other)
-    __radd__(self, other)
-    __repr__(self)
-    __round__(self, n=None)
-    __str__(self)
-    argmax(self, axis=None) +
-    argmin(self, axis=None) +
-    basic(self, func, axis=None) +
-    copy(self)
-    flatten(self)
-    max(self, axis=None) +
-    mean(self, axis=None) +
-    median(self, axis=None) +
-    min(self, axis=None) +
-    mode(self, axis=None) +
-    product(self, axis=None) +
-    ptp(self, axis=None) +
-    reshape(self, shape)
-    std(self, axis=None) +
-    sum(self, axis=None) +
-    var(self, axis=None) +
+<<<The "+" indicates the newly added method>>>
 
 maths [Mathematical functions]
-    root(x: num, y: num) -> num +
     ...
-    cumsum(lst: arr) -> list +
-    cumprod(lst: arr) -> list +
-    iroot(y: int, n: int) -> int +
+    geom_mean(numbers: arr) -> num +
+    square_mean(numbers: arr) -> num +
+    harm_mean(numbers: arr) -> num +
+    ...
 
-<<< Other modules also have certain modifications >>>
+sequence [Various sequences]
+    ...
+    recaman(n: int, single: bool = True) -> Union[int, list] +
+    ...
 ```
 
 ### 运行用时测试
@@ -374,8 +366,14 @@ PyPyNum
             freq(data: arr) -> dict
             mode(data: arr)
             mean(numbers: arr) -> num
+            geom_mean(numbers: arr) -> num
+            square_mean(numbers: arr) -> num
+            harm_mean(numbers: arr) -> num
             var(numbers: arr) -> num
             std(numbers: arr) -> num
+            cov(x: arr, y: arr) -> num
+            corr_coeff(x: arr, y: arr) -> num
+            coeff_det(x: arr, y: arr) -> num
             product(numbers: arr) -> num
             sigma(i: int, n: int, f) -> num
             pi(i: int, n: int, f) -> num
@@ -423,9 +421,12 @@ PyPyNum
             polynomial_regression(x: Union[list, tuple], y: Union[list, tuple], n: int = None) -> list
     ★ sequence [Various sequences]
         FUNCTIONS
+            fibonacci(n: int, single: bool = True) -> Union[int, list]
+            catalan(n: int, single: bool = True) -> Union[int, list]
             bernoulli(n: int, single: bool = True) -> list
-            catalan(n: int) -> int
-            fibonacci(n: int) -> int
+            recaman(n: int, single: bool = True) -> Union[int, list]
+            arithmetic_sequence(*, a1: real = None, an: real = None, d: real = None, n: real = None, s: real = None) -> dict
+            geometric_sequence(*, a1: real = None, an: real = None, r: real = None, n: real = None, s: real = None) -> dict
     ★ tools [Other useful tools]
         FUNCTIONS
             classify(array: Union[list, tuple]) -> dict

pypynum/__init__.py

@@ -33,7 +33,7 @@ from .tools import *
 from . import types
 from .Vector import vec
 
-__version__ = "1.5.0"
+__version__ = "1.5.2"
 print("PyPyNum", "Version -> " + __version__, "PyPI -> https://pypi.org/project/PyPyNum/",
       "Gitee -> https://www.gitee.com/PythonSJL/PyPyNum", sep=" | ")
 del math, arr, ite, num, real, geom, RandomError, LogicError, InputError, FullError, Union

pypynum/maths.py

@@ -424,6 +424,57 @@ def mean(numbers: arr) -> num:
     return sum(numbers) / len(numbers)
 
 
+def geom_mean(numbers: arr) -> num:
+    """
+    introduction
+    ==========
+    The geometric mean of numbers
+
+    example
+    ==========
+    >>> geom_mean([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
+    4.528728688116765
+    >>>
+    :param numbers: list | tuple
+    :return:
+    """
+    return root(product(numbers), len(numbers))
+
+
+def square_mean(numbers: arr) -> num:
+    """
+    introduction
+    ==========
+    Square mean of numbers
+
+    example
+    ==========
+    >>> square_mean([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
+    6.2048368229954285
+    >>>
+    :param numbers: list | tuple
+    :return:
+    """
+    return (sum(map(lambda n: n * n, numbers)) / len(numbers)) ** 0.5
+
+
+def harm_mean(numbers: arr) -> num:
+    """
+    introduction
+    ==========
+    The harmonic mean of numbers
+
+    example
+    ==========
+    >>> harm_mean([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
+    3.414171521474055
+    >>>
+    :param numbers: list | tuple
+    :return:
+    """
+    return 0 if 0 in numbers else len(numbers) / sum(map(lambda n: 1 / n, numbers))
+
+
 def var(numbers: arr) -> num:
     """
     introduction
@@ -459,6 +510,70 @@ def std(numbers: arr) -> num:
     return var(numbers) ** 0.5
 
 
+def cov(x: arr, y: arr) -> num:
+    """
+    introduction
+    ==========
+    Covariance of numbers
+
+    example
+    ==========
+    >>> cov([1, 2, 3, 4, 5], [6, 7, 8, 9, 10])
+    2.0
+    >>>
+    :param x: list | tuple
+    :param y: list | tuple
+    :return:
+    """
+    mean_x = mean(x)
+    mean_y = mean(y)
+    return sum([(x_i - mean_x) * (y_i - mean_y) for x_i, y_i in zip(x, y)]) / len(x)
+
+
+def corr_coeff(x: arr, y: arr) -> num:
+    """
+    introduction
+    ==========
+    The correlation coefficient of numbers
+
+    example
+    ==========
+    >>> corr_coeff([1, 2, 3, 4, 5], [6, 7, 8, 9, 10])
+    0.9999999999999998
+    >>>
+    :param x: list | tuple
+    :param y: list | tuple
+    :return:
+    """
+    if len(set(y)) == 1:
+        return 1.0
+    n = len(x)
+    mean_x = mean(x)
+    mean_y = mean(y)
+    covariance = sum((_x - mean_x) * (_y - mean_y) for _x, _y in zip(x, y)) / n
+    std_x = (sum((_x - mean_x) ** 2 for _x in x) / n) ** 0.5
+    std_y = (sum((_y - mean_y) ** 2 for _y in y) / n) ** 0.5
+    return covariance / (std_x * std_y)
+
+
+def coeff_det(x: arr, y: arr) -> num:
+    """
+    introduction
+    ==========
+    The coefficient of determination for numbers
+
+    example
+    ==========
+    >>> coeff_det([1, 2, 3, 4, 5], [6, 7, 8, 9, 10])
+    0.9999999999999996
+    >>>
+    :param x: list | tuple
+    :param y: list | tuple
+    :return:
+    """
+    return corr_coeff(x, y) ** 2
+
+
 def product(numbers: arr) -> num:
     """
     introduction
@@ -473,10 +588,29 @@ def product(numbers: arr) -> num:
     :param numbers: list | tuple
     :return:
     """
-    result = 1
-    for _ in numbers:
-        result *= _
-    return result
+    if len(numbers) == 0:
+        return 1
+    elif 0 in numbers:
+        return 0
+    elif len(numbers) == 1:
+        return numbers[0]
+    elif len(numbers) <= 4096:
+        result = numbers[0]
+        for i in numbers[1:]:
+            result *= i
+        return result
+
+    def prod(n):
+        if len(n) == 1:
+            return n[0]
+        mid = len(n) // 2
+        left_half = n[:mid]
+        right_half = n[mid:]
+        left_product = prod(left_half)
+        right_product = prod(right_half)
+        return left_product * right_product
+
+    return prod(numbers)
 
 
 def sigma(i: int, n: int, f) -> num:
@@ -652,6 +786,8 @@ def combination(n: int, r: int) -> int:
     :param r: integer
     :return:
     """
+    if r > n >> 1:
+        return combination(n, n - r)
     return product(list(range(n, n - r, -1))) // product(list(range(r, 0, -1)))
 
 
@@ -664,13 +800,13 @@ def zeta(alpha: real) -> float:
 
     example
     ==========
-    >>> zeta(2)
-    1.6449339668472496
+    >>> zeta(3)
+    1.202056903150321
     >>>
     :param alpha: integer | float
     :return:
     """
-    return sum([1 / _ ** alpha for _ in range(1, 10000000)])
+    return sum(map(lambda _: _ ** (-alpha), range(1, 1000000)))
 
 
 def gaussian(x: real, _mu: real = 0, _sigma: real = 1) -> float:
@@ -845,7 +981,6 @@ def iroot(y: int, n: int) -> int:
     :param n: integer
     :return:
     """
-    from math import log as _log
     i = False
     if y < 0 and n & 1:
         y = abs(y)
@@ -857,7 +992,7 @@ def iroot(y: int, n: int) -> int:
     try:
         g = int(y ** (1 / n) + 0.5)
     except OverflowError:
-        e = _log(y, 2) / n
+        e = math.log(y, 2) / n
         if e > 53:
             s = int(e - 53)
             g = int(2 ** (e - s) + 1) << s

pypynum/sequence.py

@@ -1,6 +1,16 @@
-def fibonacci(n: int) -> int:
+from .types import Union, real
+
+
+def fibonacci(n: int, single: bool = True) -> Union[int, list]:
     if isinstance(n, float):
         n = int(n)
+    if not single:
+        if n == 0:
+            return [0]
+        res = [0, 1]
+        for i in range(2, n + 1):
+            res.append(res[i - 1] + res[i - 2])
+        return res
 
     def mul(_a, _b):
         c = [[0, 0], [0, 0]]
@@ -22,12 +32,14 @@ def fibonacci(n: int) -> int:
     return res[0][1]
 
 
-def catalan(n: int) -> int:
+def catalan(n: int, single: bool = True) -> Union[int, list]:
     try:
         from math import comb
     except ImportError:
         from .maths import combination as comb
-    return comb(2 * n, n) // (n + 1)
+    if isinstance(n, float):
+        n = int(n)
+    return comb(2 * n, n) // (n + 1) if single else [comb(2 * x, x) // (x + 1) for x in range(n + 1)]
 
 
 def bernoulli(n: int, single: bool = True) -> list:
@@ -47,3 +59,117 @@ def bernoulli(n: int, single: bool = True) -> list:
             b = -s / (m + 1)
         result.append(b)
     return [result[n].numerator, result[n].denominator] if single else [[n.numerator, n.denominator] for n in result]
+
+
+def recaman(n: int, single: bool = True) -> Union[int, list]:
+    if isinstance(n, float):
+        n = int(n)
+    seq = []
+    for i in range(n + 1):
+        if i == 0:
+            x = 0
+        else:
+            x = seq[i - 1] - i
+        if x >= 0 and x not in seq:
+            seq += [x]
+        else:
+            seq += [seq[i - 1] + i]
+    return seq[n] if single else seq
+
+
+def arithmetic_sequence(*, a1: real = None, an: real = None, d: real = None, n: real = None, s: real = None) -> dict:
+    if [a1, an, d, n, s].count(None) != 2:
+        raise ValueError("Must provide exactly three valid parameters")
+
+    def solve_quadratic_equation(a, b, c):
+        delta = b ** 2 - 4 * a * c
+        if delta > 0:
+            x1 = (-b + delta ** 0.5) / (2 * a)
+            x2 = (-b - delta ** 0.5) / (2 * a)
+            return [x1, x2]
+        elif delta == 0:
+            x = -b / (2 * a)
+            return [x]
+        else:
+            return []
+
+    if any([not isinstance(val, (int, float, type(None))) for val in [a1, an, d, n, s]]):
+        raise ValueError("The input parameters must all be real numbers")
+    if a1 is not None and an is not None and d is not None:
+        n = (an - a1) / d + 1
+        s = n / 2 * (2 * a1 + (n - 1) * d)
+    elif a1 is not None and an is not None and n is not None:
+        d = (an - a1) / (n - 1)
+        s = n / 2 * (a1 + an)
+    elif a1 is not None and an is not None and s is not None:
+        n = s * 2 / (a1 + an)
+        d = (an - a1) / (n - 1)
+    elif a1 is not None and d is not None and n is not None:
+        an = a1 + (n - 1) * d
+        s = n / 2 * (2 * a1 + (n - 1) * d)
+    elif a1 is not None and d is not None and s is not None:
+        n = [item for item in solve_quadratic_equation(d, 2 * a1 - d, -2 * s) if item > 0]
+        if len(n) == 1:
+            n = n[0]
+            an = a1 + (n - 1) * d
+    elif a1 is not None and n is not None and s is not None:
+        an = 2 * s / n - a1
+        d = (an - a1) / (n - 1)
+    elif an is not None and d is not None and n is not None:
+        a1 = an - (n - 1) * d
+        s = n / 2 * (a1 + an)
+    elif an is not None and d is not None and s is not None:
+        n = [item for item in solve_quadratic_equation(-d, 2 * an + d, -2 * s) if item > 0]
+        if len(n) == 1:
+            n = n[0]
+            a1 = an - (n - 1) * d
+    elif an is not None and n is not None and s is not None:
+        d = (an * n - s) / (n * (n - 1) / 2)
+        a1 = an - (n - 1) * d
+    elif d is not None and n is not None and s is not None:
+        a1 = (s / n) - (d * (n - 1)) / 2
+        an = a1 + (n - 1) * d
+    if isinstance(n, list):
+        n = sorted(n)
+    return {"a1": a1, "an": an, "d": d, "n": n, "s": s}
+
+
+def geometric_sequence(*, a1: real = None, an: real = None, r: real = None, n: real = None, s: real = None) -> dict:
+    from math import log
+    if [a1, an, r, n, s].count(None) != 2:
+        raise ValueError("Must provide exactly three valid parameters")
+    if any([not isinstance(val, (int, float, type(None))) for val in [a1, an, r, n, s]]):
+        raise ValueError("The input parameters must all be real numbers")
+    if a1 is not None and an is not None and r is not None:
+        n = log(an / a1, r) + 1
+        s = a1 * (r ** n - 1) / (r - 1) if r != 1 else a1 * n
+    elif a1 is not None and an is not None and n is not None:
+        r = (an / a1) ** (1 / (n - 1))
+        s = a1 * (r ** n - 1) / (r - 1) if r != 1 else a1 * n
+    elif a1 is not None and an is not None and s is not None:
+        r = (s - a1) / (s - an)
+        n = log(an / a1, r) + 1
+    elif a1 is not None and r is not None and n is not None:
+        an = a1 * r ** (n - 1)
+        s = a1 * (r ** n - 1) / (r - 1) if r != 1 else a1 * n
+    elif a1 is not None and r is not None and s is not None:
+        an = (s * r - s + a1) / r
+        n = log(an / a1, r) + 1
+    elif a1 is not None and n is not None and s is not None:
+        an = NotImplemented
+        r = NotImplemented
+    elif an is not None and r is not None and n is not None:
+        a1 = an / r ** (n - 1)
+        s = a1 * (r ** n - 1) / (r - 1) if r != 1 else a1 * n
+    elif an is not None and r is not None and s is not None:
+        a1 = s * (1 - r) + an * r
+        n = log(an / a1, r) + 1
+    elif an is not None and n is not None and s is not None:
+        a1 = NotImplemented
+        r = NotImplemented
+    elif r is not None and n is not None and s is not None:
+        a1 = s * (r - 1) / (r ** n - 1)
+        an = a1 * r ** (n - 1)
+    if isinstance(n, list):
+        n = sorted(n)
+    return {"a1": a1, "an": an, "r": r, "n": n, "s": s}

pypynum/this.py

@@ -2,8 +2,8 @@
 The Zen of PyPyNum
 """
 
-Zen = 'rKJHJXTOJX\n\x1d\x1a\x15\x1d\x1b\x1d<XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXrrV\n\x19\x1d\x01X\x19X\x16\x11\x10\x0c\x11\x0fX\x14\x19\x17\x1fX\x0b\x11\x10\x0cX\x0b\x0b\x19\x08\n\r\x0bX\x16\x19\x1bX1rT\x10\x1f\r\x17\x16\x1dX\x0c\x0b\x19\x1eX\x0b\x11X\x1c\x1d\x1d\x08\x0bX\x1d\x0c\x19\x1c\x08\rX\x1d\x10\x0cX\x1e1rT\x0c\x1e\x1d\x14X\x0b\n\x19\x1d\x01X\x1e\x14\x19\x10X\x19X\x1c\x16\x19X\x1d\x16\x17X\x14\x14\x11\x0c\x0bX\x0b\x11X\x1d\n\x1d\x10,rrV\x14\x17\x17\x10\x1b\x0bX\x10\x1f\x11\x10X\x15\x17\n\x1eX\x1c\x1d\x0c\x19\r\x1c\x19\n\x1fX\x01\x1c\x19\x1d\n\x14\x19X\x1d\x0e\x19\x10X1X\x0b\x08\x19\x10\n\x1d(rT\x0b\x14\x19\x17\x1fX\x1f\x16\x11\x0e\x1d\x11\x10\x1b\x19X\x16\x1d\x10\x0fXT\x1d\x0b\n\r\x17\x1bX\x1e7rT\x1d\x1c\x17\x1bX\x1e\x17X\x0b\x1d\x16\x11\x14XHHHHIX\x1c\x1d\x1d\x1b\x00\x1dX\x17\x0cX\x0b\x15\x11\x19X\x1d\x1f\x19\x13\x1b\x19\x08X\x10\x0c\x19\x15X\x0b\x11\x10,rrV\x0c\x11X\x1d\x13\x11\x14X\x16\x19\x1bX\x1d\x16\x17\x01\n\x1d\x0e\x1dX\x1d\x08\x17\x10X1rT\x01(\x11\x1b+X\x1c\x16\x19X\x01(\x15\r6X\x0b\x19X\x10\x1b\r\x0bX\x0b\x1d\x1f\x19\x13\x1b\x19\x08r\x14\x19\x1b\x11\x0c\x19\x15\x1d\x10\x0c\x19\x15X\x1e\x17X\x16\x17\x11\x0c\n\x17\x08X\x14\x14\x19\x15\x0bX\x19X\x1d\x1b\x19\x14\x08\x1d\nX\x16\x19\x1bX\x0c1rT\x1d\x1f\x19\r\x1f\x16\x19\x14X;X\x1d\x0c\r\x1b\x1d\x00\x1dX\x0c\x17\x16\x16\x19\x1bX\x0b\n\x1d\x0c\x1d\n\x08\n\x1d\x0c\x16\x11X\x01(\x01(r\x0c\x19\x10\x0cX\x1d\x1f\x19\x0c\x16\x19\x0e\x1c\x19\x0b\x11\x1cX\x1d\x10\x0cX\n\x17\x1eX\x1d\x0c\x19\x0b\x16\x1d\x08\x15\x17\x1bX\x16\x19\x1bX\x0c\x11X\x0c\r:rT\x1d\x1f\x19\r\x1f\x16\x19\x14X;X\x0b\x19X\x0c\x0b\x19\x1eX\x0b\x19X\x0c\x17\x16X\x0b\x11X\x16\x17\x10\x0c\x01(X\x1d\n\r\x08X\x10\x1f\r\x17\x10\x0c\x149rrV\x1d\x16\x17\x14\x19X\x1d\x15X\x01\x1aX\x16\x1d\x0c\x0c\x11\n\x0fX\x1c\x1d\x1d\x1c\x16\x11X\x0b\x19\x0fX\x0c\x11XT\n\x1d\x0e\x1d\x0f\x170rrG\x0c\x16\x1d\x1c\r\x0c\x0br\x14\x17\x17\x10\x1b\x0bX\x10\x1f\x11\x10X\x19X\x01\x1aX\x16\x1d\x0c\x0c\x11\n\x0fX\x0b\x19\x0fX\x0b\x11\x10\x0cX\x1d\x0e\x1d\x11\x14\x1d\x1aX\r\x17\x01X\x17<rrV\x16\x17\x10\x0c\x01(X\x16\x11X\x01\x14\x1d\n\r\x08X\x16\x1d\x0c\x0c\x11\n\x0fX\x1d\x1f\x19\x13\x1b\x19\x08X\x10\x0c\x19\x15X\x19X\x0b\x11X\x0b\x11\x10,rr\x11\x01\x19\x112X\x16\x1d\x10+X\x01\x1aXT\x15\r6\x01(\x01(X\x1e\x17X\x16\x1d"X\x1d\x10,XXXXr'
-print("".join([chr(ord(_) ^ 120) for _ in Zen[::-1]]))
+Zen = "\x9a¤¢\xa0¢°¼§¢°éâñåâòõÖ°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°\x9a\x9a±äù°õóñâòýõ°ã·äõü½äàõóþÿó°äåÿôþñäã°ñ°ãù°þ÷ùãõô°âñüåôÿÝ\x9a¾÷þùãùýÿâà°õò°äø÷ùý°äù°¼ôâñçâÿöäø÷ùñâäã°ãù°þÿùäñäþõýõüàýù°õøä°öÙ\x9a¾äù°âõôùãþÿóõâ°¼ôþõøõâàýÿó°ÿä°÷þù÷þõüüñøó°ãù°þÿùäñäþõýõüàýù°õøä°öÙ\x9a¾÷þùøãåâ°ÿä°âÿùâõàåã°ãù°÷þùäùñç°ãõýùäõýÿã°¼âõæõçÿØ\x9a¾þÿùäñþùäãñâóÿâà°þñøä°âõääõò°ãù°éüäàýÿâà°÷þùäóÑ\x9a¾øóñÿâààñ°ãåÿùæòÿ½õþÿ°éüþÿ°õøä°¼éüüñõôù½õþÿ°õò°äãåý°õâõøÄ\x9a¾õäñüåóõàã°ÿä°õ÷âå°õøä°äãùãõâ°¼ããõþõå÷ñæ°öÿ°õóþõãõâà°õøä°þÙ\x9a¾ôõäåý°éüäùóùüàèõ°ããõüþÅ\x9a¾ôõóþõüùã°äÿþ°¼þõûÿàã°õò°äãåý°ãâÿââÕ\x9a¾éäùâåà°âõæÿ°ãøàýåùâä°þõäöÿ°éäùüñóùäóñâÀ\x9a¾ãýâÿþ°õøä°õôùââõæÿ°äÿþ°ôüåÿøã°ãõãñó°üñùóõàÃ\x9a¾äþåÿýñâñà°ãù°éäùüùòñôñõÂ\x9a¾ãõþÿ°ôõäñÿüò°âõæÿ°ãþùç°õôÿó°õãâñàÃ\x9a¾ãõùøóâñâõùø°ôõäãõþ°ãäñõò°õâåäóåâäã°äñüÖ\x9a¾ôõäñóùüàýÿóâõæÿ°þñøä°âõääõò°ãù°ôõäñóùäãùøàÿÃ\x9a¾þÿùäåüÿæþÿó°âõæÿ°ôõââõöõâà°ãù°ããõþôâñçâÿöäø÷ùñâäÃ\x9a¾éäùâåóãòÿ°ãàýåâä°éäùâñüÓ\x9a¾éûþåüó°ÿä°âÿùâõàåã°ãù°äþñ÷õüÕ\x9a\x9a¾þÿøäéÀ°þù°éüõâåà°þõääùâç°õ÷ñûóñà°øäñý°ñ°ãù°ãùøÄ\x9a\x9aùéñùÚ°þõøðéò°¼ýåÞéÀéÀ°öÿ°þõÊ°õøÄ°°°°\x9a"
+print("".join([chr(ord(_) ^ 144) for _ in Zen[::-1]]))
 for _ in list(globals().keys()):
     del globals()[_]
 del _

pypynum/tools.py

@@ -160,6 +160,7 @@ def split(iterable: ite, key: arr, retain: bool = False) -> list:
             if indexes:
                 index = min(indexes)
                 result.append(iterable[pointer:index])
+                pointer = index
                 if retain is True:
                     result.append(indexes[index])
                 pointer += len(indexes[index])
@@ -173,7 +174,7 @@ def split(iterable: ite, key: arr, retain: bool = False) -> list:
                 if isinstance(iterable, (list, tuple)):
                     pointer = item + 1
                 if retain is True:
-                    result.append(iterable[item])
+                    result.append([iterable[item]])
         result.append(iterable[pointer:])
     else:
         raise TypeError("Iterable can only be a list, tuple or str")
@@ -211,6 +212,43 @@ def interpolation(data: arr, length: int) -> list:
     return result
 
 
+def primality(n: int, iter_num: int = 10) -> bool:
+    """
+    introduction
+    ==========
+    Using the Miller Rabin method to test the primality of positive integers
+
+    example
+    ==========
+    >>> primality(2 ** 4423 - 1)
+    True
+    >>>
+    :param n: integer
+    :param iter_num: integer
+    :return:
+    """
+    from random import randint
+    if n == 2:
+        return True
+    elif n & 1 == 0 or n < 2:
+        return False
+    m, s = n - 1, 0
+    while m & 1 == 0:
+        m = m >> 1
+        s += 1
+    for _ in range(iter_num):
+        b = pow(randint(2, n - 1), m, n)
+        if b == 1 or b == n - 1:
+            continue
+        for __ in range(s - 1):
+            b = b * b % n
+            if b == n - 1:
+                break
+        else:
+            return False
+    return True
+
+
 if __name__ == "__main__":
     import doctest