Partition.RGS_enum():RGS_enum()是一個sympy Python庫函數,用於計算受限製的增長字符串(其中a [i]是元素i所在的塊的字符串)的總數,這對於大小為n的超集是可能的。
受限製的增長條件-每個字符中的一個字符串i結果在塊(Bi)對應的元素所屬。
用法: sympy.combinatorics.partitions.Partition.RGS_enum()
返回:受限製的增長字符串的總數,可能對於大小為n的超集。
代碼1:RGS_enum()示例
# Python code explaining
# SymPy.RGS_enum()
# importing SymPy libraries
from sympy.combinatorics.partitions import Partition
from sympy.combinatorics.partitions import RGS_enum
# Using from sympy.combinatorics.partitions.Partition.RGS_enum() method
p = RGS_enum(4)
q = RGS_enum(9)
print ("no. of strings possible for size 4: ", p)
print ("no. of strings possible for size 9: ", q)
輸出:
no. of strings possible for size 4: 15
no. of strings possible for size 9: 203
代碼2:RGS_enum()示例
# Python code explaining
# SymPy.RGS_enum()
# importing SymPy libraries
from sympy.combinatorics.partitions import Partition
from sympy.combinatorics.partitions import RGS_enum
# Using from sympy.combinatorics.partitions.Partition.RGS_enum() method
p = RGS_enum(20)
q = RGS_enum(-1)
print ("no. of strings possible for size 20 ", p)
print ("no. of strings possible for size -1: ", q)
輸出:
no. of strings possible for size 20 51724158235372
no. of strings possible for size -1: 0
相關用法
- Python sympy.cot()用法及代碼示例
- Python sympy.S.EulerGamma用法及代碼示例
- Python sympy.div()用法及代碼示例
- Python sympy.lcm()用法及代碼示例
- Python sympy.gcd()用法及代碼示例
- Python Sympy Prufer.next()用法及代碼示例
- Python Sympy Permutation.min()用法及代碼示例
- Python sympy.Pow()用法及代碼示例
- Python sympy.Mod()用法及代碼示例
- Python sympy.S.GoldenRatio用法及代碼示例
- Python sympy.det()用法及代碼示例
- Python sympy.csc()用法及代碼示例
- Python Sympy Permutation.max()用法及代碼示例
- Python sympy.crt()用法及代碼示例
- Python sympy.apart()用法及代碼示例
注:本文由純淨天空篩選整理自noobestars101大神的英文原創作品 SymPy | Partition.RGS_enum() in Python。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。