Partition-number-theory

Partition theory is a subfield of number theory (explored by Euler, Heine, Ramanujan, Rogers etc.) Partition functions play a major role in this field. Explore Partitions function

here is a description to each of the notebooks above feel free to explore them !!

partitions : Partitions of n (positive integer) using eulers pentagonal formula.
partition_improved : using eulers algorithm as above one but with improvements and faster results.
partition_thm_regex : Takes $p(an^b+c) = x \pmod{y}$ as theorem input and verifies it for given number of partitions.
q_ser_sympy : implementation of q series representations of partitions, l-regular, (l,j)-regular partitions using sympy
qsries_scratch : simple implementation of q series representations of partitions, l-regular, (l,j)-regular partitions and their operations using simple data structures (lists, dictionaties). This makes operations much faster than Sympy implemaentation.

Name		Name	Last commit message	Last commit date
Latest commit History 20 Commits
LICENSE		LICENSE
README.md		README.md
app_qsries_scratch.ipynb		app_qsries_scratch.ipynb
partition_comparisions.ipynb		partition_comparisions.ipynb
partition_improved.ipynb		partition_improved.ipynb
partition_thm_regex.ipynb		partition_thm_regex.ipynb
partitions.ipynb		partitions.ipynb
q_ser_sympy.ipynb		q_ser_sympy.ipynb
qsries_scratch.ipynb		qsries_scratch.ipynb